./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e19ca921 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 7adc5be84218941c02109a6f05aa2044beb278121fd387aba807705fdb759027 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 12:36:47,351 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 12:36:47,363 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 12:36:47,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 12:36:47,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 12:36:47,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 12:36:47,382 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 12:36:47,384 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 12:36:47,385 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 12:36:47,385 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 12:36:47,386 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 12:36:47,386 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 12:36:47,387 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 12:36:47,387 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 12:36:47,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 12:36:47,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 12:36:47,389 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 12:36:47,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 12:36:47,391 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 12:36:47,392 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 12:36:47,393 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 12:36:47,393 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 12:36:47,394 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 12:36:47,395 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 12:36:47,396 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 12:36:47,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 12:36:47,397 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 12:36:47,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 12:36:47,397 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 12:36:47,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 12:36:47,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 12:36:47,399 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 12:36:47,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 12:36:47,400 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 12:36:47,400 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 12:36:47,400 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 12:36:47,401 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 12:36:47,401 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 12:36:47,401 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 12:36:47,402 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 12:36:47,402 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 12:36:47,403 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-22 12:36:47,423 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 12:36:47,423 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 12:36:47,424 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 12:36:47,424 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 12:36:47,425 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 12:36:47,425 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 12:36:47,425 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 12:36:47,425 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 12:36:47,426 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 12:36:47,426 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 12:36:47,426 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 12:36:47,426 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 12:36:47,427 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 12:36:47,427 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 12:36:47,427 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-22 12:36:47,427 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 12:36:47,427 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-22 12:36:47,427 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 12:36:47,427 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 12:36:47,428 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 12:36:47,428 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-22 12:36:47,428 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 12:36:47,428 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 12:36:47,428 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 12:36:47,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 12:36:47,429 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 12:36:47,429 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 12:36:47,430 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-22 12:36:47,430 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 12:36:47,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 12:36:47,430 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-22 12:36:47,430 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-22 12:36:47,430 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-22 12:36:47,431 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 12:36:47,431 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 7adc5be84218941c02109a6f05aa2044beb278121fd387aba807705fdb759027 [2021-12-22 12:36:47,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 12:36:47,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 12:36:47,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 12:36:47,635 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 12:36:47,635 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 12:36:47,636 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c [2021-12-22 12:36:47,682 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47392b107/0af48940b1364f508686b19906bebcb2/FLAGfd90cf56e [2021-12-22 12:36:48,271 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 12:36:48,272 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c [2021-12-22 12:36:48,304 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47392b107/0af48940b1364f508686b19906bebcb2/FLAGfd90cf56e [2021-12-22 12:36:48,416 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47392b107/0af48940b1364f508686b19906bebcb2 [2021-12-22 12:36:48,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 12:36:48,419 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 12:36:48,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 12:36:48,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 12:36:48,422 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 12:36:48,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 12:36:48" (1/1) ... [2021-12-22 12:36:48,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@617c9df6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:36:48, skipping insertion in model container [2021-12-22 12:36:48,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 12:36:48" (1/1) ... [2021-12-22 12:36:48,429 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 12:36:48,572 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 12:36:49,758 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c[380323,380336] [2021-12-22 12:36:49,774 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c[383339,383352] [2021-12-22 12:36:49,860 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 12:36:49,867 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 12:36:50,457 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c[380323,380336] [2021-12-22 12:36:50,461 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c[383339,383352] [2021-12-22 12:36:50,472 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 12:36:50,519 INFO L208 MainTranslator]: Completed translation [2021-12-22 12:36:50,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:36:50 WrapperNode [2021-12-22 12:36:50,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 12:36:50,520 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 12:36:50,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 12:36:50,520 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 12:36:50,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:36:50" (1/1) ... [2021-12-22 12:36:50,587 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:36:50" (1/1) ... [2021-12-22 12:36:50,924 INFO L137 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12566 [2021-12-22 12:36:50,924 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 12:36:50,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 12:36:50,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 12:36:50,926 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 12:36:50,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:36:50" (1/1) ... [2021-12-22 12:36:50,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:36:50" (1/1) ... [2021-12-22 12:36:51,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:36:50" (1/1) ... [2021-12-22 12:36:51,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:36:50" (1/1) ... [2021-12-22 12:36:51,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:36:50" (1/1) ... [2021-12-22 12:36:51,208 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:36:50" (1/1) ... [2021-12-22 12:36:51,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:36:50" (1/1) ... [2021-12-22 12:36:51,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 12:36:51,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 12:36:51,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 12:36:51,285 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 12:36:51,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:36:50" (1/1) ... [2021-12-22 12:36:51,292 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 12:36:51,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 12:36:51,320 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-22 12:36:51,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-22 12:36:51,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 12:36:51,349 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-12-22 12:36:51,349 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-12-22 12:36:51,349 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-12-22 12:36:51,349 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-12-22 12:36:51,349 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-12-22 12:36:51,349 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-12-22 12:36:51,349 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-22 12:36:51,349 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-22 12:36:51,350 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-12-22 12:36:51,350 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-12-22 12:36:51,350 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-12-22 12:36:51,350 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-12-22 12:36:51,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 12:36:51,350 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-12-22 12:36:51,350 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-12-22 12:36:51,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 12:36:51,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 12:36:51,445 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 12:36:51,446 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 12:36:56,166 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 12:36:56,186 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 12:36:56,186 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-22 12:36:56,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 12:36:56 BoogieIcfgContainer [2021-12-22 12:36:56,189 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 12:36:56,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 12:36:56,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 12:36:56,193 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 12:36:56,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 12:36:48" (1/3) ... [2021-12-22 12:36:56,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750d1081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 12:36:56, skipping insertion in model container [2021-12-22 12:36:56,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:36:50" (2/3) ... [2021-12-22 12:36:56,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750d1081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 12:36:56, skipping insertion in model container [2021-12-22 12:36:56,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 12:36:56" (3/3) ... [2021-12-22 12:36:56,195 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.01.cil-2.c [2021-12-22 12:36:56,198 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 12:36:56,198 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-22 12:36:56,235 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 12:36:56,239 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-22 12:36:56,239 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-22 12:36:56,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 2298 states, 2271 states have (on average 1.8590929106120653) internal successors, (4222), 2276 states have internal predecessors, (4222), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2021-12-22 12:36:56,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-22 12:36:56,274 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 12:36:56,275 INFO L514 BasicCegarLoop]: 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] [2021-12-22 12:36:56,275 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 12:36:56,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 12:36:56,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1417964819, now seen corresponding path program 1 times [2021-12-22 12:36:56,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 12:36:56,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437779663] [2021-12-22 12:36:56,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:36:56,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 12:36:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:36:56,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 12:36:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:36:56,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 12:36:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:36:56,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 12:36:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:36:56,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 12:36:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:36:56,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 12:36:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:36:56,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 12:36:56,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 12:36:56,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437779663] [2021-12-22 12:36:56,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437779663] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 12:36:56,553 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 12:36:56,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 12:36:56,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849743900] [2021-12-22 12:36:56,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 12:36:56,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 12:36:56,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 12:36:56,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 12:36:56,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 12:36:56,602 INFO L87 Difference]: Start difference. First operand has 2298 states, 2271 states have (on average 1.8590929106120653) internal successors, (4222), 2276 states have internal predecessors, (4222), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-22 12:36:57,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 12:36:57,118 INFO L93 Difference]: Finished difference Result 4727 states and 8720 transitions. [2021-12-22 12:36:57,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 12:36:57,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-22 12:36:57,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 12:36:57,136 INFO L225 Difference]: With dead ends: 4727 [2021-12-22 12:36:57,136 INFO L226 Difference]: Without dead ends: 2368 [2021-12-22 12:36:57,142 INFO L932 BasicCegarLoop]: 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 [2021-12-22 12:36:57,144 INFO L933 BasicCegarLoop]: 4199 mSDtfsCounter, 4329 mSDsluCounter, 12409 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4337 SdHoareTripleChecker+Valid, 16608 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 12:36:57,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4337 Valid, 16608 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 12:36:57,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2021-12-22 12:36:57,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2325. [2021-12-22 12:36:57,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2325 states, 2283 states have (on average 1.838370565045992) internal successors, (4197), 2287 states have internal predecessors, (4197), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2021-12-22 12:36:57,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 2325 states and 4252 transitions. [2021-12-22 12:36:57,246 INFO L78 Accepts]: Start accepts. Automaton has 2325 states and 4252 transitions. Word has length 58 [2021-12-22 12:36:57,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 12:36:57,247 INFO L470 AbstractCegarLoop]: Abstraction has 2325 states and 4252 transitions. [2021-12-22 12:36:57,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-22 12:36:57,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2325 states and 4252 transitions. [2021-12-22 12:36:57,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-22 12:36:57,254 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 12:36:57,255 INFO L514 BasicCegarLoop]: 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] [2021-12-22 12:36:57,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 12:36:57,255 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 12:36:57,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 12:36:57,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1082743281, now seen corresponding path program 1 times [2021-12-22 12:36:57,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 12:36:57,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277798716] [2021-12-22 12:36:57,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:36:57,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 12:36:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:36:57,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 12:36:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:36:57,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 12:36:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:36:57,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 12:36:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:36:57,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 12:36:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:36:57,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 12:36:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:36:57,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 12:36:57,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 12:36:57,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277798716] [2021-12-22 12:36:57,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277798716] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 12:36:57,359 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 12:36:57,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 12:36:57,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185959332] [2021-12-22 12:36:57,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 12:36:57,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 12:36:57,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 12:36:57,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 12:36:57,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-22 12:36:57,364 INFO L87 Difference]: Start difference. First operand 2325 states and 4252 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-22 12:36:57,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 12:36:57,968 INFO L93 Difference]: Finished difference Result 2676 states and 4760 transitions. [2021-12-22 12:36:57,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 12:36:57,969 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-22 12:36:57,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 12:36:57,981 INFO L225 Difference]: With dead ends: 2676 [2021-12-22 12:36:57,981 INFO L226 Difference]: Without dead ends: 2481 [2021-12-22 12:36:57,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-22 12:36:57,985 INFO L933 BasicCegarLoop]: 4200 mSDtfsCounter, 4245 mSDsluCounter, 16416 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4253 SdHoareTripleChecker+Valid, 20616 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 12:36:57,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4253 Valid, 20616 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 12:36:57,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2021-12-22 12:36:58,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 2415. [2021-12-22 12:36:58,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2415 states, 2356 states have (on average 1.8259762308998302) internal successors, (4302), 2361 states have internal predecessors, (4302), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2021-12-22 12:36:58,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2415 states to 2415 states and 4379 transitions. [2021-12-22 12:36:58,026 INFO L78 Accepts]: Start accepts. Automaton has 2415 states and 4379 transitions. Word has length 58 [2021-12-22 12:36:58,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 12:36:58,027 INFO L470 AbstractCegarLoop]: Abstraction has 2415 states and 4379 transitions. [2021-12-22 12:36:58,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-22 12:36:58,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2415 states and 4379 transitions. [2021-12-22 12:36:58,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-22 12:36:58,028 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 12:36:58,028 INFO L514 BasicCegarLoop]: 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] [2021-12-22 12:36:58,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 12:36:58,029 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 12:36:58,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 12:36:58,029 INFO L85 PathProgramCache]: Analyzing trace with hash -189256943, now seen corresponding path program 1 times [2021-12-22 12:36:58,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 12:36:58,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596419275] [2021-12-22 12:36:58,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:36:58,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 12:36:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:36:58,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 12:36:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:36:58,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 12:36:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:36:58,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 12:36:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:36:58,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 12:36:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:36:58,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 12:36:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:36:58,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 12:36:58,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 12:36:58,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596419275] [2021-12-22 12:36:58,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596419275] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 12:36:58,122 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 12:36:58,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 12:36:58,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824992443] [2021-12-22 12:36:58,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 12:36:58,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 12:36:58,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 12:36:58,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 12:36:58,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-22 12:36:58,124 INFO L87 Difference]: Start difference. First operand 2415 states and 4379 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-22 12:36:58,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 12:36:58,632 INFO L93 Difference]: Finished difference Result 3027 states and 5257 transitions. [2021-12-22 12:36:58,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-22 12:36:58,632 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-22 12:36:58,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 12:36:58,641 INFO L225 Difference]: With dead ends: 3027 [2021-12-22 12:36:58,641 INFO L226 Difference]: Without dead ends: 2742 [2021-12-22 12:36:58,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-22 12:36:58,643 INFO L933 BasicCegarLoop]: 4190 mSDtfsCounter, 4299 mSDsluCounter, 16404 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4309 SdHoareTripleChecker+Valid, 20594 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 12:36:58,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4309 Valid, 20594 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 12:36:58,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2021-12-22 12:36:58,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 2590. [2021-12-22 12:36:58,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2590 states, 2499 states have (on average 1.8043217286914766) internal successors, (4509), 2506 states have internal predecessors, (4509), 55 states have call successors, (55), 31 states have call predecessors, (55), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2021-12-22 12:36:58,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 4630 transitions. [2021-12-22 12:36:58,686 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 4630 transitions. Word has length 58 [2021-12-22 12:36:58,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 12:36:58,687 INFO L470 AbstractCegarLoop]: Abstraction has 2590 states and 4630 transitions. [2021-12-22 12:36:58,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-22 12:36:58,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 4630 transitions. [2021-12-22 12:36:58,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-22 12:36:58,688 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 12:36:58,688 INFO L514 BasicCegarLoop]: 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] [2021-12-22 12:36:58,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 12:36:58,689 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 12:36:58,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 12:36:58,689 INFO L85 PathProgramCache]: Analyzing trace with hash 2056322511, now seen corresponding path program 1 times [2021-12-22 12:36:58,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 12:36:58,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564598042] [2021-12-22 12:36:58,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:36:58,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 12:36:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:36:58,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 12:36:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:36:58,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 12:36:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:36:58,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 12:36:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:36:58,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 12:36:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:36:58,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 12:36:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:36:58,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 12:36:58,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 12:36:58,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564598042] [2021-12-22 12:36:58,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564598042] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 12:36:58,770 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 12:36:58,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 12:36:58,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6641332] [2021-12-22 12:36:58,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 12:36:58,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 12:36:58,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 12:36:58,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 12:36:58,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-22 12:36:58,772 INFO L87 Difference]: Start difference. First operand 2590 states and 4630 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-22 12:36:59,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 12:36:59,320 INFO L93 Difference]: Finished difference Result 3579 states and 6048 transitions. [2021-12-22 12:36:59,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-22 12:36:59,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-22 12:36:59,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 12:36:59,332 INFO L225 Difference]: With dead ends: 3579 [2021-12-22 12:36:59,334 INFO L226 Difference]: Without dead ends: 3119 [2021-12-22 12:36:59,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-22 12:36:59,345 INFO L933 BasicCegarLoop]: 4191 mSDtfsCounter, 4242 mSDsluCounter, 16386 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4249 SdHoareTripleChecker+Valid, 20577 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 12:36:59,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4249 Valid, 20577 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 12:36:59,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3119 states. [2021-12-22 12:36:59,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3119 to 2889. [2021-12-22 12:36:59,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2889 states, 2740 states have (on average 1.7682481751824817) internal successors, (4845), 2751 states have internal predecessors, (4845), 87 states have call successors, (87), 53 states have call predecessors, (87), 60 states have return successors, (120), 92 states have call predecessors, (120), 85 states have call successors, (120) [2021-12-22 12:36:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 5052 transitions. [2021-12-22 12:36:59,426 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 5052 transitions. Word has length 58 [2021-12-22 12:36:59,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 12:36:59,426 INFO L470 AbstractCegarLoop]: Abstraction has 2889 states and 5052 transitions. [2021-12-22 12:36:59,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-22 12:36:59,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 5052 transitions. [2021-12-22 12:36:59,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-22 12:36:59,427 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 12:36:59,428 INFO L514 BasicCegarLoop]: 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] [2021-12-22 12:36:59,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 12:36:59,428 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 12:36:59,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 12:36:59,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1158929233, now seen corresponding path program 1 times [2021-12-22 12:36:59,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 12:36:59,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056990691] [2021-12-22 12:36:59,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:36:59,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 12:36:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:36:59,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 12:36:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:36:59,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 12:36:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:36:59,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 12:36:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:36:59,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 12:36:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:36:59,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 12:36:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:36:59,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 12:36:59,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 12:36:59,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056990691] [2021-12-22 12:36:59,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056990691] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 12:36:59,470 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 12:36:59,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 12:36:59,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761203789] [2021-12-22 12:36:59,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 12:36:59,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 12:36:59,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 12:36:59,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 12:36:59,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 12:36:59,472 INFO L87 Difference]: Start difference. First operand 2889 states and 5052 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-22 12:36:59,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 12:36:59,911 INFO L93 Difference]: Finished difference Result 4253 states and 6998 transitions. [2021-12-22 12:36:59,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 12:36:59,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-22 12:36:59,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 12:36:59,929 INFO L225 Difference]: With dead ends: 4253 [2021-12-22 12:36:59,929 INFO L226 Difference]: Without dead ends: 3495 [2021-12-22 12:36:59,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-12-22 12:36:59,932 INFO L933 BasicCegarLoop]: 4225 mSDtfsCounter, 4354 mSDsluCounter, 12196 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4377 SdHoareTripleChecker+Valid, 16421 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 12:36:59,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4377 Valid, 16421 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 12:36:59,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3495 states. [2021-12-22 12:37:00,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3495 to 3290. [2021-12-22 12:37:00,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3290 states, 3058 states have (on average 1.723675604970569) internal successors, (5271), 3078 states have internal predecessors, (5271), 136 states have call successors, (136), 83 states have call predecessors, (136), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2021-12-22 12:37:00,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3290 states to 3290 states and 5586 transitions. [2021-12-22 12:37:00,062 INFO L78 Accepts]: Start accepts. Automaton has 3290 states and 5586 transitions. Word has length 58 [2021-12-22 12:37:00,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 12:37:00,062 INFO L470 AbstractCegarLoop]: Abstraction has 3290 states and 5586 transitions. [2021-12-22 12:37:00,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-22 12:37:00,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3290 states and 5586 transitions. [2021-12-22 12:37:00,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-22 12:37:00,065 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 12:37:00,065 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 12:37:00,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 12:37:00,066 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 12:37:00,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 12:37:00,066 INFO L85 PathProgramCache]: Analyzing trace with hash 747002154, now seen corresponding path program 1 times [2021-12-22 12:37:00,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 12:37:00,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582717097] [2021-12-22 12:37:00,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:37:00,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 12:37:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:00,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 12:37:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:00,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 12:37:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:00,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 12:37:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:00,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 12:37:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:00,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 12:37:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:00,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-22 12:37:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:00,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 12:37:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:00,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-22 12:37:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:00,182 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-22 12:37:00,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 12:37:00,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582717097] [2021-12-22 12:37:00,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582717097] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 12:37:00,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505860539] [2021-12-22 12:37:00,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:37:00,183 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 12:37:00,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 12:37:00,184 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 12:37:00,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-22 12:37:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:00,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-22 12:37:00,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 12:37:00,397 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-22 12:37:00,397 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 12:37:00,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505860539] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 12:37:00,398 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 12:37:00,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-22 12:37:00,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48675116] [2021-12-22 12:37:00,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 12:37:00,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 12:37:00,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 12:37:00,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 12:37:00,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 12:37:00,399 INFO L87 Difference]: Start difference. First operand 3290 states and 5586 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 12:37:00,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 12:37:00,468 INFO L93 Difference]: Finished difference Result 5496 states and 8712 transitions. [2021-12-22 12:37:00,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 12:37:00,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93 [2021-12-22 12:37:00,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 12:37:00,482 INFO L225 Difference]: With dead ends: 5496 [2021-12-22 12:37:00,482 INFO L226 Difference]: Without dead ends: 4338 [2021-12-22 12:37:00,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 12:37:00,486 INFO L933 BasicCegarLoop]: 4229 mSDtfsCounter, 114 mSDsluCounter, 4108 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 8337 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 12:37:00,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 8337 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 12:37:00,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4338 states. [2021-12-22 12:37:00,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4338 to 4338. [2021-12-22 12:37:00,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4338 states, 3897 states have (on average 1.6440851937387735) internal successors, (6407), 3930 states have internal predecessors, (6407), 255 states have call successors, (255), 161 states have call predecessors, (255), 184 states have return successors, (376), 262 states have call predecessors, (376), 253 states have call successors, (376) [2021-12-22 12:37:00,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4338 states to 4338 states and 7038 transitions. [2021-12-22 12:37:00,580 INFO L78 Accepts]: Start accepts. Automaton has 4338 states and 7038 transitions. Word has length 93 [2021-12-22 12:37:00,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 12:37:00,580 INFO L470 AbstractCegarLoop]: Abstraction has 4338 states and 7038 transitions. [2021-12-22 12:37:00,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 12:37:00,580 INFO L276 IsEmpty]: Start isEmpty. Operand 4338 states and 7038 transitions. [2021-12-22 12:37:00,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-12-22 12:37:00,585 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 12:37:00,585 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 12:37:00,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-22 12:37:00,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-22 12:37:00,803 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 12:37:00,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 12:37:00,804 INFO L85 PathProgramCache]: Analyzing trace with hash 385246456, now seen corresponding path program 1 times [2021-12-22 12:37:00,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 12:37:00,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97639467] [2021-12-22 12:37:00,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:37:00,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 12:37:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:00,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 12:37:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:00,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 12:37:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:00,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 12:37:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:00,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 12:37:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:00,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 12:37:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:00,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-22 12:37:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:00,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 12:37:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:00,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-22 12:37:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:00,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 12:37:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:00,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-22 12:37:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:00,973 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-22 12:37:00,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 12:37:00,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97639467] [2021-12-22 12:37:00,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97639467] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 12:37:00,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317474295] [2021-12-22 12:37:00,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:37:00,974 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 12:37:00,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 12:37:00,975 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 12:37:01,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-22 12:37:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:01,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-22 12:37:01,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 12:37:01,245 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-22 12:37:01,245 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 12:37:01,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317474295] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 12:37:01,246 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 12:37:01,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-22 12:37:01,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796870359] [2021-12-22 12:37:01,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 12:37:01,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 12:37:01,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 12:37:01,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 12:37:01,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 12:37:01,248 INFO L87 Difference]: Start difference. First operand 4338 states and 7038 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-22 12:37:01,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 12:37:01,356 INFO L93 Difference]: Finished difference Result 8608 states and 13011 transitions. [2021-12-22 12:37:01,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 12:37:01,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 119 [2021-12-22 12:37:01,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 12:37:01,394 INFO L225 Difference]: With dead ends: 8608 [2021-12-22 12:37:01,395 INFO L226 Difference]: Without dead ends: 6405 [2021-12-22 12:37:01,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 12:37:01,404 INFO L933 BasicCegarLoop]: 4141 mSDtfsCounter, 4038 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4038 SdHoareTripleChecker+Valid, 4273 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 [2021-12-22 12:37:01,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4038 Valid, 4273 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 12:37:01,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6405 states. [2021-12-22 12:37:01,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6405 to 6345. [2021-12-22 12:37:01,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6345 states, 5510 states have (on average 1.561705989110708) internal successors, (8605), 5572 states have internal predecessors, (8605), 475 states have call successors, (475), 311 states have call predecessors, (475), 358 states have return successors, (688), 477 states have call predecessors, (688), 473 states have call successors, (688) [2021-12-22 12:37:01,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6345 states to 6345 states and 9768 transitions. [2021-12-22 12:37:01,550 INFO L78 Accepts]: Start accepts. Automaton has 6345 states and 9768 transitions. Word has length 119 [2021-12-22 12:37:01,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 12:37:01,550 INFO L470 AbstractCegarLoop]: Abstraction has 6345 states and 9768 transitions. [2021-12-22 12:37:01,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-22 12:37:01,550 INFO L276 IsEmpty]: Start isEmpty. Operand 6345 states and 9768 transitions. [2021-12-22 12:37:01,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-22 12:37:01,557 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 12:37:01,557 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 12:37:01,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-22 12:37:01,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-12-22 12:37:01,776 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 12:37:01,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 12:37:01,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1965387098, now seen corresponding path program 1 times [2021-12-22 12:37:01,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 12:37:01,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555271421] [2021-12-22 12:37:01,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:37:01,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 12:37:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:01,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 12:37:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:01,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 12:37:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:01,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 12:37:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:01,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 12:37:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:01,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 12:37:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:01,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-22 12:37:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:01,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-22 12:37:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:01,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 12:37:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:01,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-22 12:37:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:01,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 12:37:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:01,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-22 12:37:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:01,844 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2021-12-22 12:37:01,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 12:37:01,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555271421] [2021-12-22 12:37:01,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555271421] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 12:37:01,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017181867] [2021-12-22 12:37:01,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:37:01,844 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 12:37:01,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 12:37:01,845 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 12:37:01,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-22 12:37:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:01,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-22 12:37:01,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 12:37:02,067 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-22 12:37:02,068 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 12:37:02,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017181867] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 12:37:02,068 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 12:37:02,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-22 12:37:02,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664663856] [2021-12-22 12:37:02,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 12:37:02,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 12:37:02,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 12:37:02,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 12:37:02,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 12:37:02,070 INFO L87 Difference]: Start difference. First operand 6345 states and 9768 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-22 12:37:02,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 12:37:02,237 INFO L93 Difference]: Finished difference Result 9619 states and 14299 transitions. [2021-12-22 12:37:02,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 12:37:02,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 135 [2021-12-22 12:37:02,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 12:37:02,252 INFO L225 Difference]: With dead ends: 9619 [2021-12-22 12:37:02,252 INFO L226 Difference]: Without dead ends: 6673 [2021-12-22 12:37:02,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 12:37:02,260 INFO L933 BasicCegarLoop]: 4132 mSDtfsCounter, 4059 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4059 SdHoareTripleChecker+Valid, 4272 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 12:37:02,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4059 Valid, 4272 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 12:37:02,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6673 states. [2021-12-22 12:37:02,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6673 to 6635. [2021-12-22 12:37:02,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6635 states, 5768 states have (on average 1.535887656033287) internal successors, (8859), 5830 states have internal predecessors, (8859), 481 states have call successors, (481), 337 states have call predecessors, (481), 384 states have return successors, (720), 483 states have call predecessors, (720), 479 states have call successors, (720) [2021-12-22 12:37:02,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6635 states to 6635 states and 10060 transitions. [2021-12-22 12:37:02,406 INFO L78 Accepts]: Start accepts. Automaton has 6635 states and 10060 transitions. Word has length 135 [2021-12-22 12:37:02,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 12:37:02,406 INFO L470 AbstractCegarLoop]: Abstraction has 6635 states and 10060 transitions. [2021-12-22 12:37:02,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-22 12:37:02,407 INFO L276 IsEmpty]: Start isEmpty. Operand 6635 states and 10060 transitions. [2021-12-22 12:37:02,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-22 12:37:02,415 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 12:37:02,415 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-22 12:37:02,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-22 12:37:02,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 12:37:02,632 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 12:37:02,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 12:37:02,632 INFO L85 PathProgramCache]: Analyzing trace with hash 946429697, now seen corresponding path program 1 times [2021-12-22 12:37:02,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 12:37:02,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660537304] [2021-12-22 12:37:02,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:37:02,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 12:37:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:02,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 12:37:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:02,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 12:37:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:02,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 12:37:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:02,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 12:37:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:02,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 12:37:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:02,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-22 12:37:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:02,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 12:37:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:02,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 12:37:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:02,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-22 12:37:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:02,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 12:37:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:02,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-22 12:37:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:02,704 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-22 12:37:02,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 12:37:02,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660537304] [2021-12-22 12:37:02,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660537304] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 12:37:02,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661767928] [2021-12-22 12:37:02,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:37:02,705 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 12:37:02,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 12:37:02,706 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 12:37:02,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-22 12:37:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:02,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-22 12:37:02,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 12:37:02,944 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-22 12:37:02,944 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 12:37:02,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661767928] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 12:37:02,944 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 12:37:02,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-22 12:37:02,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101698326] [2021-12-22 12:37:02,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 12:37:02,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 12:37:02,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 12:37:02,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 12:37:02,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 12:37:02,947 INFO L87 Difference]: Start difference. First operand 6635 states and 10060 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-22 12:37:03,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 12:37:03,048 INFO L93 Difference]: Finished difference Result 9031 states and 13439 transitions. [2021-12-22 12:37:03,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 12:37:03,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 136 [2021-12-22 12:37:03,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 12:37:03,064 INFO L225 Difference]: With dead ends: 9031 [2021-12-22 12:37:03,064 INFO L226 Difference]: Without dead ends: 6671 [2021-12-22 12:37:03,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 12:37:03,072 INFO L933 BasicCegarLoop]: 4217 mSDtfsCounter, 111 mSDsluCounter, 4099 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 8316 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 [2021-12-22 12:37:03,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 8316 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 12:37:03,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6671 states. [2021-12-22 12:37:03,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6671 to 6611. [2021-12-22 12:37:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6611 states, 5744 states have (on average 1.5217618384401115) internal successors, (8741), 5806 states have internal predecessors, (8741), 481 states have call successors, (481), 337 states have call predecessors, (481), 384 states have return successors, (720), 483 states have call predecessors, (720), 479 states have call successors, (720) [2021-12-22 12:37:03,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6611 states to 6611 states and 9942 transitions. [2021-12-22 12:37:03,205 INFO L78 Accepts]: Start accepts. Automaton has 6611 states and 9942 transitions. Word has length 136 [2021-12-22 12:37:03,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 12:37:03,205 INFO L470 AbstractCegarLoop]: Abstraction has 6611 states and 9942 transitions. [2021-12-22 12:37:03,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-22 12:37:03,206 INFO L276 IsEmpty]: Start isEmpty. Operand 6611 states and 9942 transitions. [2021-12-22 12:37:03,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-22 12:37:03,213 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 12:37:03,213 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 12:37:03,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-22 12:37:03,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 12:37:03,427 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 12:37:03,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 12:37:03,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1815303137, now seen corresponding path program 1 times [2021-12-22 12:37:03,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 12:37:03,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796052234] [2021-12-22 12:37:03,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:37:03,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 12:37:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:03,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 12:37:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:03,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 12:37:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:03,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 12:37:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:03,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 12:37:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:03,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 12:37:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:03,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-22 12:37:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:03,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 12:37:03,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:03,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 12:37:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:03,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-22 12:37:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:03,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 12:37:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:03,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-22 12:37:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:03,496 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-22 12:37:03,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 12:37:03,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796052234] [2021-12-22 12:37:03,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796052234] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 12:37:03,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196181539] [2021-12-22 12:37:03,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:37:03,496 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 12:37:03,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 12:37:03,497 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 12:37:03,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-22 12:37:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:03,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-22 12:37:03,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 12:37:03,763 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-22 12:37:03,763 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 12:37:03,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196181539] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 12:37:03,764 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 12:37:03,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-22 12:37:03,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935501051] [2021-12-22 12:37:03,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 12:37:03,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 12:37:03,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 12:37:03,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 12:37:03,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 12:37:03,766 INFO L87 Difference]: Start difference. First operand 6611 states and 9942 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-22 12:37:03,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 12:37:03,898 INFO L93 Difference]: Finished difference Result 9935 states and 14498 transitions. [2021-12-22 12:37:03,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 12:37:03,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 136 [2021-12-22 12:37:03,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 12:37:03,913 INFO L225 Difference]: With dead ends: 9935 [2021-12-22 12:37:03,913 INFO L226 Difference]: Without dead ends: 5993 [2021-12-22 12:37:03,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 12:37:03,924 INFO L933 BasicCegarLoop]: 4112 mSDtfsCounter, 4089 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4089 SdHoareTripleChecker+Valid, 4136 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 12:37:03,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4089 Valid, 4136 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 12:37:03,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2021-12-22 12:37:04,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 5763. [2021-12-22 12:37:04,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5763 states, 5062 states have (on average 1.5205452390359542) internal successors, (7697), 5108 states have internal predecessors, (7697), 393 states have call successors, (393), 275 states have call predecessors, (393), 306 states have return successors, (510), 387 states have call predecessors, (510), 391 states have call successors, (510) [2021-12-22 12:37:04,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5763 states to 5763 states and 8600 transitions. [2021-12-22 12:37:04,079 INFO L78 Accepts]: Start accepts. Automaton has 5763 states and 8600 transitions. Word has length 136 [2021-12-22 12:37:04,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 12:37:04,079 INFO L470 AbstractCegarLoop]: Abstraction has 5763 states and 8600 transitions. [2021-12-22 12:37:04,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-22 12:37:04,080 INFO L276 IsEmpty]: Start isEmpty. Operand 5763 states and 8600 transitions. [2021-12-22 12:37:04,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-22 12:37:04,085 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 12:37:04,085 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 12:37:04,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-22 12:37:04,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-22 12:37:04,299 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 12:37:04,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 12:37:04,300 INFO L85 PathProgramCache]: Analyzing trace with hash 874736092, now seen corresponding path program 1 times [2021-12-22 12:37:04,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 12:37:04,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865394672] [2021-12-22 12:37:04,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:37:04,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 12:37:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:04,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 12:37:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:04,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 12:37:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:04,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 12:37:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:04,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 12:37:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:04,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 12:37:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:04,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-22 12:37:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:04,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 12:37:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:04,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 12:37:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:04,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-22 12:37:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:04,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 12:37:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:04,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-22 12:37:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:04,382 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-22 12:37:04,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 12:37:04,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865394672] [2021-12-22 12:37:04,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865394672] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 12:37:04,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430450182] [2021-12-22 12:37:04,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:37:04,383 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 12:37:04,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 12:37:04,384 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 12:37:04,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-22 12:37:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:04,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-22 12:37:04,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 12:37:04,659 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-22 12:37:04,659 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 12:37:04,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430450182] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 12:37:04,659 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 12:37:04,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-22 12:37:04,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165117893] [2021-12-22 12:37:04,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 12:37:04,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 12:37:04,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 12:37:04,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 12:37:04,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-22 12:37:04,662 INFO L87 Difference]: Start difference. First operand 5763 states and 8600 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 12:37:04,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 12:37:04,866 INFO L93 Difference]: Finished difference Result 7191 states and 10479 transitions. [2021-12-22 12:37:04,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 12:37:04,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2021-12-22 12:37:04,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 12:37:04,877 INFO L225 Difference]: With dead ends: 7191 [2021-12-22 12:37:04,877 INFO L226 Difference]: Without dead ends: 4833 [2021-12-22 12:37:04,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-22 12:37:04,885 INFO L933 BasicCegarLoop]: 4090 mSDtfsCounter, 4107 mSDsluCounter, 8071 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4115 SdHoareTripleChecker+Valid, 12161 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 12:37:04,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4115 Valid, 12161 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 12:37:04,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4833 states. [2021-12-22 12:37:05,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4833 to 4821. [2021-12-22 12:37:05,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4821 states, 4302 states have (on average 1.5488145048814506) internal successors, (6663), 4330 states have internal predecessors, (6663), 297 states have call successors, (297), 205 states have call predecessors, (297), 220 states have return successors, (354), 289 states have call predecessors, (354), 295 states have call successors, (354) [2021-12-22 12:37:05,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4821 states to 4821 states and 7314 transitions. [2021-12-22 12:37:05,026 INFO L78 Accepts]: Start accepts. Automaton has 4821 states and 7314 transitions. Word has length 137 [2021-12-22 12:37:05,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 12:37:05,026 INFO L470 AbstractCegarLoop]: Abstraction has 4821 states and 7314 transitions. [2021-12-22 12:37:05,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 12:37:05,026 INFO L276 IsEmpty]: Start isEmpty. Operand 4821 states and 7314 transitions. [2021-12-22 12:37:05,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-22 12:37:05,029 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 12:37:05,029 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 12:37:05,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-22 12:37:05,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 12:37:05,248 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 12:37:05,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 12:37:05,248 INFO L85 PathProgramCache]: Analyzing trace with hash -991972582, now seen corresponding path program 1 times [2021-12-22 12:37:05,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 12:37:05,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992035992] [2021-12-22 12:37:05,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:37:05,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 12:37:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:05,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 12:37:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:05,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 12:37:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:05,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 12:37:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:05,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 12:37:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:05,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 12:37:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:05,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-22 12:37:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:05,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 12:37:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:05,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 12:37:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:05,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-22 12:37:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:05,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 12:37:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:05,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-22 12:37:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:05,319 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-22 12:37:05,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 12:37:05,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992035992] [2021-12-22 12:37:05,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992035992] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 12:37:05,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372754101] [2021-12-22 12:37:05,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:37:05,319 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 12:37:05,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 12:37:05,321 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 12:37:05,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-22 12:37:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:05,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-22 12:37:05,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 12:37:05,573 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-22 12:37:05,573 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 12:37:05,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372754101] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 12:37:05,574 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 12:37:05,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-22 12:37:05,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041118908] [2021-12-22 12:37:05,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 12:37:05,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 12:37:05,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 12:37:05,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 12:37:05,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-22 12:37:05,575 INFO L87 Difference]: Start difference. First operand 4821 states and 7314 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 12:37:05,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 12:37:05,796 INFO L93 Difference]: Finished difference Result 7162 states and 10301 transitions. [2021-12-22 12:37:05,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 12:37:05,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2021-12-22 12:37:05,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 12:37:05,805 INFO L225 Difference]: With dead ends: 7162 [2021-12-22 12:37:05,806 INFO L226 Difference]: Without dead ends: 4769 [2021-12-22 12:37:05,810 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-22 12:37:05,811 INFO L933 BasicCegarLoop]: 4102 mSDtfsCounter, 4128 mSDsluCounter, 8068 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4136 SdHoareTripleChecker+Valid, 12170 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 12:37:05,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4136 Valid, 12170 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 12:37:05,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4769 states. [2021-12-22 12:37:05,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4769 to 3795. [2021-12-22 12:37:05,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3795 states, 3488 states have (on average 1.6023509174311927) internal successors, (5589), 3504 states have internal predecessors, (5589), 175 states have call successors, (175), 123 states have call predecessors, (175), 130 states have return successors, (203), 169 states have call predecessors, (203), 173 states have call successors, (203) [2021-12-22 12:37:05,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3795 states to 3795 states and 5967 transitions. [2021-12-22 12:37:05,908 INFO L78 Accepts]: Start accepts. Automaton has 3795 states and 5967 transitions. Word has length 137 [2021-12-22 12:37:05,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 12:37:05,908 INFO L470 AbstractCegarLoop]: Abstraction has 3795 states and 5967 transitions. [2021-12-22 12:37:05,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 12:37:05,909 INFO L276 IsEmpty]: Start isEmpty. Operand 3795 states and 5967 transitions. [2021-12-22 12:37:05,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-22 12:37:05,911 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 12:37:05,911 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 12:37:05,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-22 12:37:06,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 12:37:06,128 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 12:37:06,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 12:37:06,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1995852316, now seen corresponding path program 1 times [2021-12-22 12:37:06,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 12:37:06,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054540023] [2021-12-22 12:37:06,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:37:06,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 12:37:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:06,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 12:37:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:06,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 12:37:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:06,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 12:37:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:06,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 12:37:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:06,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 12:37:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:06,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-22 12:37:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:06,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 12:37:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:06,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 12:37:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:06,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-22 12:37:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:06,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 12:37:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:06,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-22 12:37:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:06,216 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-22 12:37:06,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 12:37:06,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054540023] [2021-12-22 12:37:06,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054540023] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 12:37:06,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89077752] [2021-12-22 12:37:06,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:37:06,216 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 12:37:06,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 12:37:06,217 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 12:37:06,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-22 12:37:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:06,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-22 12:37:06,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 12:37:06,456 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-22 12:37:06,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 12:37:06,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89077752] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 12:37:06,456 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 12:37:06,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-22 12:37:06,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933843321] [2021-12-22 12:37:06,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 12:37:06,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 12:37:06,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 12:37:06,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 12:37:06,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-22 12:37:06,458 INFO L87 Difference]: Start difference. First operand 3795 states and 5967 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 12:37:06,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 12:37:06,622 INFO L93 Difference]: Finished difference Result 4934 states and 7353 transitions. [2021-12-22 12:37:06,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 12:37:06,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2021-12-22 12:37:06,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 12:37:06,628 INFO L225 Difference]: With dead ends: 4934 [2021-12-22 12:37:06,628 INFO L226 Difference]: Without dead ends: 3270 [2021-12-22 12:37:06,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-22 12:37:06,631 INFO L933 BasicCegarLoop]: 4102 mSDtfsCounter, 48 mSDsluCounter, 12315 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 16417 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 12:37:06,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 16417 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 12:37:06,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2021-12-22 12:37:06,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 3234. [2021-12-22 12:37:06,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3234 states, 3034 states have (on average 1.654911008569545) internal successors, (5021), 3046 states have internal predecessors, (5021), 112 states have call successors, (112), 80 states have call predecessors, (112), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2021-12-22 12:37:06,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 5254 transitions. [2021-12-22 12:37:06,692 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 5254 transitions. Word has length 137 [2021-12-22 12:37:06,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 12:37:06,692 INFO L470 AbstractCegarLoop]: Abstraction has 3234 states and 5254 transitions. [2021-12-22 12:37:06,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 12:37:06,692 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 5254 transitions. [2021-12-22 12:37:06,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-22 12:37:06,694 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 12:37:06,694 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 12:37:06,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-22 12:37:06,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-22 12:37:06,904 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 12:37:06,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 12:37:06,905 INFO L85 PathProgramCache]: Analyzing trace with hash 688947232, now seen corresponding path program 1 times [2021-12-22 12:37:06,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 12:37:06,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435216918] [2021-12-22 12:37:06,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:37:06,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 12:37:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:06,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 12:37:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:06,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 12:37:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:06,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 12:37:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:06,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 12:37:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:06,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 12:37:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:06,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-22 12:37:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:06,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 12:37:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:06,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 12:37:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:06,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-22 12:37:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:06,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 12:37:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:06,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-22 12:37:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:06,971 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-22 12:37:06,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 12:37:06,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435216918] [2021-12-22 12:37:06,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435216918] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 12:37:06,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162195702] [2021-12-22 12:37:06,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:37:06,971 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 12:37:06,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 12:37:06,972 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 12:37:06,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-22 12:37:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:07,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-22 12:37:07,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 12:37:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-22 12:37:07,211 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 12:37:07,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162195702] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 12:37:07,211 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 12:37:07,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-22 12:37:07,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333967049] [2021-12-22 12:37:07,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 12:37:07,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 12:37:07,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 12:37:07,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 12:37:07,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-22 12:37:07,212 INFO L87 Difference]: Start difference. First operand 3234 states and 5254 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 12:37:07,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 12:37:07,292 INFO L93 Difference]: Finished difference Result 4365 states and 6615 transitions. [2021-12-22 12:37:07,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 12:37:07,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2021-12-22 12:37:07,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 12:37:07,299 INFO L225 Difference]: With dead ends: 4365 [2021-12-22 12:37:07,299 INFO L226 Difference]: Without dead ends: 3262 [2021-12-22 12:37:07,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-22 12:37:07,301 INFO L933 BasicCegarLoop]: 4101 mSDtfsCounter, 10 mSDsluCounter, 12302 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 16403 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 12:37:07,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 16403 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 12:37:07,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2021-12-22 12:37:07,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3246. [2021-12-22 12:37:07,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3246 states, 3046 states have (on average 1.6454366382140513) internal successors, (5012), 3058 states have internal predecessors, (5012), 112 states have call successors, (112), 80 states have call predecessors, (112), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2021-12-22 12:37:07,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3246 states to 3246 states and 5245 transitions. [2021-12-22 12:37:07,367 INFO L78 Accepts]: Start accepts. Automaton has 3246 states and 5245 transitions. Word has length 137 [2021-12-22 12:37:07,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 12:37:07,367 INFO L470 AbstractCegarLoop]: Abstraction has 3246 states and 5245 transitions. [2021-12-22 12:37:07,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 12:37:07,367 INFO L276 IsEmpty]: Start isEmpty. Operand 3246 states and 5245 transitions. [2021-12-22 12:37:07,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-22 12:37:07,370 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 12:37:07,370 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 12:37:07,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-22 12:37:07,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-22 12:37:07,583 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 12:37:07,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 12:37:07,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1312364636, now seen corresponding path program 1 times [2021-12-22 12:37:07,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 12:37:07,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094285055] [2021-12-22 12:37:07,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:37:07,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 12:37:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:07,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 12:37:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:07,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 12:37:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:07,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 12:37:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:07,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 12:37:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:07,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 12:37:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:07,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-22 12:37:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:07,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 12:37:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:07,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 12:37:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:07,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-22 12:37:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:07,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 12:37:07,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:07,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-22 12:37:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:07,672 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-12-22 12:37:07,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 12:37:07,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094285055] [2021-12-22 12:37:07,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094285055] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 12:37:07,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 12:37:07,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 12:37:07,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016130970] [2021-12-22 12:37:07,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 12:37:07,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 12:37:07,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 12:37:07,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 12:37:07,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 12:37:07,675 INFO L87 Difference]: Start difference. First operand 3246 states and 5245 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-22 12:37:08,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 12:37:08,116 INFO L93 Difference]: Finished difference Result 4206 states and 6319 transitions. [2021-12-22 12:37:08,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 12:37:08,116 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 137 [2021-12-22 12:37:08,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 12:37:08,124 INFO L225 Difference]: With dead ends: 4206 [2021-12-22 12:37:08,125 INFO L226 Difference]: Without dead ends: 4203 [2021-12-22 12:37:08,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-12-22 12:37:08,128 INFO L933 BasicCegarLoop]: 4172 mSDtfsCounter, 4444 mSDsluCounter, 12192 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4467 SdHoareTripleChecker+Valid, 16364 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 12:37:08,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4467 Valid, 16364 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 12:37:08,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4203 states. [2021-12-22 12:37:08,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4203 to 3622. [2021-12-22 12:37:08,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3622 states, 3356 states have (on average 1.598331346841478) internal successors, (5364), 3372 states have internal predecessors, (5364), 146 states have call successors, (146), 104 states have call predecessors, (146), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2021-12-22 12:37:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 5673 transitions. [2021-12-22 12:37:08,232 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 5673 transitions. Word has length 137 [2021-12-22 12:37:08,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 12:37:08,232 INFO L470 AbstractCegarLoop]: Abstraction has 3622 states and 5673 transitions. [2021-12-22 12:37:08,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-22 12:37:08,233 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 5673 transitions. [2021-12-22 12:37:08,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-22 12:37:08,235 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 12:37:08,235 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 12:37:08,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-22 12:37:08,235 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 12:37:08,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 12:37:08,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1384992052, now seen corresponding path program 1 times [2021-12-22 12:37:08,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 12:37:08,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959010876] [2021-12-22 12:37:08,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:37:08,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 12:37:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:08,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 12:37:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:08,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 12:37:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:08,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 12:37:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:08,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 12:37:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:08,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 12:37:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:08,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-22 12:37:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:08,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 12:37:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:08,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 12:37:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:08,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-22 12:37:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:08,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 12:37:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:08,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-22 12:37:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:37:08,284 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-22 12:37:08,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 12:37:08,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959010876] [2021-12-22 12:37:08,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959010876] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 12:37:08,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 12:37:08,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 12:37:08,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957303972] [2021-12-22 12:37:08,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 12:37:08,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 12:37:08,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 12:37:08,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 12:37:08,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 12:37:08,285 INFO L87 Difference]: Start difference. First operand 3622 states and 5673 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 12:37:08,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 12:37:08,533 INFO L93 Difference]: Finished difference Result 4845 states and 7161 transitions. [2021-12-22 12:37:08,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 12:37:08,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 141 [2021-12-22 12:37:08,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 12:37:08,541 INFO L225 Difference]: With dead ends: 4845 [2021-12-22 12:37:08,541 INFO L226 Difference]: Without dead ends: 3985 [2021-12-22 12:37:08,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-22 12:37:08,544 INFO L933 BasicCegarLoop]: 4151 mSDtfsCounter, 142 mSDsluCounter, 12166 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 16317 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 12:37:08,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 16317 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 12:37:08,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3985 states. [2021-12-22 12:37:08,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3985 to 3624. [2021-12-22 12:37:08,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3624 states, 3358 states have (on average 1.5979749851101845) internal successors, (5366), 3374 states have internal predecessors, (5366), 146 states have call successors, (146), 104 states have call predecessors, (146), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2021-12-22 12:37:08,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3624 states to 3624 states and 5675 transitions. [2021-12-22 12:37:08,641 INFO L78 Accepts]: Start accepts. Automaton has 3624 states and 5675 transitions. Word has length 141 [2021-12-22 12:37:08,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 12:37:08,642 INFO L470 AbstractCegarLoop]: Abstraction has 3624 states and 5675 transitions. [2021-12-22 12:37:08,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 12:37:08,642 INFO L276 IsEmpty]: Start isEmpty. Operand 3624 states and 5675 transitions. [2021-12-22 12:37:08,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-12-22 12:37:08,644 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 12:37:08,644 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 12:37:08,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-22 12:37:08,644 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 12:37:08,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 12:37:08,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1244161439, now seen corresponding path program 1 times [2021-12-22 12:37:08,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 12:37:08,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805453933] [2021-12-22 12:37:08,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:37:08,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 12:37:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 12:37:08,657 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 12:37:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 12:37:08,710 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 12:37:08,711 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-22 12:37:08,712 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-22 12:37:08,713 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-22 12:37:08,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-22 12:37:08,716 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 12:37:08,718 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-22 12:37:08,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 12:37:08 BoogieIcfgContainer [2021-12-22 12:37:08,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-22 12:37:08,819 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 12:37:08,819 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 12:37:08,819 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 12:37:08,820 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 12:36:56" (3/4) ... [2021-12-22 12:37:08,821 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-22 12:37:08,905 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-22 12:37:08,906 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 12:37:08,906 INFO L158 Benchmark]: Toolchain (without parser) took 20487.18ms. Allocated memory was 102.8MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 61.8MB in the beginning and 426.5MB in the end (delta: -364.7MB). Peak memory consumption was 912.9MB. Max. memory is 16.1GB. [2021-12-22 12:37:08,907 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 102.8MB. Free memory was 59.9MB in the beginning and 59.8MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 12:37:08,907 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2099.75ms. Allocated memory was 102.8MB in the beginning and 169.9MB in the end (delta: 67.1MB). Free memory was 61.8MB in the beginning and 68.0MB in the end (delta: -6.2MB). Peak memory consumption was 91.1MB. Max. memory is 16.1GB. [2021-12-22 12:37:08,907 INFO L158 Benchmark]: Boogie Procedure Inliner took 404.68ms. Allocated memory was 169.9MB in the beginning and 255.9MB in the end (delta: 86.0MB). Free memory was 68.0MB in the beginning and 113.6MB in the end (delta: -45.6MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2021-12-22 12:37:08,908 INFO L158 Benchmark]: Boogie Preprocessor took 358.54ms. Allocated memory is still 255.9MB. Free memory was 113.6MB in the beginning and 104.1MB in the end (delta: 9.4MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2021-12-22 12:37:08,908 INFO L158 Benchmark]: RCFGBuilder took 4904.61ms. Allocated memory was 255.9MB in the beginning and 868.2MB in the end (delta: 612.4MB). Free memory was 104.1MB in the beginning and 464.4MB in the end (delta: -360.3MB). Peak memory consumption was 256.3MB. Max. memory is 16.1GB. [2021-12-22 12:37:08,908 INFO L158 Benchmark]: TraceAbstraction took 12627.89ms. Allocated memory was 868.2MB in the beginning and 1.4GB in the end (delta: 513.8MB). Free memory was 463.4MB in the beginning and 446.4MB in the end (delta: 17.0MB). Peak memory consumption was 531.8MB. Max. memory is 16.1GB. [2021-12-22 12:37:08,908 INFO L158 Benchmark]: Witness Printer took 86.58ms. Allocated memory is still 1.4GB. Free memory was 446.4MB in the beginning and 426.5MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-22 12:37:08,913 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 102.8MB. Free memory was 59.9MB in the beginning and 59.8MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2099.75ms. Allocated memory was 102.8MB in the beginning and 169.9MB in the end (delta: 67.1MB). Free memory was 61.8MB in the beginning and 68.0MB in the end (delta: -6.2MB). Peak memory consumption was 91.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 404.68ms. Allocated memory was 169.9MB in the beginning and 255.9MB in the end (delta: 86.0MB). Free memory was 68.0MB in the beginning and 113.6MB in the end (delta: -45.6MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 358.54ms. Allocated memory is still 255.9MB. Free memory was 113.6MB in the beginning and 104.1MB in the end (delta: 9.4MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * RCFGBuilder took 4904.61ms. Allocated memory was 255.9MB in the beginning and 868.2MB in the end (delta: 612.4MB). Free memory was 104.1MB in the beginning and 464.4MB in the end (delta: -360.3MB). Peak memory consumption was 256.3MB. Max. memory is 16.1GB. * TraceAbstraction took 12627.89ms. Allocated memory was 868.2MB in the beginning and 1.4GB in the end (delta: 513.8MB). Free memory was 463.4MB in the beginning and 446.4MB in the end (delta: 17.0MB). Peak memory consumption was 531.8MB. Max. memory is 16.1GB. * Witness Printer took 86.58ms. Allocated memory is still 1.4GB. Free memory was 446.4MB in the beginning and 426.5MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. 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: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int m_st ; [L11180] int t1_st ; [L11181] int m_i ; [L11182] int t1_i ; [L11183] int M_E = 2; [L11184] int T1_E = 2; [L11185] int E_M = 2; [L11186] int E_1 = 2; [L11190] int token ; [L11192] int local ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L11651] COND FALSE !(__VERIFIER_nondet_int()) [L11654] CALL main2() [L11638] int __retres1 ; [L11642] CALL init_model() [L11553] m_i = 1 [L11554] t1_i = 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11642] RET init_model() [L11643] CALL start_simulation() [L11579] int kernel_st ; [L11580] int tmp ; [L11581] int tmp___0 ; [L11585] kernel_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11586] FCALL update_channels() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] CALL init_threads() [L11335] COND TRUE m_i == 1 [L11336] m_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11340] COND TRUE t1_i == 1 [L11341] t1_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] RET init_threads() [L11588] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11424] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11429] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11434] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11439] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11588] RET fire_delta_events() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11299] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11301] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11308] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11318] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11320] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L11589] RET activate_threads() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11452] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11457] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11462] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11467] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] RET reset_delta_events() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11593] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11596] kernel_st = 1 [L11597] CALL eval() [L11371] int tmp ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11375] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11350] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11366] return (__retres1); VAL [\result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] RET, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, exists_runnable_thread()=1, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND FALSE !(\read(tmp_ndt_1)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND TRUE t1_pc == 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11264] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11350] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11366] return (__retres1); VAL [\result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] RET, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, exists_runnable_thread()=1, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND TRUE m_pc == 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11208] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11211] token = __VERIFIER_nondet_int() [L11212] local = token [L11213] E_1 = 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11214] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11506] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11299] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11301] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11308] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11309] COND TRUE E_1 == 1 [L11310] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11320] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L11506] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11214] RET immediate_notify() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] m_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11391] RET master() [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND FALSE !(t1_pc == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11256] COND TRUE t1_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11272] token += 1 [L11273] E_M = 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11289] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11290] COND TRUE E_M == 1 [L11291] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11301] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND TRUE \read(tmp) [L11485] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11308] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11309] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11318] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11320] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L11506] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] RET immediate_notify() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11275] E_M = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11264] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L11378] CALL, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11350] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11366] return (__retres1); VAL [\result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] RET, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, exists_runnable_thread()=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND FALSE !(m_pc == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11200] COND TRUE m_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11222] COND FALSE !(token != local + 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11227] COND TRUE tmp_var <= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11228] COND TRUE tmp_var >= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11233] COND TRUE tmp_var <= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11234] COND TRUE tmp_var >= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11235] COND TRUE tmp_var == 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11236] CALL error() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11173] reach_error() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 11088]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 2298 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 12.5s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46866 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46759 mSDsluCounter, 213982 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 147428 mSDsCounter, 543 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3553 IncrementalHoareTripleChecker+Invalid, 4096 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 543 mSolverCounterUnsat, 66554 mSDtfsCounter, 3553 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1605 GetRequests, 1460 SyntacticMatches, 4 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6635occurred in iteration=8, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 3064 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 3044 NumberOfCodeBlocks, 3044 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2877 ConstructedInterpolants, 0 QuantifiedInterpolants, 4651 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3878 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 1302/1472 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! [2021-12-22 12:37:08,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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