/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/combinations/Problem05_label43+token_ring.01.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 07:41:31,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 07:41:31,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 07:41:31,462 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 07:41:31,463 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 07:41:31,463 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 07:41:31,464 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 07:41:31,466 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 07:41:31,475 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 07:41:31,480 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 07:41:31,481 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 07:41:31,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 07:41:31,483 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 07:41:31,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 07:41:31,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 07:41:31,487 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 07:41:31,487 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 07:41:31,488 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 07:41:31,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 07:41:31,497 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 07:41:31,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 07:41:31,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 07:41:31,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 07:41:31,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 07:41:31,507 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 07:41:31,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 07:41:31,508 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 07:41:31,508 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 07:41:31,509 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 07:41:31,509 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 07:41:31,509 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 07:41:31,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 07:41:31,510 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 07:41:31,511 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 07:41:31,511 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 07:41:31,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 07:41:31,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 07:41:31,512 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 07:41:31,512 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 07:41:31,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 07:41:31,513 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 07:41:31,515 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 07:41:31,540 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 07:41:31,540 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 07:41:31,540 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 07:41:31,540 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 07:41:31,541 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 07:41:31,541 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 07:41:31,542 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 07:41:31,542 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 07:41:31,542 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 07:41:31,542 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 07:41:31,543 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 07:41:31,543 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 07:41:31,543 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 07:41:31,543 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 07:41:31,543 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 07:41:31,543 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 07:41:31,543 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 07:41:31,544 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 07:41:31,544 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 07:41:31,544 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 07:41:31,544 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 07:41:31,544 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 07:41:31,544 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 07:41:31,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 07:41:31,545 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 07:41:31,545 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 07:41:31,545 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 07:41:31,545 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 07:41:31,545 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 07:41:31,546 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 07:41:31,546 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 07:41:31,546 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 07:41:31,546 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 07:41:31,546 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 07:41:31,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 07:41:31,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 07:41:31,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 07:41:31,770 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 07:41:31,771 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 07:41:31,771 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/Problem05_label43+token_ring.01.cil-2.c [2022-01-10 07:41:31,820 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fbb623ec/9cd463a079bf4ba5947f482161b70d85/FLAGad83ab6f7 [2022-01-10 07:41:32,494 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 07:41:32,494 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label43+token_ring.01.cil-2.c [2022-01-10 07:41:32,531 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fbb623ec/9cd463a079bf4ba5947f482161b70d85/FLAGad83ab6f7 [2022-01-10 07:41:32,612 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fbb623ec/9cd463a079bf4ba5947f482161b70d85 [2022-01-10 07:41:32,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 07:41:32,615 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 07:41:32,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 07:41:32,617 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 07:41:32,620 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 07:41:32,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:41:32" (1/1) ... [2022-01-10 07:41:32,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@640cd40d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:41:32, skipping insertion in model container [2022-01-10 07:41:32,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:41:32" (1/1) ... [2022-01-10 07:41:32,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 07:41:32,747 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 07:41:33,992 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label43+token_ring.01.cil-2.c[381679,381692] [2022-01-10 07:41:34,014 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label43+token_ring.01.cil-2.c[383339,383352] [2022-01-10 07:41:34,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 07:41:34,135 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 07:41:34,748 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label43+token_ring.01.cil-2.c[381679,381692] [2022-01-10 07:41:34,751 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label43+token_ring.01.cil-2.c[383339,383352] [2022-01-10 07:41:34,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 07:41:34,804 INFO L208 MainTranslator]: Completed translation [2022-01-10 07:41:34,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:41:34 WrapperNode [2022-01-10 07:41:34,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 07:41:34,805 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 07:41:34,806 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 07:41:34,806 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 07:41:34,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:41:34" (1/1) ... [2022-01-10 07:41:34,885 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:41:34" (1/1) ... [2022-01-10 07:41:35,073 INFO L137 Inliner]: procedures = 47, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12545 [2022-01-10 07:41:35,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 07:41:35,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 07:41:35,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 07:41:35,074 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 07:41:35,081 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:41:34" (1/1) ... [2022-01-10 07:41:35,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:41:34" (1/1) ... [2022-01-10 07:41:35,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:41:34" (1/1) ... [2022-01-10 07:41:35,204 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:41:34" (1/1) ... [2022-01-10 07:41:35,340 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:41:34" (1/1) ... [2022-01-10 07:41:35,385 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:41:34" (1/1) ... [2022-01-10 07:41:35,408 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:41:34" (1/1) ... [2022-01-10 07:41:35,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 07:41:35,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 07:41:35,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 07:41:35,452 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 07:41:35,454 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:41:34" (1/1) ... [2022-01-10 07:41:35,460 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 07:41:35,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 07:41:35,479 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) [2022-01-10 07:41:35,557 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 [2022-01-10 07:41:35,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 07:41:35,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 07:41:35,597 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-01-10 07:41:35,597 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-01-10 07:41:35,598 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-01-10 07:41:35,598 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-01-10 07:41:35,598 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-01-10 07:41:35,598 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-01-10 07:41:35,598 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-01-10 07:41:35,598 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-01-10 07:41:35,598 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-01-10 07:41:35,598 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-01-10 07:41:35,598 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-01-10 07:41:35,598 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-01-10 07:41:35,598 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-01-10 07:41:35,598 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-01-10 07:41:35,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 07:41:35,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 07:41:35,681 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 07:41:35,682 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 07:41:42,136 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 07:41:42,155 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 07:41:42,156 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-10 07:41:42,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:41:42 BoogieIcfgContainer [2022-01-10 07:41:42,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 07:41:42,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 07:41:42,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 07:41:42,164 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 07:41:42,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 07:41:32" (1/3) ... [2022-01-10 07:41:42,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5990e528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 07:41:42, skipping insertion in model container [2022-01-10 07:41:42,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:41:34" (2/3) ... [2022-01-10 07:41:42,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5990e528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 07:41:42, skipping insertion in model container [2022-01-10 07:41:42,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:41:42" (3/3) ... [2022-01-10 07:41:42,166 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.01.cil-2.c [2022-01-10 07:41:42,169 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 07:41:42,169 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-10 07:41:42,206 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 07:41:42,210 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 [2022-01-10 07:41:42,210 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-10 07:41:42,258 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) [2022-01-10 07:41:42,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-10 07:41:42,264 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:41:42,264 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] [2022-01-10 07:41:42,264 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:41:42,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:41:42,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1417964819, now seen corresponding path program 1 times [2022-01-10 07:41:42,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:41:42,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564942083] [2022-01-10 07:41:42,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:41:42,279 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:41:42,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:41:42,292 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:41:42,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 07:41:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:41:42,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 07:41:42,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:41:42,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 07:41:42,558 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:41:42,558 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:41:42,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564942083] [2022-01-10 07:41:42,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564942083] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:41:42,559 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:41:42,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 07:41:42,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759197995] [2022-01-10 07:41:42,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:41:42,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 07:41:42,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:41:42,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 07:41:42,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 07:41:42,586 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 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 07:41:42,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:41:42,899 INFO L93 Difference]: Finished difference Result 4693 states and 8665 transitions. [2022-01-10 07:41:42,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 07:41:42,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-01-10 07:41:42,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:41:42,922 INFO L225 Difference]: With dead ends: 4693 [2022-01-10 07:41:42,923 INFO L226 Difference]: Without dead ends: 2334 [2022-01-10 07:41:42,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 07:41:42,935 INFO L933 BasicCegarLoop]: 4190 mSDtfsCounter, 4252 mSDsluCounter, 8349 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4261 SdHoareTripleChecker+Valid, 12539 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 07:41:42,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4261 Valid, 12539 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 07:41:42,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2334 states. [2022-01-10 07:41:43,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2334 to 2325. [2022-01-10 07:41:43,033 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, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-01-10 07:41:43,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 2325 states and 4250 transitions. [2022-01-10 07:41:43,043 INFO L78 Accepts]: Start accepts. Automaton has 2325 states and 4250 transitions. Word has length 58 [2022-01-10 07:41:43,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:41:43,043 INFO L470 AbstractCegarLoop]: Abstraction has 2325 states and 4250 transitions. [2022-01-10 07:41:43,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 07:41:43,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2325 states and 4250 transitions. [2022-01-10 07:41:43,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-10 07:41:43,051 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:41:43,051 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] [2022-01-10 07:41:43,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 07:41:43,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:41:43,259 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:41:43,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:41:43,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1082743281, now seen corresponding path program 1 times [2022-01-10 07:41:43,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:41:43,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359847004] [2022-01-10 07:41:43,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:41:43,260 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:41:43,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:41:43,261 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:41:43,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 07:41:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:41:43,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 07:41:43,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:41:43,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 07:41:43,447 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:41:43,447 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:41:43,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359847004] [2022-01-10 07:41:43,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359847004] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:41:43,448 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:41:43,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 07:41:43,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794871486] [2022-01-10 07:41:43,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:41:43,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 07:41:43,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:41:43,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 07:41:43,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 07:41:43,449 INFO L87 Difference]: Start difference. First operand 2325 states and 4250 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 07:41:43,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:41:43,733 INFO L93 Difference]: Finished difference Result 2520 states and 4536 transitions. [2022-01-10 07:41:43,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 07:41:43,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-01-10 07:41:43,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:41:43,743 INFO L225 Difference]: With dead ends: 2520 [2022-01-10 07:41:43,744 INFO L226 Difference]: Without dead ends: 2325 [2022-01-10 07:41:43,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 07:41:43,746 INFO L933 BasicCegarLoop]: 4093 mSDtfsCounter, 4131 mSDsluCounter, 8075 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4140 SdHoareTripleChecker+Valid, 12168 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 07:41:43,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4140 Valid, 12168 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 07:41:43,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2022-01-10 07:41:43,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2325. [2022-01-10 07:41:43,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2325 states, 2283 states have (on average 1.8353044240035041) internal successors, (4190), 2287 states have internal predecessors, (4190), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-01-10 07:41:43,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 2325 states and 4243 transitions. [2022-01-10 07:41:43,805 INFO L78 Accepts]: Start accepts. Automaton has 2325 states and 4243 transitions. Word has length 58 [2022-01-10 07:41:43,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:41:43,805 INFO L470 AbstractCegarLoop]: Abstraction has 2325 states and 4243 transitions. [2022-01-10 07:41:43,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 07:41:43,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2325 states and 4243 transitions. [2022-01-10 07:41:43,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-10 07:41:43,806 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:41:43,806 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] [2022-01-10 07:41:43,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-01-10 07:41:44,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:41:44,013 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:41:44,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:41:44,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1994695277, now seen corresponding path program 1 times [2022-01-10 07:41:44,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:41:44,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121922183] [2022-01-10 07:41:44,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:41:44,015 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:41:44,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:41:44,016 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:41:44,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 07:41:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:41:44,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 07:41:44,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:41:44,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 07:41:44,181 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:41:44,181 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:41:44,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121922183] [2022-01-10 07:41:44,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [121922183] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:41:44,181 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:41:44,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 07:41:44,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330862638] [2022-01-10 07:41:44,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:41:44,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 07:41:44,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:41:44,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 07:41:44,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 07:41:44,183 INFO L87 Difference]: Start difference. First operand 2325 states and 4243 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 07:41:44,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:41:44,415 INFO L93 Difference]: Finished difference Result 2558 states and 4578 transitions. [2022-01-10 07:41:44,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 07:41:44,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-01-10 07:41:44,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:41:44,426 INFO L225 Difference]: With dead ends: 2558 [2022-01-10 07:41:44,427 INFO L226 Difference]: Without dead ends: 2363 [2022-01-10 07:41:44,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 07:41:44,430 INFO L933 BasicCegarLoop]: 4090 mSDtfsCounter, 4141 mSDsluCounter, 8070 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4150 SdHoareTripleChecker+Valid, 12160 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 07:41:44,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4150 Valid, 12160 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 07:41:44,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2022-01-10 07:41:44,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 2363. [2022-01-10 07:41:44,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2363 states, 2315 states have (on average 1.8250539956803455) internal successors, (4225), 2319 states have internal predecessors, (4225), 29 states have call successors, (29), 17 states have call predecessors, (29), 17 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-01-10 07:41:44,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 4282 transitions. [2022-01-10 07:41:44,492 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 4282 transitions. Word has length 58 [2022-01-10 07:41:44,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:41:44,492 INFO L470 AbstractCegarLoop]: Abstraction has 2363 states and 4282 transitions. [2022-01-10 07:41:44,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 07:41:44,493 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 4282 transitions. [2022-01-10 07:41:44,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-10 07:41:44,493 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:41:44,494 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] [2022-01-10 07:41:44,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-01-10 07:41:44,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:41:44,703 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:41:44,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:41:44,704 INFO L85 PathProgramCache]: Analyzing trace with hash 993059566, now seen corresponding path program 1 times [2022-01-10 07:41:44,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:41:44,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750424134] [2022-01-10 07:41:44,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:41:44,704 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:41:44,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:41:44,706 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:41:44,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 07:41:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:41:44,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 07:41:44,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:41:44,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 07:41:44,847 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:41:44,847 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:41:44,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [750424134] [2022-01-10 07:41:44,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [750424134] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:41:44,848 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:41:44,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 07:41:44,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576080169] [2022-01-10 07:41:44,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:41:44,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 07:41:44,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:41:44,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 07:41:44,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 07:41:44,849 INFO L87 Difference]: Start difference. First operand 2363 states and 4282 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 07:41:45,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:41:45,092 INFO L93 Difference]: Finished difference Result 2628 states and 4648 transitions. [2022-01-10 07:41:45,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 07:41:45,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-01-10 07:41:45,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:41:45,104 INFO L225 Difference]: With dead ends: 2628 [2022-01-10 07:41:45,104 INFO L226 Difference]: Without dead ends: 2395 [2022-01-10 07:41:45,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 07:41:45,111 INFO L933 BasicCegarLoop]: 4088 mSDtfsCounter, 4134 mSDsluCounter, 8066 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4143 SdHoareTripleChecker+Valid, 12154 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 07:41:45,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4143 Valid, 12154 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 07:41:45,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2395 states. [2022-01-10 07:41:45,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2395 to 2395. [2022-01-10 07:41:45,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2395 states, 2345 states have (on average 1.8140724946695097) internal successors, (4254), 2349 states have internal predecessors, (4254), 29 states have call successors, (29), 19 states have call predecessors, (29), 19 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-01-10 07:41:45,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 4311 transitions. [2022-01-10 07:41:45,186 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 4311 transitions. Word has length 58 [2022-01-10 07:41:45,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:41:45,187 INFO L470 AbstractCegarLoop]: Abstraction has 2395 states and 4311 transitions. [2022-01-10 07:41:45,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 07:41:45,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 4311 transitions. [2022-01-10 07:41:45,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-10 07:41:45,189 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:41:45,189 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] [2022-01-10 07:41:45,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 07:41:45,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:41:45,396 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:41:45,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:41:45,397 INFO L85 PathProgramCache]: Analyzing trace with hash 518368114, now seen corresponding path program 1 times [2022-01-10 07:41:45,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:41:45,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320583512] [2022-01-10 07:41:45,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:41:45,397 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:41:45,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:41:45,402 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:41:45,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 07:41:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:41:45,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 07:41:45,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:41:45,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 07:41:45,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:41:45,550 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:41:45,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320583512] [2022-01-10 07:41:45,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320583512] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:41:45,550 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:41:45,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 07:41:45,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397787368] [2022-01-10 07:41:45,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:41:45,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 07:41:45,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:41:45,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 07:41:45,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 07:41:45,552 INFO L87 Difference]: Start difference. First operand 2395 states and 4311 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 07:41:45,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:41:45,624 INFO L93 Difference]: Finished difference Result 2701 states and 4713 transitions. [2022-01-10 07:41:45,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 07:41:45,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 2 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 [2022-01-10 07:41:45,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:41:45,632 INFO L225 Difference]: With dead ends: 2701 [2022-01-10 07:41:45,632 INFO L226 Difference]: Without dead ends: 2437 [2022-01-10 07:41:45,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 07:41:45,634 INFO L933 BasicCegarLoop]: 4102 mSDtfsCounter, 49 mSDsluCounter, 12320 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 16422 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 [2022-01-10 07:41:45,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 16422 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 07:41:45,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2022-01-10 07:41:45,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 2401. [2022-01-10 07:41:45,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2401 states, 2351 states have (on average 1.810293492131008) internal successors, (4256), 2355 states have internal predecessors, (4256), 29 states have call successors, (29), 19 states have call predecessors, (29), 19 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-01-10 07:41:45,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 4313 transitions. [2022-01-10 07:41:45,682 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 4313 transitions. Word has length 58 [2022-01-10 07:41:45,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:41:45,682 INFO L470 AbstractCegarLoop]: Abstraction has 2401 states and 4313 transitions. [2022-01-10 07:41:45,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 07:41:45,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 4313 transitions. [2022-01-10 07:41:45,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-10 07:41:45,683 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:41:45,683 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] [2022-01-10 07:41:45,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 07:41:45,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:41:45,890 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:41:45,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:41:45,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1725615184, now seen corresponding path program 1 times [2022-01-10 07:41:45,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:41:45,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196430632] [2022-01-10 07:41:45,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:41:45,891 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:41:45,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:41:45,892 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:41:45,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 07:41:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:41:45,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 07:41:45,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:41:46,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 07:41:46,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:41:46,016 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:41:46,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196430632] [2022-01-10 07:41:46,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [196430632] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:41:46,016 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:41:46,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 07:41:46,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553648512] [2022-01-10 07:41:46,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:41:46,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 07:41:46,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:41:46,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 07:41:46,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 07:41:46,017 INFO L87 Difference]: Start difference. First operand 2401 states and 4313 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 07:41:46,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:41:46,090 INFO L93 Difference]: Finished difference Result 2685 states and 4681 transitions. [2022-01-10 07:41:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 07:41:46,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 2 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 [2022-01-10 07:41:46,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:41:46,098 INFO L225 Difference]: With dead ends: 2685 [2022-01-10 07:41:46,098 INFO L226 Difference]: Without dead ends: 2415 [2022-01-10 07:41:46,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 07:41:46,100 INFO L933 BasicCegarLoop]: 4102 mSDtfsCounter, 10 mSDsluCounter, 12305 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 16407 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 [2022-01-10 07:41:46,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 16407 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 07:41:46,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2022-01-10 07:41:46,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 2407. [2022-01-10 07:41:46,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2407 states, 2357 states have (on average 1.8065337293169283) internal successors, (4258), 2361 states have internal predecessors, (4258), 29 states have call successors, (29), 19 states have call predecessors, (29), 19 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-01-10 07:41:46,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2407 states to 2407 states and 4315 transitions. [2022-01-10 07:41:46,151 INFO L78 Accepts]: Start accepts. Automaton has 2407 states and 4315 transitions. Word has length 58 [2022-01-10 07:41:46,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:41:46,152 INFO L470 AbstractCegarLoop]: Abstraction has 2407 states and 4315 transitions. [2022-01-10 07:41:46,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 07:41:46,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2407 states and 4315 transitions. [2022-01-10 07:41:46,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-10 07:41:46,153 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:41:46,153 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] [2022-01-10 07:41:46,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 07:41:46,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:41:46,360 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:41:46,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:41:46,361 INFO L85 PathProgramCache]: Analyzing trace with hash 2059879022, now seen corresponding path program 1 times [2022-01-10 07:41:46,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:41:46,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2117174563] [2022-01-10 07:41:46,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:41:46,361 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:41:46,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:41:46,362 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:41:46,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 07:41:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:41:46,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 07:41:46,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:41:46,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 07:41:46,504 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:41:46,504 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:41:46,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2117174563] [2022-01-10 07:41:46,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2117174563] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:41:46,504 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:41:46,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 07:41:46,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042598707] [2022-01-10 07:41:46,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:41:46,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 07:41:46,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:41:46,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 07:41:46,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 07:41:46,506 INFO L87 Difference]: Start difference. First operand 2407 states and 4315 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-10 07:41:46,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:41:46,562 INFO L93 Difference]: Finished difference Result 2926 states and 4960 transitions. [2022-01-10 07:41:46,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 07:41:46,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 58 [2022-01-10 07:41:46,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:41:46,571 INFO L225 Difference]: With dead ends: 2926 [2022-01-10 07:41:46,572 INFO L226 Difference]: Without dead ends: 2650 [2022-01-10 07:41:46,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 07:41:46,574 INFO L933 BasicCegarLoop]: 4141 mSDtfsCounter, 4028 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4028 SdHoareTripleChecker+Valid, 4264 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 [2022-01-10 07:41:46,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4028 Valid, 4264 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 07:41:46,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2022-01-10 07:41:46,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2648. [2022-01-10 07:41:46,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2648 states, 2556 states have (on average 1.757433489827856) internal successors, (4492), 2563 states have internal predecessors, (4492), 52 states have call successors, (52), 37 states have call predecessors, (52), 38 states have return successors, (52), 48 states have call predecessors, (52), 50 states have call successors, (52) [2022-01-10 07:41:46,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2648 states to 2648 states and 4596 transitions. [2022-01-10 07:41:46,636 INFO L78 Accepts]: Start accepts. Automaton has 2648 states and 4596 transitions. Word has length 58 [2022-01-10 07:41:46,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:41:46,636 INFO L470 AbstractCegarLoop]: Abstraction has 2648 states and 4596 transitions. [2022-01-10 07:41:46,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-10 07:41:46,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2648 states and 4596 transitions. [2022-01-10 07:41:46,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-01-10 07:41:46,637 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:41:46,637 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] [2022-01-10 07:41:46,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 07:41:46,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:41:46,847 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:41:46,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:41:46,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1460919208, now seen corresponding path program 1 times [2022-01-10 07:41:46,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:41:46,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006862776] [2022-01-10 07:41:46,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:41:46,848 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:41:46,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:41:46,849 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:41:46,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 07:41:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:41:46,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 07:41:46,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:41:47,041 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-10 07:41:47,041 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:41:47,042 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:41:47,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1006862776] [2022-01-10 07:41:47,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1006862776] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:41:47,042 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:41:47,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 07:41:47,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129792918] [2022-01-10 07:41:47,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:41:47,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 07:41:47,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:41:47,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 07:41:47,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 07:41:47,054 INFO L87 Difference]: Start difference. First operand 2648 states and 4596 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 07:41:47,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:41:47,218 INFO L93 Difference]: Finished difference Result 3584 states and 5747 transitions. [2022-01-10 07:41:47,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 07:41:47,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 93 [2022-01-10 07:41:47,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:41:47,229 INFO L225 Difference]: With dead ends: 3584 [2022-01-10 07:41:47,229 INFO L226 Difference]: Without dead ends: 3068 [2022-01-10 07:41:47,231 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 07:41:47,231 INFO L933 BasicCegarLoop]: 4150 mSDtfsCounter, 4094 mSDsluCounter, 4154 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4100 SdHoareTripleChecker+Valid, 8304 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 07:41:47,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4100 Valid, 8304 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 07:41:47,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2022-01-10 07:41:47,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 3064. [2022-01-10 07:41:47,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3064 states, 2893 states have (on average 1.6920152091254752) internal successors, (4895), 2909 states have internal predecessors, (4895), 93 states have call successors, (93), 65 states have call predecessors, (93), 76 states have return successors, (115), 91 states have call predecessors, (115), 91 states have call successors, (115) [2022-01-10 07:41:47,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3064 states to 3064 states and 5103 transitions. [2022-01-10 07:41:47,299 INFO L78 Accepts]: Start accepts. Automaton has 3064 states and 5103 transitions. Word has length 93 [2022-01-10 07:41:47,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:41:47,300 INFO L470 AbstractCegarLoop]: Abstraction has 3064 states and 5103 transitions. [2022-01-10 07:41:47,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 07:41:47,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3064 states and 5103 transitions. [2022-01-10 07:41:47,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-01-10 07:41:47,301 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:41:47,301 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] [2022-01-10 07:41:47,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-01-10 07:41:47,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:41:47,507 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:41:47,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:41:47,508 INFO L85 PathProgramCache]: Analyzing trace with hash -418211738, now seen corresponding path program 1 times [2022-01-10 07:41:47,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:41:47,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967526832] [2022-01-10 07:41:47,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:41:47,508 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:41:47,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:41:47,509 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:41:47,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 07:41:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:41:47,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 07:41:47,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:41:47,649 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-10 07:41:47,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:41:47,649 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:41:47,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967526832] [2022-01-10 07:41:47,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967526832] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:41:47,649 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:41:47,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 07:41:47,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138599087] [2022-01-10 07:41:47,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:41:47,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 07:41:47,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:41:47,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 07:41:47,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 07:41:47,650 INFO L87 Difference]: Start difference. First operand 3064 states and 5103 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 07:41:47,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:41:47,769 INFO L93 Difference]: Finished difference Result 3992 states and 6224 transitions. [2022-01-10 07:41:47,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 07:41:47,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 93 [2022-01-10 07:41:47,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:41:47,791 INFO L225 Difference]: With dead ends: 3992 [2022-01-10 07:41:47,791 INFO L226 Difference]: Without dead ends: 3060 [2022-01-10 07:41:47,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 07:41:47,796 INFO L933 BasicCegarLoop]: 4103 mSDtfsCounter, 138 mSDsluCounter, 3958 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 8061 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 07:41:47,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 8061 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 07:41:47,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3060 states. [2022-01-10 07:41:47,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3060 to 3060. [2022-01-10 07:41:47,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3060 states, 2892 states have (on average 1.691908713692946) internal successors, (4893), 2907 states have internal predecessors, (4893), 90 states have call successors, (90), 65 states have call predecessors, (90), 76 states have return successors, (112), 88 states have call predecessors, (112), 88 states have call successors, (112) [2022-01-10 07:41:47,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 3060 states and 5095 transitions. [2022-01-10 07:41:47,861 INFO L78 Accepts]: Start accepts. Automaton has 3060 states and 5095 transitions. Word has length 93 [2022-01-10 07:41:47,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:41:47,861 INFO L470 AbstractCegarLoop]: Abstraction has 3060 states and 5095 transitions. [2022-01-10 07:41:47,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 07:41:47,861 INFO L276 IsEmpty]: Start isEmpty. Operand 3060 states and 5095 transitions. [2022-01-10 07:41:47,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-01-10 07:41:47,862 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:41:47,863 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, 1] [2022-01-10 07:41:47,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-01-10 07:41:48,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:41:48,069 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:41:48,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:41:48,070 INFO L85 PathProgramCache]: Analyzing trace with hash -677410577, now seen corresponding path program 1 times [2022-01-10 07:41:48,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:41:48,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821408738] [2022-01-10 07:41:48,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:41:48,072 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:41:48,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:41:48,072 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:41:48,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 07:41:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:41:48,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 07:41:48,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:41:48,247 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-10 07:41:48,247 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:41:48,247 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:41:48,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821408738] [2022-01-10 07:41:48,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1821408738] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:41:48,248 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:41:48,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 07:41:48,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852139894] [2022-01-10 07:41:48,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:41:48,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 07:41:48,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:41:48,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 07:41:48,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 07:41:48,249 INFO L87 Difference]: Start difference. First operand 3060 states and 5095 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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) [2022-01-10 07:41:48,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:41:48,311 INFO L93 Difference]: Finished difference Result 4653 states and 7038 transitions. [2022-01-10 07:41:48,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 07:41:48,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 94 [2022-01-10 07:41:48,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:41:48,319 INFO L225 Difference]: With dead ends: 4653 [2022-01-10 07:41:48,319 INFO L226 Difference]: Without dead ends: 3396 [2022-01-10 07:41:48,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 07:41:48,322 INFO L933 BasicCegarLoop]: 4203 mSDtfsCounter, 96 mSDsluCounter, 4095 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 8298 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 [2022-01-10 07:41:48,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 8298 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 07:41:48,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3396 states. [2022-01-10 07:41:48,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3396 to 3396. [2022-01-10 07:41:48,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3396 states, 3168 states have (on average 1.64520202020202) internal successors, (5212), 3185 states have internal predecessors, (5212), 124 states have call successors, (124), 89 states have call predecessors, (124), 102 states have return successors, (158), 122 states have call predecessors, (158), 122 states have call successors, (158) [2022-01-10 07:41:48,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 5494 transitions. [2022-01-10 07:41:48,393 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 5494 transitions. Word has length 94 [2022-01-10 07:41:48,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:41:48,393 INFO L470 AbstractCegarLoop]: Abstraction has 3396 states and 5494 transitions. [2022-01-10 07:41:48,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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) [2022-01-10 07:41:48,393 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 5494 transitions. [2022-01-10 07:41:48,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-01-10 07:41:48,395 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:41:48,395 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 07:41:48,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-01-10 07:41:48,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:41:48,601 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:41:48,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:41:48,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1678524408, now seen corresponding path program 1 times [2022-01-10 07:41:48,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:41:48,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345948748] [2022-01-10 07:41:48,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:41:48,602 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:41:48,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:41:48,603 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:41:48,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-01-10 07:41:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:41:48,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 07:41:48,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:41:48,831 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-10 07:41:48,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:41:48,831 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:41:48,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345948748] [2022-01-10 07:41:48,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345948748] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:41:48,832 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:41:48,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 07:41:48,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509340798] [2022-01-10 07:41:48,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:41:48,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 07:41:48,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:41:48,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 07:41:48,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 07:41:48,833 INFO L87 Difference]: Start difference. First operand 3396 states and 5494 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) [2022-01-10 07:41:48,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:41:48,892 INFO L93 Difference]: Finished difference Result 4997 states and 7414 transitions. [2022-01-10 07:41:48,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 07:41:48,893 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 [2022-01-10 07:41:48,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:41:48,899 INFO L225 Difference]: With dead ends: 4997 [2022-01-10 07:41:48,899 INFO L226 Difference]: Without dead ends: 3732 [2022-01-10 07:41:48,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 07:41:48,903 INFO L933 BasicCegarLoop]: 4140 mSDtfsCounter, 4003 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4003 SdHoareTripleChecker+Valid, 4263 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 [2022-01-10 07:41:48,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4003 Valid, 4263 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 07:41:48,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3732 states. [2022-01-10 07:41:48,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3732 to 3720. [2022-01-10 07:41:48,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3720 states, 3432 states have (on average 1.6043123543123543) internal successors, (5506), 3451 states have internal predecessors, (5506), 158 states have call successors, (158), 113 states have call predecessors, (158), 128 states have return successors, (194), 156 states have call predecessors, (194), 156 states have call successors, (194) [2022-01-10 07:41:48,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 5858 transitions. [2022-01-10 07:41:48,976 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 5858 transitions. Word has length 119 [2022-01-10 07:41:48,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:41:48,977 INFO L470 AbstractCegarLoop]: Abstraction has 3720 states and 5858 transitions. [2022-01-10 07:41:48,977 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) [2022-01-10 07:41:48,977 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 5858 transitions. [2022-01-10 07:41:48,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-01-10 07:41:48,979 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:41:48,979 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] [2022-01-10 07:41:49,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-01-10 07:41:49,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:41:49,186 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:41:49,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:41:49,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1522936230, now seen corresponding path program 1 times [2022-01-10 07:41:49,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:41:49,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120640204] [2022-01-10 07:41:49,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:41:49,187 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:41:49,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:41:49,188 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:41:49,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-01-10 07:41:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:41:49,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 07:41:49,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:41:49,393 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-01-10 07:41:49,393 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:41:49,393 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:41:49,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120640204] [2022-01-10 07:41:49,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1120640204] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:41:49,394 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:41:49,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 07:41:49,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005911324] [2022-01-10 07:41:49,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:41:49,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 07:41:49,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:41:49,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 07:41:49,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 07:41:49,395 INFO L87 Difference]: Start difference. First operand 3720 states and 5858 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-10 07:41:49,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:41:49,554 INFO L93 Difference]: Finished difference Result 5320 states and 7779 transitions. [2022-01-10 07:41:49,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 07:41:49,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 135 [2022-01-10 07:41:49,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:41:49,562 INFO L225 Difference]: With dead ends: 5320 [2022-01-10 07:41:49,563 INFO L226 Difference]: Without dead ends: 3732 [2022-01-10 07:41:49,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 07:41:49,566 INFO L933 BasicCegarLoop]: 4105 mSDtfsCounter, 4086 mSDsluCounter, 4123 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4092 SdHoareTripleChecker+Valid, 8228 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 07:41:49,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4092 Valid, 8228 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 07:41:49,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3732 states. [2022-01-10 07:41:49,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3732 to 3732. [2022-01-10 07:41:49,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3732 states, 3440 states have (on average 1.5965116279069766) internal successors, (5492), 3461 states have internal predecessors, (5492), 158 states have call successors, (158), 113 states have call predecessors, (158), 132 states have return successors, (182), 158 states have call predecessors, (182), 156 states have call successors, (182) [2022-01-10 07:41:49,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3732 states to 3732 states and 5832 transitions. [2022-01-10 07:41:49,640 INFO L78 Accepts]: Start accepts. Automaton has 3732 states and 5832 transitions. Word has length 135 [2022-01-10 07:41:49,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:41:49,640 INFO L470 AbstractCegarLoop]: Abstraction has 3732 states and 5832 transitions. [2022-01-10 07:41:49,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-10 07:41:49,641 INFO L276 IsEmpty]: Start isEmpty. Operand 3732 states and 5832 transitions. [2022-01-10 07:41:49,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-01-10 07:41:49,643 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:41:49,643 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, 1] [2022-01-10 07:41:49,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-01-10 07:41:49,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:41:49,850 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:41:49,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:41:49,851 INFO L85 PathProgramCache]: Analyzing trace with hash 2116042813, now seen corresponding path program 1 times [2022-01-10 07:41:49,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:41:49,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610952328] [2022-01-10 07:41:49,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:41:49,851 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:41:49,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:41:49,852 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:41:49,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-01-10 07:41:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:41:49,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 07:41:49,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:41:50,091 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 07:41:50,091 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:41:50,091 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:41:50,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610952328] [2022-01-10 07:41:50,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610952328] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:41:50,092 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:41:50,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 07:41:50,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333923939] [2022-01-10 07:41:50,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:41:50,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 07:41:50,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:41:50,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 07:41:50,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 07:41:50,093 INFO L87 Difference]: Start difference. First operand 3732 states and 5832 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) [2022-01-10 07:41:50,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:41:50,154 INFO L93 Difference]: Finished difference Result 5018 states and 7391 transitions. [2022-01-10 07:41:50,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 07:41:50,154 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 [2022-01-10 07:41:50,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:41:50,161 INFO L225 Difference]: With dead ends: 5018 [2022-01-10 07:41:50,161 INFO L226 Difference]: Without dead ends: 3740 [2022-01-10 07:41:50,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 07:41:50,164 INFO L933 BasicCegarLoop]: 4164 mSDtfsCounter, 102 mSDsluCounter, 4065 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 8229 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 07:41:50,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 8229 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 07:41:50,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2022-01-10 07:41:50,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 3732. [2022-01-10 07:41:50,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3732 states, 3440 states have (on average 1.5848837209302327) internal successors, (5452), 3461 states have internal predecessors, (5452), 158 states have call successors, (158), 113 states have call predecessors, (158), 132 states have return successors, (182), 158 states have call predecessors, (182), 156 states have call successors, (182) [2022-01-10 07:41:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3732 states to 3732 states and 5792 transitions. [2022-01-10 07:41:50,318 INFO L78 Accepts]: Start accepts. Automaton has 3732 states and 5792 transitions. Word has length 136 [2022-01-10 07:41:50,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:41:50,318 INFO L470 AbstractCegarLoop]: Abstraction has 3732 states and 5792 transitions. [2022-01-10 07:41:50,318 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) [2022-01-10 07:41:50,318 INFO L276 IsEmpty]: Start isEmpty. Operand 3732 states and 5792 transitions. [2022-01-10 07:41:50,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-01-10 07:41:50,320 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:41:50,320 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] [2022-01-10 07:41:50,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-01-10 07:41:50,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:41:50,528 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:41:50,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:41:50,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1312364636, now seen corresponding path program 1 times [2022-01-10 07:41:50,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:41:50,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440669914] [2022-01-10 07:41:50,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:41:50,528 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:41:50,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:41:50,529 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:41:50,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-01-10 07:41:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:41:50,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 07:41:50,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:41:50,818 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 55 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 07:41:50,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 07:41:51,016 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-01-10 07:41:51,017 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:41:51,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440669914] [2022-01-10 07:41:51,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440669914] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 07:41:51,017 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 07:41:51,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-01-10 07:41:51,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714577717] [2022-01-10 07:41:51,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:41:51,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 07:41:51,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:41:51,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 07:41:51,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 07:41:51,018 INFO L87 Difference]: Start difference. First operand 3732 states and 5792 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-10 07:41:51,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:41:51,204 INFO L93 Difference]: Finished difference Result 5325 states and 7601 transitions. [2022-01-10 07:41:51,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 07:41:51,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 137 [2022-01-10 07:41:51,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:41:51,215 INFO L225 Difference]: With dead ends: 5325 [2022-01-10 07:41:51,216 INFO L226 Difference]: Without dead ends: 5322 [2022-01-10 07:41:51,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 269 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 07:41:51,219 INFO L933 BasicCegarLoop]: 4207 mSDtfsCounter, 4173 mSDsluCounter, 4173 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4173 SdHoareTripleChecker+Valid, 8380 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 07:41:51,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4173 Valid, 8380 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 07:41:51,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2022-01-10 07:41:51,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 4384. [2022-01-10 07:41:51,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4384 states, 3976 states have (on average 1.5241448692152917) internal successors, (6060), 4003 states have internal predecessors, (6060), 222 states have call successors, (222), 157 states have call predecessors, (222), 184 states have return successors, (260), 224 states have call predecessors, (260), 220 states have call successors, (260) [2022-01-10 07:41:51,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4384 states to 4384 states and 6542 transitions. [2022-01-10 07:41:51,336 INFO L78 Accepts]: Start accepts. Automaton has 4384 states and 6542 transitions. Word has length 137 [2022-01-10 07:41:51,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:41:51,336 INFO L470 AbstractCegarLoop]: Abstraction has 4384 states and 6542 transitions. [2022-01-10 07:41:51,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-10 07:41:51,337 INFO L276 IsEmpty]: Start isEmpty. Operand 4384 states and 6542 transitions. [2022-01-10 07:41:51,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-01-10 07:41:51,339 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:41:51,340 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] [2022-01-10 07:41:51,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-01-10 07:41:51,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:41:51,568 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:41:51,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:41:51,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1384992052, now seen corresponding path program 1 times [2022-01-10 07:41:51,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:41:51,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300178026] [2022-01-10 07:41:51,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:41:51,569 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:41:51,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:41:51,570 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:41:51,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-01-10 07:41:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:41:51,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 07:41:51,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:41:51,791 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-01-10 07:41:51,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:41:51,791 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:41:51,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300178026] [2022-01-10 07:41:51,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1300178026] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:41:51,791 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:41:51,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 07:41:51,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977992594] [2022-01-10 07:41:51,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:41:51,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 07:41:51,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:41:51,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 07:41:51,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 07:41:51,793 INFO L87 Difference]: Start difference. First operand 4384 states and 6542 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-01-10 07:41:51,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:41:51,906 INFO L93 Difference]: Finished difference Result 6548 states and 9191 transitions. [2022-01-10 07:41:51,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 07:41:51,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 141 [2022-01-10 07:41:51,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:41:51,917 INFO L225 Difference]: With dead ends: 6548 [2022-01-10 07:41:51,917 INFO L226 Difference]: Without dead ends: 4952 [2022-01-10 07:41:51,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 07:41:51,923 INFO L933 BasicCegarLoop]: 4166 mSDtfsCounter, 45 mSDsluCounter, 4101 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 8267 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 07:41:51,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 8267 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 07:41:51,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4952 states. [2022-01-10 07:41:52,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4952 to 4388. [2022-01-10 07:41:52,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4388 states, 3980 states have (on average 1.5236180904522614) internal successors, (6064), 4007 states have internal predecessors, (6064), 222 states have call successors, (222), 157 states have call predecessors, (222), 184 states have return successors, (260), 224 states have call predecessors, (260), 220 states have call successors, (260) [2022-01-10 07:41:52,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4388 states to 4388 states and 6546 transitions. [2022-01-10 07:41:52,044 INFO L78 Accepts]: Start accepts. Automaton has 4388 states and 6546 transitions. Word has length 141 [2022-01-10 07:41:52,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:41:52,045 INFO L470 AbstractCegarLoop]: Abstraction has 4388 states and 6546 transitions. [2022-01-10 07:41:52,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-01-10 07:41:52,045 INFO L276 IsEmpty]: Start isEmpty. Operand 4388 states and 6546 transitions. [2022-01-10 07:41:52,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-01-10 07:41:52,048 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:41:52,048 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] [2022-01-10 07:41:52,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-01-10 07:41:52,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:41:52,257 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:41:52,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:41:52,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1244161439, now seen corresponding path program 1 times [2022-01-10 07:41:52,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:41:52,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [881545579] [2022-01-10 07:41:52,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:41:52,257 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:41:52,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:41:52,258 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:41:52,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-01-10 07:41:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 07:41:52,320 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 07:41:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 07:41:52,495 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-01-10 07:41:52,495 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 07:41:52,495 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-01-10 07:41:52,496 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-01-10 07:41:52,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-01-10 07:41:52,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:41:52,709 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 07:41:52,711 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 07:41:52,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 07:41:52 BoogieIcfgContainer [2022-01-10 07:41:52,808 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 07:41:52,809 INFO L158 Benchmark]: Toolchain (without parser) took 20193.41ms. Allocated memory was 204.5MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 158.1MB in the beginning and 608.3MB in the end (delta: -450.2MB). Peak memory consumption was 679.1MB. Max. memory is 8.0GB. [2022-01-10 07:41:52,809 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 204.5MB. Free memory is still 170.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 07:41:52,809 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2187.54ms. Allocated memory was 204.5MB in the beginning and 263.2MB in the end (delta: 58.7MB). Free memory was 157.6MB in the beginning and 164.4MB in the end (delta: -6.8MB). Peak memory consumption was 180.4MB. Max. memory is 8.0GB. [2022-01-10 07:41:52,809 INFO L158 Benchmark]: Boogie Procedure Inliner took 268.19ms. Allocated memory is still 263.2MB. Free memory was 164.4MB in the beginning and 86.8MB in the end (delta: 77.6MB). Peak memory consumption was 76.5MB. Max. memory is 8.0GB. [2022-01-10 07:41:52,809 INFO L158 Benchmark]: Boogie Preprocessor took 377.07ms. Allocated memory was 263.2MB in the beginning and 436.2MB in the end (delta: 173.0MB). Free memory was 86.8MB in the beginning and 254.1MB in the end (delta: -167.2MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. [2022-01-10 07:41:52,810 INFO L158 Benchmark]: RCFGBuilder took 6707.49ms. Allocated memory was 436.2MB in the beginning and 852.5MB in the end (delta: 416.3MB). Free memory was 254.1MB in the beginning and 327.1MB in the end (delta: -73.0MB). Peak memory consumption was 344.3MB. Max. memory is 8.0GB. [2022-01-10 07:41:52,810 INFO L158 Benchmark]: TraceAbstraction took 10647.49ms. Allocated memory was 852.5MB in the beginning and 1.3GB in the end (delta: 481.3MB). Free memory was 326.5MB in the beginning and 608.3MB in the end (delta: -281.8MB). Peak memory consumption was 199.5MB. Max. memory is 8.0GB. [2022-01-10 07:41:52,811 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.31ms. Allocated memory is still 204.5MB. Free memory is still 170.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 2187.54ms. Allocated memory was 204.5MB in the beginning and 263.2MB in the end (delta: 58.7MB). Free memory was 157.6MB in the beginning and 164.4MB in the end (delta: -6.8MB). Peak memory consumption was 180.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 268.19ms. Allocated memory is still 263.2MB. Free memory was 164.4MB in the beginning and 86.8MB in the end (delta: 77.6MB). Peak memory consumption was 76.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 377.07ms. Allocated memory was 263.2MB in the beginning and 436.2MB in the end (delta: 173.0MB). Free memory was 86.8MB in the beginning and 254.1MB in the end (delta: -167.2MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. * RCFGBuilder took 6707.49ms. Allocated memory was 436.2MB in the beginning and 852.5MB in the end (delta: 416.3MB). Free memory was 254.1MB in the beginning and 327.1MB in the end (delta: -73.0MB). Peak memory consumption was 344.3MB. Max. memory is 8.0GB. * TraceAbstraction took 10647.49ms. Allocated memory was 852.5MB in the beginning and 1.3GB in the end (delta: 481.3MB). Free memory was 326.5MB in the beginning and 608.3MB in the end (delta: -281.8MB). Peak memory consumption was 199.5MB. Max. memory is 8.0GB. * 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=2147483648, 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=2147483648, 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=2147483648, 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, 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, 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, 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, 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, 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=2147483648, tmp_ndt_2=2147483648, 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=2147483648, tmp_ndt_2=2147483648, 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=2147483648, tmp_ndt_2=2147483648, 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, 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, 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, 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: 11118]: 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: 10.5s, OverallIterations: 16, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37540 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37482 mSDsluCounter, 148144 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 86100 mSDsCounter, 205 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 848 IncrementalHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 205 mSolverCounterUnsat, 62044 mSDtfsCounter, 848 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1487 GetRequests, 1446 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4388occurred in iteration=15, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 1581 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1496 NumberOfCodeBlocks, 1496 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1475 ConstructedInterpolants, 0 QuantifiedInterpolants, 2468 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2721 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 16 InterpolantComputations, 15 PerfectInterpolantSequences, 527/543 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! [2022-01-10 07:41:52,839 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...