/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/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 06:45:26,969 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 06:45:26,970 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 06:45:27,002 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 06:45:27,003 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 06:45:27,003 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 06:45:27,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 06:45:27,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 06:45:27,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 06:45:27,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 06:45:27,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 06:45:27,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 06:45:27,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 06:45:27,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 06:45:27,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 06:45:27,023 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 06:45:27,023 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 06:45:27,025 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 06:45:27,028 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 06:45:27,029 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 06:45:27,030 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 06:45:27,034 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 06:45:27,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 06:45:27,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 06:45:27,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 06:45:27,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 06:45:27,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 06:45:27,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 06:45:27,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 06:45:27,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 06:45:27,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 06:45:27,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 06:45:27,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 06:45:27,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 06:45:27,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 06:45:27,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 06:45:27,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 06:45:27,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 06:45:27,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 06:45:27,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 06:45:27,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 06:45:27,047 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 06:45:27,108 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 06:45:27,108 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 06:45:27,109 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 06:45:27,109 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 06:45:27,109 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 06:45:27,109 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 06:45:27,110 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 06:45:27,110 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 06:45:27,110 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 06:45:27,110 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 06:45:27,110 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 06:45:27,110 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 06:45:27,110 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 06:45:27,110 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 06:45:27,110 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 06:45:27,110 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 06:45:27,111 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 06:45:27,111 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 06:45:27,111 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 06:45:27,111 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 06:45:27,111 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 06:45:27,111 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 06:45:27,111 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 06:45:27,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:45:27,111 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 06:45:27,111 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 06:45:27,111 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 06:45:27,111 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 06:45:27,112 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 06:45:27,112 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 06:45:27,112 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 06:45:27,112 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 06:45:27,112 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 06:45:27,112 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 06:45:27,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 06:45:27,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 06:45:27,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 06:45:27,295 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 06:45:27,302 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 06:45:27,304 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2022-01-10 06:45:27,369 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00835c0e4/76d6744f6f934031add36ea67c54c773/FLAGcb1e9bb11 [2022-01-10 06:45:27,728 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 06:45:27,729 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2022-01-10 06:45:27,735 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00835c0e4/76d6744f6f934031add36ea67c54c773/FLAGcb1e9bb11 [2022-01-10 06:45:28,145 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00835c0e4/76d6744f6f934031add36ea67c54c773 [2022-01-10 06:45:28,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 06:45:28,148 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 06:45:28,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 06:45:28,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 06:45:28,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 06:45:28,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:45:28" (1/1) ... [2022-01-10 06:45:28,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@caddbca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:28, skipping insertion in model container [2022-01-10 06:45:28,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:45:28" (1/1) ... [2022-01-10 06:45:28,156 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 06:45:28,189 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 06:45:28,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c[14540,14553] [2022-01-10 06:45:28,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:45:28,388 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 06:45:28,451 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c[14540,14553] [2022-01-10 06:45:28,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:45:28,462 INFO L208 MainTranslator]: Completed translation [2022-01-10 06:45:28,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:28 WrapperNode [2022-01-10 06:45:28,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 06:45:28,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 06:45:28,464 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 06:45:28,464 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 06:45:28,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:28" (1/1) ... [2022-01-10 06:45:28,483 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:28" (1/1) ... [2022-01-10 06:45:28,503 INFO L137 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 512 [2022-01-10 06:45:28,503 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 06:45:28,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 06:45:28,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 06:45:28,504 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 06:45:28,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:28" (1/1) ... [2022-01-10 06:45:28,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:28" (1/1) ... [2022-01-10 06:45:28,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:28" (1/1) ... [2022-01-10 06:45:28,521 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:28" (1/1) ... [2022-01-10 06:45:28,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:28" (1/1) ... [2022-01-10 06:45:28,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:28" (1/1) ... [2022-01-10 06:45:28,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:28" (1/1) ... [2022-01-10 06:45:28,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 06:45:28,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 06:45:28,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 06:45:28,536 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 06:45:28,536 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:28" (1/1) ... [2022-01-10 06:45:28,546 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:45:28,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 06:45:28,581 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 06:45:28,599 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 06:45:28,620 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2022-01-10 06:45:28,620 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2022-01-10 06:45:28,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 06:45:28,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 06:45:28,620 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2022-01-10 06:45:28,620 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2022-01-10 06:45:28,620 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-01-10 06:45:28,621 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-01-10 06:45:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2022-01-10 06:45:28,622 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2022-01-10 06:45:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-10 06:45:28,622 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-10 06:45:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2022-01-10 06:45:28,622 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2022-01-10 06:45:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 06:45:28,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 06:45:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2022-01-10 06:45:28,622 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2022-01-10 06:45:28,695 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 06:45:28,696 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 06:45:29,041 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 06:45:29,048 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 06:45:29,048 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 06:45:29,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:45:29 BoogieIcfgContainer [2022-01-10 06:45:29,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 06:45:29,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 06:45:29,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 06:45:29,059 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 06:45:29,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:45:28" (1/3) ... [2022-01-10 06:45:29,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da2e8d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:45:29, skipping insertion in model container [2022-01-10 06:45:29,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:28" (2/3) ... [2022-01-10 06:45:29,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da2e8d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:45:29, skipping insertion in model container [2022-01-10 06:45:29,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:45:29" (3/3) ... [2022-01-10 06:45:29,067 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2022-01-10 06:45:29,071 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 06:45:29,071 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 06:45:29,121 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 06:45:29,130 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 06:45:29,131 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 06:45:29,165 INFO L276 IsEmpty]: Start isEmpty. Operand has 205 states, 165 states have (on average 1.5454545454545454) internal successors, (255), 166 states have internal predecessors, (255), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-01-10 06:45:29,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 06:45:29,170 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:29,171 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] [2022-01-10 06:45:29,171 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:29,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:29,175 INFO L85 PathProgramCache]: Analyzing trace with hash 255328600, now seen corresponding path program 1 times [2022-01-10 06:45:29,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:29,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928194698] [2022-01-10 06:45:29,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:29,190 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:29,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:29,218 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 06:45:29,265 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 06:45:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:29,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 06:45:29,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:29,462 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 06:45:29,462 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:29,463 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:29,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1928194698] [2022-01-10 06:45:29,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1928194698] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:29,464 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:29,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 06:45:29,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793227200] [2022-01-10 06:45:29,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:29,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 06:45:29,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:29,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 06:45:29,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 06:45:29,497 INFO L87 Difference]: Start difference. First operand has 205 states, 165 states have (on average 1.5454545454545454) internal successors, (255), 166 states have internal predecessors, (255), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 06:45:29,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:29,542 INFO L93 Difference]: Finished difference Result 394 states and 634 transitions. [2022-01-10 06:45:29,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 06:45:29,543 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-01-10 06:45:29,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:29,549 INFO L225 Difference]: With dead ends: 394 [2022-01-10 06:45:29,549 INFO L226 Difference]: Without dead ends: 201 [2022-01-10 06:45:29,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 06:45:29,555 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:29,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:45:29,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-01-10 06:45:29,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-01-10 06:45:29,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 162 states have (on average 1.4938271604938271) internal successors, (242), 162 states have internal predecessors, (242), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-01-10 06:45:29,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 304 transitions. [2022-01-10 06:45:29,592 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 304 transitions. Word has length 44 [2022-01-10 06:45:29,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:29,593 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 304 transitions. [2022-01-10 06:45:29,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 06:45:29,593 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 304 transitions. [2022-01-10 06:45:29,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 06:45:29,595 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:29,595 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] [2022-01-10 06:45:29,604 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 06:45:29,800 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 06:45:29,800 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:29,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:29,801 INFO L85 PathProgramCache]: Analyzing trace with hash 246563096, now seen corresponding path program 1 times [2022-01-10 06:45:29,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:29,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525031761] [2022-01-10 06:45:29,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:29,802 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:29,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:29,804 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 06:45:29,805 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 06:45:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:29,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 06:45:29,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:29,994 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 06:45:29,995 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:29,995 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:29,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525031761] [2022-01-10 06:45:29,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525031761] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:29,995 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:29,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 06:45:29,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905078487] [2022-01-10 06:45:29,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:29,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 06:45:29,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:29,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 06:45:30,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:45:30,000 INFO L87 Difference]: Start difference. First operand 201 states and 304 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 06:45:30,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:30,112 INFO L93 Difference]: Finished difference Result 525 states and 799 transitions. [2022-01-10 06:45:30,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 06:45:30,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-01-10 06:45:30,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:30,123 INFO L225 Difference]: With dead ends: 525 [2022-01-10 06:45:30,123 INFO L226 Difference]: Without dead ends: 338 [2022-01-10 06:45:30,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 06:45:30,125 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 167 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:30,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 1566 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:45:30,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-01-10 06:45:30,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 201. [2022-01-10 06:45:30,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 162 states have (on average 1.4197530864197532) internal successors, (230), 162 states have internal predecessors, (230), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-01-10 06:45:30,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 292 transitions. [2022-01-10 06:45:30,158 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 292 transitions. Word has length 44 [2022-01-10 06:45:30,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:30,158 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 292 transitions. [2022-01-10 06:45:30,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 06:45:30,158 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 292 transitions. [2022-01-10 06:45:30,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 06:45:30,159 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:30,159 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] [2022-01-10 06:45:30,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 06:45:30,366 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 06:45:30,366 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:30,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:30,367 INFO L85 PathProgramCache]: Analyzing trace with hash -428937283, now seen corresponding path program 1 times [2022-01-10 06:45:30,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:30,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374167049] [2022-01-10 06:45:30,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:30,367 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:30,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:30,369 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 06:45:30,372 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 06:45:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:30,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 06:45:30,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:30,558 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 06:45:30,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:30,559 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:30,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374167049] [2022-01-10 06:45:30,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374167049] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:30,559 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:30,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:45:30,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747386903] [2022-01-10 06:45:30,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:30,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:45:30,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:30,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:45:30,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:45:30,560 INFO L87 Difference]: Start difference. First operand 201 states and 292 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 06:45:30,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:30,614 INFO L93 Difference]: Finished difference Result 391 states and 577 transitions. [2022-01-10 06:45:30,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:45:30,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-01-10 06:45:30,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:30,616 INFO L225 Difference]: With dead ends: 391 [2022-01-10 06:45:30,617 INFO L226 Difference]: Without dead ends: 207 [2022-01-10 06:45:30,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 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 06:45:30,618 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 6 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:30,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 848 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:45:30,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-01-10 06:45:30,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2022-01-10 06:45:30,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 165 states have (on average 1.412121212121212) internal successors, (233), 165 states have internal predecessors, (233), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-01-10 06:45:30,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 295 transitions. [2022-01-10 06:45:30,627 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 295 transitions. Word has length 55 [2022-01-10 06:45:30,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:30,627 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 295 transitions. [2022-01-10 06:45:30,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 06:45:30,628 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 295 transitions. [2022-01-10 06:45:30,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-10 06:45:30,629 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:30,629 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:45:30,647 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 06:45:30,848 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 06:45:30,848 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:30,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:30,849 INFO L85 PathProgramCache]: Analyzing trace with hash 544058639, now seen corresponding path program 1 times [2022-01-10 06:45:30,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:30,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128049475] [2022-01-10 06:45:30,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:30,850 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:30,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:30,864 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 06:45:30,869 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 06:45:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:30,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:45:30,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:31,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:45:31,072 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:31,072 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:31,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128049475] [2022-01-10 06:45:31,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128049475] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:31,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:31,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:45:31,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637309700] [2022-01-10 06:45:31,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:31,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:45:31,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:31,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:45:31,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:45:31,074 INFO L87 Difference]: Start difference. First operand 205 states and 295 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:45:31,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:31,323 INFO L93 Difference]: Finished difference Result 591 states and 872 transitions. [2022-01-10 06:45:31,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:45:31,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 71 [2022-01-10 06:45:31,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:31,327 INFO L225 Difference]: With dead ends: 591 [2022-01-10 06:45:31,327 INFO L226 Difference]: Without dead ends: 403 [2022-01-10 06:45:31,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 06:45:31,329 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 763 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:31,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [763 Valid, 776 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:45:31,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-01-10 06:45:31,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 272. [2022-01-10 06:45:31,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 227 states have (on average 1.4052863436123348) internal successors, (319), 227 states have internal predecessors, (319), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-01-10 06:45:31,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 387 transitions. [2022-01-10 06:45:31,341 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 387 transitions. Word has length 71 [2022-01-10 06:45:31,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:31,342 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 387 transitions. [2022-01-10 06:45:31,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:45:31,342 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 387 transitions. [2022-01-10 06:45:31,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-10 06:45:31,343 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:31,343 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:45:31,352 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 06:45:31,550 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 06:45:31,551 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:31,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:31,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1856170394, now seen corresponding path program 1 times [2022-01-10 06:45:31,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:31,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445490463] [2022-01-10 06:45:31,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:31,552 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:31,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:31,553 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 06:45:31,554 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 06:45:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:31,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:45:31,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:31,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:45:31,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:31,765 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:31,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445490463] [2022-01-10 06:45:31,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445490463] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:31,765 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:31,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:45:31,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699265764] [2022-01-10 06:45:31,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:31,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:45:31,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:31,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:45:31,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:45:31,766 INFO L87 Difference]: Start difference. First operand 272 states and 387 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:45:31,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:31,976 INFO L93 Difference]: Finished difference Result 591 states and 870 transitions. [2022-01-10 06:45:31,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:45:31,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 72 [2022-01-10 06:45:31,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:31,978 INFO L225 Difference]: With dead ends: 591 [2022-01-10 06:45:31,978 INFO L226 Difference]: Without dead ends: 403 [2022-01-10 06:45:31,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 06:45:31,980 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 759 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:31,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [759 Valid, 779 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:45:31,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-01-10 06:45:31,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 272. [2022-01-10 06:45:31,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 227 states have (on average 1.4008810572687225) internal successors, (318), 227 states have internal predecessors, (318), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-01-10 06:45:31,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 386 transitions. [2022-01-10 06:45:31,991 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 386 transitions. Word has length 72 [2022-01-10 06:45:31,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:31,991 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 386 transitions. [2022-01-10 06:45:31,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:45:31,991 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 386 transitions. [2022-01-10 06:45:31,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-10 06:45:31,992 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:31,992 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:45:31,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-01-10 06:45:32,199 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 06:45:32,199 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:32,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:32,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1488729404, now seen corresponding path program 1 times [2022-01-10 06:45:32,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:32,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986031104] [2022-01-10 06:45:32,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:32,201 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:32,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:32,202 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 06:45:32,203 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 06:45:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:32,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 06:45:32,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:32,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:45:32,390 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:32,391 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:32,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [986031104] [2022-01-10 06:45:32,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [986031104] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:32,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:32,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:45:32,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353009814] [2022-01-10 06:45:32,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:32,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:45:32,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:32,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:45:32,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:45:32,394 INFO L87 Difference]: Start difference. First operand 272 states and 386 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:45:32,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:32,418 INFO L93 Difference]: Finished difference Result 663 states and 954 transitions. [2022-01-10 06:45:32,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:45:32,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 73 [2022-01-10 06:45:32,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:32,421 INFO L225 Difference]: With dead ends: 663 [2022-01-10 06:45:32,421 INFO L226 Difference]: Without dead ends: 475 [2022-01-10 06:45:32,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 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 06:45:32,424 INFO L933 BasicCegarLoop]: 337 mSDtfsCounter, 217 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:32,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 614 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:45:32,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-01-10 06:45:32,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 465. [2022-01-10 06:45:32,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 379 states have (on average 1.4116094986807388) internal successors, (535), 380 states have internal predecessors, (535), 65 states have call successors, (65), 20 states have call predecessors, (65), 20 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2022-01-10 06:45:32,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 665 transitions. [2022-01-10 06:45:32,446 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 665 transitions. Word has length 73 [2022-01-10 06:45:32,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:32,446 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 665 transitions. [2022-01-10 06:45:32,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:45:32,446 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 665 transitions. [2022-01-10 06:45:32,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-01-10 06:45:32,448 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:32,449 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:45:32,475 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 06:45:32,675 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 06:45:32,676 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:32,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:32,676 INFO L85 PathProgramCache]: Analyzing trace with hash -780706434, now seen corresponding path program 1 times [2022-01-10 06:45:32,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:32,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863352621] [2022-01-10 06:45:32,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:32,677 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:32,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:32,678 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 06:45:32,679 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 06:45:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:32,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 06:45:32,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:32,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:45:32,863 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:32,863 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:32,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863352621] [2022-01-10 06:45:32,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1863352621] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:32,863 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:32,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:45:32,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914720000] [2022-01-10 06:45:32,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:32,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:45:32,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:32,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:45:32,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:45:32,865 INFO L87 Difference]: Start difference. First operand 465 states and 665 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:45:32,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:32,892 INFO L93 Difference]: Finished difference Result 1122 states and 1628 transitions. [2022-01-10 06:45:32,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:45:32,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 74 [2022-01-10 06:45:32,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:32,900 INFO L225 Difference]: With dead ends: 1122 [2022-01-10 06:45:32,900 INFO L226 Difference]: Without dead ends: 779 [2022-01-10 06:45:32,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 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 06:45:32,902 INFO L933 BasicCegarLoop]: 370 mSDtfsCounter, 225 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:32,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 649 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:45:32,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2022-01-10 06:45:32,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 762. [2022-01-10 06:45:32,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 600 states have (on average 1.4216666666666666) internal successors, (853), 603 states have internal predecessors, (853), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-01-10 06:45:32,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1101 transitions. [2022-01-10 06:45:32,934 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1101 transitions. Word has length 74 [2022-01-10 06:45:32,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:32,935 INFO L470 AbstractCegarLoop]: Abstraction has 762 states and 1101 transitions. [2022-01-10 06:45:32,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:45:32,935 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1101 transitions. [2022-01-10 06:45:32,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-01-10 06:45:32,937 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:32,937 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:45:32,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-01-10 06:45:33,144 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 06:45:33,144 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:33,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:33,146 INFO L85 PathProgramCache]: Analyzing trace with hash -2060570112, now seen corresponding path program 1 times [2022-01-10 06:45:33,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:33,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889660485] [2022-01-10 06:45:33,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:33,146 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:33,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:33,147 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 06:45:33,149 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 06:45:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:33,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:45:33,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:33,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 06:45:33,332 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:33,332 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:33,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889660485] [2022-01-10 06:45:33,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889660485] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:33,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:33,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 06:45:33,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033501656] [2022-01-10 06:45:33,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:33,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:45:33,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:33,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:45:33,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:45:33,333 INFO L87 Difference]: Start difference. First operand 762 states and 1101 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 06:45:33,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:33,368 INFO L93 Difference]: Finished difference Result 1275 states and 1857 transitions. [2022-01-10 06:45:33,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:45:33,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 74 [2022-01-10 06:45:33,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:33,370 INFO L225 Difference]: With dead ends: 1275 [2022-01-10 06:45:33,370 INFO L226 Difference]: Without dead ends: 612 [2022-01-10 06:45:33,372 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 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 06:45:33,372 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 2 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:33,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1144 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:45:33,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2022-01-10 06:45:33,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2022-01-10 06:45:33,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 487 states have (on average 1.4229979466119096) internal successors, (693), 489 states have internal predecessors, (693), 95 states have call successors, (95), 29 states have call predecessors, (95), 29 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2022-01-10 06:45:33,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 883 transitions. [2022-01-10 06:45:33,388 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 883 transitions. Word has length 74 [2022-01-10 06:45:33,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:33,389 INFO L470 AbstractCegarLoop]: Abstraction has 612 states and 883 transitions. [2022-01-10 06:45:33,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 06:45:33,389 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 883 transitions. [2022-01-10 06:45:33,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-01-10 06:45:33,389 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:33,389 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:45:33,409 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 06:45:33,596 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 06:45:33,597 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:33,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:33,597 INFO L85 PathProgramCache]: Analyzing trace with hash 686873743, now seen corresponding path program 1 times [2022-01-10 06:45:33,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:33,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049872416] [2022-01-10 06:45:33,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:33,598 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:33,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:33,598 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 06:45:33,600 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 06:45:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:33,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 06:45:33,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:33,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 06:45:33,752 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:33,753 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:33,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049872416] [2022-01-10 06:45:33,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049872416] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:33,753 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:33,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:45:33,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233026066] [2022-01-10 06:45:33,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:33,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:45:33,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:33,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:45:33,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:45:33,754 INFO L87 Difference]: Start difference. First operand 612 states and 883 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 06:45:33,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:33,781 INFO L93 Difference]: Finished difference Result 1119 states and 1632 transitions. [2022-01-10 06:45:33,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:45:33,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 74 [2022-01-10 06:45:33,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:33,783 INFO L225 Difference]: With dead ends: 1119 [2022-01-10 06:45:33,783 INFO L226 Difference]: Without dead ends: 633 [2022-01-10 06:45:33,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 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 06:45:33,785 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 7 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:33,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 861 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:45:33,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2022-01-10 06:45:33,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 627. [2022-01-10 06:45:33,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 499 states have (on average 1.4128256513026052) internal successors, (705), 501 states have internal predecessors, (705), 95 states have call successors, (95), 32 states have call predecessors, (95), 32 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2022-01-10 06:45:33,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 895 transitions. [2022-01-10 06:45:33,801 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 895 transitions. Word has length 74 [2022-01-10 06:45:33,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:33,801 INFO L470 AbstractCegarLoop]: Abstraction has 627 states and 895 transitions. [2022-01-10 06:45:33,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 06:45:33,801 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 895 transitions. [2022-01-10 06:45:33,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-10 06:45:33,802 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:33,802 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:45:33,821 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 06:45:34,008 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 06:45:34,009 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:34,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:34,010 INFO L85 PathProgramCache]: Analyzing trace with hash -976087238, now seen corresponding path program 1 times [2022-01-10 06:45:34,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:34,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497509049] [2022-01-10 06:45:34,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:34,010 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:34,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:34,011 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 06:45:34,044 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 06:45:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:34,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:45:34,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:34,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:45:34,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:45:34,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 06:45:34,444 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:34,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1497509049] [2022-01-10 06:45:34,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1497509049] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 06:45:34,444 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 06:45:34,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2022-01-10 06:45:34,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535906865] [2022-01-10 06:45:34,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:34,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 06:45:34,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:34,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 06:45:34,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-10 06:45:34,445 INFO L87 Difference]: Start difference. First operand 627 states and 895 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 06:45:34,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:34,672 INFO L93 Difference]: Finished difference Result 1793 states and 2625 transitions. [2022-01-10 06:45:34,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 06:45:34,673 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 82 [2022-01-10 06:45:34,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:34,677 INFO L225 Difference]: With dead ends: 1793 [2022-01-10 06:45:34,677 INFO L226 Difference]: Without dead ends: 1292 [2022-01-10 06:45:34,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-10 06:45:34,679 INFO L933 BasicCegarLoop]: 400 mSDtfsCounter, 452 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 2163 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:34,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [477 Valid, 2163 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:45:34,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2022-01-10 06:45:34,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 886. [2022-01-10 06:45:34,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 687 states have (on average 1.4119359534206697) internal successors, (970), 691 states have internal predecessors, (970), 149 states have call successors, (149), 49 states have call predecessors, (149), 49 states have return successors, (149), 145 states have call predecessors, (149), 149 states have call successors, (149) [2022-01-10 06:45:34,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1268 transitions. [2022-01-10 06:45:34,709 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1268 transitions. Word has length 82 [2022-01-10 06:45:34,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:34,709 INFO L470 AbstractCegarLoop]: Abstraction has 886 states and 1268 transitions. [2022-01-10 06:45:34,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 06:45:34,709 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1268 transitions. [2022-01-10 06:45:34,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-10 06:45:34,710 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:34,710 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:45:34,729 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 06:45:34,917 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 06:45:34,917 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:34,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:34,917 INFO L85 PathProgramCache]: Analyzing trace with hash 880149525, now seen corresponding path program 1 times [2022-01-10 06:45:34,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:34,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732240314] [2022-01-10 06:45:34,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:34,918 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:34,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:34,932 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 06:45:34,933 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 06:45:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:35,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 06:45:35,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:35,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 06:45:35,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:35,104 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:35,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1732240314] [2022-01-10 06:45:35,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1732240314] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:35,105 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:35,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:45:35,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788933206] [2022-01-10 06:45:35,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:35,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:45:35,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:35,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:45:35,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:45:35,106 INFO L87 Difference]: Start difference. First operand 886 states and 1268 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 06:45:35,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:35,172 INFO L93 Difference]: Finished difference Result 1636 states and 2398 transitions. [2022-01-10 06:45:35,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:45:35,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 82 [2022-01-10 06:45:35,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:35,175 INFO L225 Difference]: With dead ends: 1636 [2022-01-10 06:45:35,175 INFO L226 Difference]: Without dead ends: 921 [2022-01-10 06:45:35,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 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 06:45:35,176 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 7 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:35,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 853 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:45:35,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2022-01-10 06:45:35,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 911. [2022-01-10 06:45:35,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 707 states have (on average 1.4002828854314002) internal successors, (990), 711 states have internal predecessors, (990), 149 states have call successors, (149), 54 states have call predecessors, (149), 54 states have return successors, (149), 145 states have call predecessors, (149), 149 states have call successors, (149) [2022-01-10 06:45:35,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1288 transitions. [2022-01-10 06:45:35,201 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1288 transitions. Word has length 82 [2022-01-10 06:45:35,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:35,201 INFO L470 AbstractCegarLoop]: Abstraction has 911 states and 1288 transitions. [2022-01-10 06:45:35,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 06:45:35,201 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1288 transitions. [2022-01-10 06:45:35,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-01-10 06:45:35,202 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:35,202 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:45:35,210 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 06:45:35,408 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 06:45:35,409 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:35,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:35,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1161655233, now seen corresponding path program 1 times [2022-01-10 06:45:35,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:35,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756810473] [2022-01-10 06:45:35,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:35,410 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:35,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:35,411 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 06:45:35,412 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 06:45:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:35,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 06:45:35,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:35,640 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 06:45:35,640 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:35,640 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:35,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756810473] [2022-01-10 06:45:35,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756810473] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:35,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:35,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:45:35,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111422698] [2022-01-10 06:45:35,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:35,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:45:35,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:35,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:45:35,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:45:35,641 INFO L87 Difference]: Start difference. First operand 911 states and 1288 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-10 06:45:35,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:35,689 INFO L93 Difference]: Finished difference Result 1675 states and 2398 transitions. [2022-01-10 06:45:35,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:45:35,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 90 [2022-01-10 06:45:35,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:35,692 INFO L225 Difference]: With dead ends: 1675 [2022-01-10 06:45:35,692 INFO L226 Difference]: Without dead ends: 941 [2022-01-10 06:45:35,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 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 06:45:35,695 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 6 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:35,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 853 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:45:35,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2022-01-10 06:45:35,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 931. [2022-01-10 06:45:35,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 722 states have (on average 1.39196675900277) internal successors, (1005), 726 states have internal predecessors, (1005), 149 states have call successors, (149), 59 states have call predecessors, (149), 59 states have return successors, (149), 145 states have call predecessors, (149), 149 states have call successors, (149) [2022-01-10 06:45:35,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1303 transitions. [2022-01-10 06:45:35,722 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1303 transitions. Word has length 90 [2022-01-10 06:45:35,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:35,722 INFO L470 AbstractCegarLoop]: Abstraction has 931 states and 1303 transitions. [2022-01-10 06:45:35,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-10 06:45:35,722 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1303 transitions. [2022-01-10 06:45:35,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-01-10 06:45:35,724 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:35,724 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:45:35,745 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 06:45:35,930 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 06:45:35,931 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:35,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:35,931 INFO L85 PathProgramCache]: Analyzing trace with hash 618643205, now seen corresponding path program 1 times [2022-01-10 06:45:35,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:35,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887819796] [2022-01-10 06:45:35,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:35,931 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:35,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:35,932 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 06:45:35,933 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 06:45:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:36,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 06:45:36,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:36,133 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 06:45:36,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:36,133 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:36,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [887819796] [2022-01-10 06:45:36,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [887819796] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:36,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:36,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:45:36,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92341696] [2022-01-10 06:45:36,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:36,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:45:36,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:36,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:45:36,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:45:36,134 INFO L87 Difference]: Start difference. First operand 931 states and 1303 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-10 06:45:36,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:36,172 INFO L93 Difference]: Finished difference Result 1714 states and 2448 transitions. [2022-01-10 06:45:36,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:45:36,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 97 [2022-01-10 06:45:36,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:36,175 INFO L225 Difference]: With dead ends: 1714 [2022-01-10 06:45:36,175 INFO L226 Difference]: Without dead ends: 966 [2022-01-10 06:45:36,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 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 06:45:36,177 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 7 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:36,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 853 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:45:36,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2022-01-10 06:45:36,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 956. [2022-01-10 06:45:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 742 states have (on average 1.3814016172506738) internal successors, (1025), 746 states have internal predecessors, (1025), 149 states have call successors, (149), 64 states have call predecessors, (149), 64 states have return successors, (149), 145 states have call predecessors, (149), 149 states have call successors, (149) [2022-01-10 06:45:36,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1323 transitions. [2022-01-10 06:45:36,201 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1323 transitions. Word has length 97 [2022-01-10 06:45:36,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:36,201 INFO L470 AbstractCegarLoop]: Abstraction has 956 states and 1323 transitions. [2022-01-10 06:45:36,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-10 06:45:36,201 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1323 transitions. [2022-01-10 06:45:36,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-10 06:45:36,202 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:36,202 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:45:36,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-01-10 06:45:36,408 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 06:45:36,409 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:36,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:36,409 INFO L85 PathProgramCache]: Analyzing trace with hash 225125039, now seen corresponding path program 1 times [2022-01-10 06:45:36,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:36,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878993373] [2022-01-10 06:45:36,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:36,409 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:36,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:36,427 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 06:45:36,491 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 06:45:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:36,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 06:45:36,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:36,673 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 06:45:36,673 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:36,674 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:36,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878993373] [2022-01-10 06:45:36,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878993373] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:36,674 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:36,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:45:36,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896904832] [2022-01-10 06:45:36,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:36,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:45:36,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:36,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:45:36,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:45:36,675 INFO L87 Difference]: Start difference. First operand 956 states and 1323 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-10 06:45:36,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:36,736 INFO L93 Difference]: Finished difference Result 1753 states and 2448 transitions. [2022-01-10 06:45:36,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:45:36,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 105 [2022-01-10 06:45:36,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:36,740 INFO L225 Difference]: With dead ends: 1753 [2022-01-10 06:45:36,740 INFO L226 Difference]: Without dead ends: 986 [2022-01-10 06:45:36,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 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 06:45:36,741 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 6 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:36,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 853 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:45:36,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2022-01-10 06:45:36,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 976. [2022-01-10 06:45:36,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 757 states have (on average 1.3738441215323647) internal successors, (1040), 761 states have internal predecessors, (1040), 149 states have call successors, (149), 69 states have call predecessors, (149), 69 states have return successors, (149), 145 states have call predecessors, (149), 149 states have call successors, (149) [2022-01-10 06:45:36,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1338 transitions. [2022-01-10 06:45:36,768 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1338 transitions. Word has length 105 [2022-01-10 06:45:36,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:36,768 INFO L470 AbstractCegarLoop]: Abstraction has 976 states and 1338 transitions. [2022-01-10 06:45:36,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-10 06:45:36,768 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1338 transitions. [2022-01-10 06:45:36,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-10 06:45:36,769 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:36,769 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:45:36,792 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 06:45:36,976 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 06:45:36,976 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:36,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:36,976 INFO L85 PathProgramCache]: Analyzing trace with hash -39200106, now seen corresponding path program 1 times [2022-01-10 06:45:36,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:36,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829028199] [2022-01-10 06:45:36,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:36,977 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:36,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:36,978 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 06:45:36,979 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 06:45:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:37,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:45:37,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:37,269 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 06:45:37,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:45:37,471 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-10 06:45:37,471 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:37,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [829028199] [2022-01-10 06:45:37,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [829028199] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:45:37,472 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:45:37,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2022-01-10 06:45:37,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101303793] [2022-01-10 06:45:37,472 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:45:37,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 06:45:37,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:37,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 06:45:37,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-10 06:45:37,473 INFO L87 Difference]: Start difference. First operand 976 states and 1338 transitions. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 7 states have internal predecessors, (102), 3 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2022-01-10 06:45:37,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:37,656 INFO L93 Difference]: Finished difference Result 2042 states and 2864 transitions. [2022-01-10 06:45:37,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 06:45:37,656 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 7 states have internal predecessors, (102), 3 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 106 [2022-01-10 06:45:37,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:37,660 INFO L225 Difference]: With dead ends: 2042 [2022-01-10 06:45:37,660 INFO L226 Difference]: Without dead ends: 1271 [2022-01-10 06:45:37,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-10 06:45:37,662 INFO L933 BasicCegarLoop]: 486 mSDtfsCounter, 445 mSDsluCounter, 2043 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 2529 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:37,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [469 Valid, 2529 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:45:37,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2022-01-10 06:45:37,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 976. [2022-01-10 06:45:37,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 757 states have (on average 1.3712021136063408) internal successors, (1038), 761 states have internal predecessors, (1038), 149 states have call successors, (149), 69 states have call predecessors, (149), 69 states have return successors, (149), 145 states have call predecessors, (149), 149 states have call successors, (149) [2022-01-10 06:45:37,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1336 transitions. [2022-01-10 06:45:37,689 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1336 transitions. Word has length 106 [2022-01-10 06:45:37,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:37,689 INFO L470 AbstractCegarLoop]: Abstraction has 976 states and 1336 transitions. [2022-01-10 06:45:37,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 7 states have internal predecessors, (102), 3 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2022-01-10 06:45:37,689 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1336 transitions. [2022-01-10 06:45:37,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-10 06:45:37,690 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:37,690 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:45:37,713 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 06:45:37,897 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 06:45:37,897 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:37,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:37,898 INFO L85 PathProgramCache]: Analyzing trace with hash 272075901, now seen corresponding path program 1 times [2022-01-10 06:45:37,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:37,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984985139] [2022-01-10 06:45:37,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:37,898 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:37,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:37,899 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 06:45:37,944 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 06:45:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:37,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 06:45:37,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:38,156 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 06:45:38,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:38,156 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:38,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984985139] [2022-01-10 06:45:38,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984985139] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:38,156 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:38,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 06:45:38,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049380181] [2022-01-10 06:45:38,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:38,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 06:45:38,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:38,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 06:45:38,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 06:45:38,157 INFO L87 Difference]: Start difference. First operand 976 states and 1336 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 06:45:38,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:38,542 INFO L93 Difference]: Finished difference Result 2041 states and 2881 transitions. [2022-01-10 06:45:38,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 06:45:38,542 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 110 [2022-01-10 06:45:38,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:38,557 INFO L225 Difference]: With dead ends: 2041 [2022-01-10 06:45:38,557 INFO L226 Difference]: Without dead ends: 1372 [2022-01-10 06:45:38,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-01-10 06:45:38,560 INFO L933 BasicCegarLoop]: 601 mSDtfsCounter, 739 mSDsluCounter, 1781 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 2382 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:38,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [739 Valid, 2382 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 06:45:38,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2022-01-10 06:45:38,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 969. [2022-01-10 06:45:38,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 749 states have (on average 1.3578104138851803) internal successors, (1017), 753 states have internal predecessors, (1017), 149 states have call successors, (149), 70 states have call predecessors, (149), 70 states have return successors, (149), 145 states have call predecessors, (149), 149 states have call successors, (149) [2022-01-10 06:45:38,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1315 transitions. [2022-01-10 06:45:38,630 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1315 transitions. Word has length 110 [2022-01-10 06:45:38,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:38,630 INFO L470 AbstractCegarLoop]: Abstraction has 969 states and 1315 transitions. [2022-01-10 06:45:38,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 06:45:38,630 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1315 transitions. [2022-01-10 06:45:38,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-01-10 06:45:38,631 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:38,632 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:45:38,651 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 06:45:38,838 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 06:45:38,838 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:38,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:38,839 INFO L85 PathProgramCache]: Analyzing trace with hash 898337423, now seen corresponding path program 1 times [2022-01-10 06:45:38,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:38,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1421097513] [2022-01-10 06:45:38,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:38,839 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:38,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:38,840 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:45:38,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-01-10 06:45:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:38,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 06:45:38,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:39,099 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 06:45:39,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:39,100 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:39,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1421097513] [2022-01-10 06:45:39,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1421097513] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:39,100 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:39,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 06:45:39,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232214622] [2022-01-10 06:45:39,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:39,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 06:45:39,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:39,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 06:45:39,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 06:45:39,101 INFO L87 Difference]: Start difference. First operand 969 states and 1315 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 4 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 06:45:39,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:39,465 INFO L93 Difference]: Finished difference Result 2142 states and 3006 transitions. [2022-01-10 06:45:39,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 06:45:39,466 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 4 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 111 [2022-01-10 06:45:39,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:39,470 INFO L225 Difference]: With dead ends: 2142 [2022-01-10 06:45:39,470 INFO L226 Difference]: Without dead ends: 1473 [2022-01-10 06:45:39,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-01-10 06:45:39,472 INFO L933 BasicCegarLoop]: 658 mSDtfsCounter, 612 mSDsluCounter, 2020 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 2678 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:39,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [612 Valid, 2678 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 06:45:39,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2022-01-10 06:45:39,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1084. [2022-01-10 06:45:39,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 829 states have (on average 1.3462002412545235) internal successors, (1116), 834 states have internal predecessors, (1116), 172 states have call successors, (172), 82 states have call predecessors, (172), 82 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2022-01-10 06:45:39,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1460 transitions. [2022-01-10 06:45:39,509 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1460 transitions. Word has length 111 [2022-01-10 06:45:39,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:39,509 INFO L470 AbstractCegarLoop]: Abstraction has 1084 states and 1460 transitions. [2022-01-10 06:45:39,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 4 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 06:45:39,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1460 transitions. [2022-01-10 06:45:39,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-01-10 06:45:39,511 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:39,511 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:45:39,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-01-10 06:45:39,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:45:39,718 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:39,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:39,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1090333236, now seen corresponding path program 1 times [2022-01-10 06:45:39,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:39,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [111727666] [2022-01-10 06:45:39,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:39,719 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:39,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:39,720 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:45:39,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-01-10 06:45:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:39,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 06:45:39,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:39,951 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 06:45:39,951 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:39,951 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:39,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [111727666] [2022-01-10 06:45:39,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [111727666] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:39,951 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:39,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:45:39,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71375836] [2022-01-10 06:45:39,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:39,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:45:39,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:39,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:45:39,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:45:39,954 INFO L87 Difference]: Start difference. First operand 1084 states and 1460 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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 06:45:40,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:40,180 INFO L93 Difference]: Finished difference Result 2936 states and 4032 transitions. [2022-01-10 06:45:40,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:45:40,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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 111 [2022-01-10 06:45:40,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:40,187 INFO L225 Difference]: With dead ends: 2936 [2022-01-10 06:45:40,187 INFO L226 Difference]: Without dead ends: 2274 [2022-01-10 06:45:40,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 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 06:45:40,189 INFO L933 BasicCegarLoop]: 389 mSDtfsCounter, 412 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:40,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [412 Valid, 1044 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:45:40,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2022-01-10 06:45:40,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 2013. [2022-01-10 06:45:40,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2013 states, 1517 states have (on average 1.3375082399472644) internal successors, (2029), 1528 states have internal predecessors, (2029), 337 states have call successors, (337), 158 states have call predecessors, (337), 158 states have return successors, (337), 326 states have call predecessors, (337), 337 states have call successors, (337) [2022-01-10 06:45:40,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 2013 states and 2703 transitions. [2022-01-10 06:45:40,261 INFO L78 Accepts]: Start accepts. Automaton has 2013 states and 2703 transitions. Word has length 111 [2022-01-10 06:45:40,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:40,261 INFO L470 AbstractCegarLoop]: Abstraction has 2013 states and 2703 transitions. [2022-01-10 06:45:40,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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 06:45:40,261 INFO L276 IsEmpty]: Start isEmpty. Operand 2013 states and 2703 transitions. [2022-01-10 06:45:40,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-10 06:45:40,263 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:40,263 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:45:40,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-01-10 06:45:40,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:45:40,486 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:40,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:40,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1036056096, now seen corresponding path program 1 times [2022-01-10 06:45:40,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:40,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1728816401] [2022-01-10 06:45:40,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:40,487 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:40,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:40,488 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:45:40,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-01-10 06:45:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:40,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 06:45:40,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:40,744 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 06:45:40,744 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:40,744 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:40,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1728816401] [2022-01-10 06:45:40,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1728816401] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:40,744 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:40,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 06:45:40,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306382658] [2022-01-10 06:45:40,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:40,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 06:45:40,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:40,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 06:45:40,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 06:45:40,746 INFO L87 Difference]: Start difference. First operand 2013 states and 2703 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 06:45:41,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:41,128 INFO L93 Difference]: Finished difference Result 4017 states and 5505 transitions. [2022-01-10 06:45:41,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 06:45:41,128 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 113 [2022-01-10 06:45:41,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:41,135 INFO L225 Difference]: With dead ends: 4017 [2022-01-10 06:45:41,135 INFO L226 Difference]: Without dead ends: 2322 [2022-01-10 06:45:41,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-01-10 06:45:41,137 INFO L933 BasicCegarLoop]: 537 mSDtfsCounter, 711 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:41,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [711 Valid, 2079 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:45:41,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2322 states. [2022-01-10 06:45:41,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2322 to 1831. [2022-01-10 06:45:41,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1831 states, 1388 states have (on average 1.3328530259365994) internal successors, (1850), 1398 states have internal predecessors, (1850), 300 states have call successors, (300), 142 states have call predecessors, (300), 142 states have return successors, (300), 290 states have call predecessors, (300), 300 states have call successors, (300) [2022-01-10 06:45:41,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1831 states and 2450 transitions. [2022-01-10 06:45:41,202 INFO L78 Accepts]: Start accepts. Automaton has 1831 states and 2450 transitions. Word has length 113 [2022-01-10 06:45:41,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:41,202 INFO L470 AbstractCegarLoop]: Abstraction has 1831 states and 2450 transitions. [2022-01-10 06:45:41,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 06:45:41,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 2450 transitions. [2022-01-10 06:45:41,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-10 06:45:41,203 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:41,204 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:45:41,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-01-10 06:45:41,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:45:41,411 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:41,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:41,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1416988018, now seen corresponding path program 1 times [2022-01-10 06:45:41,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:41,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939795049] [2022-01-10 06:45:41,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:41,411 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:41,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:41,413 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:45:41,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-01-10 06:45:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:41,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:45:41,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:41,683 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-10 06:45:41,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:45:41,827 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-10 06:45:41,828 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:41,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939795049] [2022-01-10 06:45:41,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939795049] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 06:45:41,828 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 06:45:41,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2022-01-10 06:45:41,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185989990] [2022-01-10 06:45:41,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:41,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 06:45:41,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:41,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 06:45:41,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-10 06:45:41,829 INFO L87 Difference]: Start difference. First operand 1831 states and 2450 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 06:45:42,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:42,063 INFO L93 Difference]: Finished difference Result 3615 states and 4904 transitions. [2022-01-10 06:45:42,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 06:45:42,074 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 114 [2022-01-10 06:45:42,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:42,081 INFO L225 Difference]: With dead ends: 3615 [2022-01-10 06:45:42,082 INFO L226 Difference]: Without dead ends: 2292 [2022-01-10 06:45:42,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 220 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-10 06:45:42,085 INFO L933 BasicCegarLoop]: 524 mSDtfsCounter, 355 mSDsluCounter, 2229 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 2753 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:42,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [371 Valid, 2753 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:45:42,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2292 states. [2022-01-10 06:45:42,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2292 to 1831. [2022-01-10 06:45:42,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1831 states, 1388 states have (on average 1.329250720461095) internal successors, (1845), 1398 states have internal predecessors, (1845), 300 states have call successors, (300), 142 states have call predecessors, (300), 142 states have return successors, (300), 290 states have call predecessors, (300), 300 states have call successors, (300) [2022-01-10 06:45:42,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1831 states and 2445 transitions. [2022-01-10 06:45:42,241 INFO L78 Accepts]: Start accepts. Automaton has 1831 states and 2445 transitions. Word has length 114 [2022-01-10 06:45:42,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:42,241 INFO L470 AbstractCegarLoop]: Abstraction has 1831 states and 2445 transitions. [2022-01-10 06:45:42,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 06:45:42,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 2445 transitions. [2022-01-10 06:45:42,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-10 06:45:42,243 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:42,243 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:45:42,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-01-10 06:45:42,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:45:42,450 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:42,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:42,450 INFO L85 PathProgramCache]: Analyzing trace with hash 540191593, now seen corresponding path program 1 times [2022-01-10 06:45:42,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:42,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567289559] [2022-01-10 06:45:42,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:42,451 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:42,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:42,452 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:45:42,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-01-10 06:45:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:42,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 06:45:42,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:42,701 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 06:45:42,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:42,701 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:42,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567289559] [2022-01-10 06:45:42,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567289559] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:42,701 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:42,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:45:42,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701498073] [2022-01-10 06:45:42,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:42,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:45:42,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:42,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:45:42,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:45:42,702 INFO L87 Difference]: Start difference. First operand 1831 states and 2445 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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 06:45:42,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:42,881 INFO L93 Difference]: Finished difference Result 4374 states and 5917 transitions. [2022-01-10 06:45:42,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:45:42,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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 113 [2022-01-10 06:45:42,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:42,892 INFO L225 Difference]: With dead ends: 4374 [2022-01-10 06:45:42,893 INFO L226 Difference]: Without dead ends: 3112 [2022-01-10 06:45:42,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 111 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 06:45:42,897 INFO L933 BasicCegarLoop]: 493 mSDtfsCounter, 459 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:42,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 1242 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:45:42,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3112 states. [2022-01-10 06:45:43,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3112 to 2748. [2022-01-10 06:45:43,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2748 states, 2066 states have (on average 1.3223620522749273) internal successors, (2732), 2082 states have internal predecessors, (2732), 464 states have call successors, (464), 217 states have call predecessors, (464), 217 states have return successors, (464), 448 states have call predecessors, (464), 464 states have call successors, (464) [2022-01-10 06:45:43,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2748 states to 2748 states and 3660 transitions. [2022-01-10 06:45:43,046 INFO L78 Accepts]: Start accepts. Automaton has 2748 states and 3660 transitions. Word has length 113 [2022-01-10 06:45:43,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:43,046 INFO L470 AbstractCegarLoop]: Abstraction has 2748 states and 3660 transitions. [2022-01-10 06:45:43,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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 06:45:43,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2748 states and 3660 transitions. [2022-01-10 06:45:43,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-10 06:45:43,049 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:43,049 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:45:43,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-01-10 06:45:43,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:45:43,256 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:43,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:43,256 INFO L85 PathProgramCache]: Analyzing trace with hash -290051495, now seen corresponding path program 1 times [2022-01-10 06:45:43,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:43,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169113817] [2022-01-10 06:45:43,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:43,257 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:43,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:43,258 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:45:43,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-01-10 06:45:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:43,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:45:43,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:43,493 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 06:45:43,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:43,493 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:43,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169113817] [2022-01-10 06:45:43,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169113817] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:43,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:43,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:45:43,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870972969] [2022-01-10 06:45:43,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:43,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:45:43,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:43,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:45:43,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:45:43,495 INFO L87 Difference]: Start difference. First operand 2748 states and 3660 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 06:45:43,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:43,772 INFO L93 Difference]: Finished difference Result 4692 states and 6258 transitions. [2022-01-10 06:45:43,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:45:43,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 113 [2022-01-10 06:45:43,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:43,787 INFO L225 Difference]: With dead ends: 4692 [2022-01-10 06:45:43,787 INFO L226 Difference]: Without dead ends: 2293 [2022-01-10 06:45:43,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 06:45:43,792 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 747 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:43,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [747 Valid, 853 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:45:43,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2293 states. [2022-01-10 06:45:43,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2293 to 2269. [2022-01-10 06:45:43,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2269 states, 1708 states have (on average 1.3208430913348945) internal successors, (2256), 1721 states have internal predecessors, (2256), 378 states have call successors, (378), 182 states have call predecessors, (378), 182 states have return successors, (378), 365 states have call predecessors, (378), 378 states have call successors, (378) [2022-01-10 06:45:43,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2269 states to 2269 states and 3012 transitions. [2022-01-10 06:45:43,870 INFO L78 Accepts]: Start accepts. Automaton has 2269 states and 3012 transitions. Word has length 113 [2022-01-10 06:45:43,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:43,870 INFO L470 AbstractCegarLoop]: Abstraction has 2269 states and 3012 transitions. [2022-01-10 06:45:43,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 06:45:43,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2269 states and 3012 transitions. [2022-01-10 06:45:43,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-01-10 06:45:43,872 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:43,872 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:45:43,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-01-10 06:45:44,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:45:44,078 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:44,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:44,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1542787803, now seen corresponding path program 1 times [2022-01-10 06:45:44,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:44,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027514705] [2022-01-10 06:45:44,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:44,079 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:44,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:44,080 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:45:44,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-01-10 06:45:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:44,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:45:44,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:44,330 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 06:45:44,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:45:44,524 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-10 06:45:44,524 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:44,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027514705] [2022-01-10 06:45:44,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027514705] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 06:45:44,524 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 06:45:44,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2022-01-10 06:45:44,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027236264] [2022-01-10 06:45:44,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:44,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 06:45:44,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:44,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 06:45:44,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-10 06:45:44,525 INFO L87 Difference]: Start difference. First operand 2269 states and 3012 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-10 06:45:44,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:44,762 INFO L93 Difference]: Finished difference Result 4858 states and 6600 transitions. [2022-01-10 06:45:44,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 06:45:44,763 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 117 [2022-01-10 06:45:44,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:44,771 INFO L225 Difference]: With dead ends: 4858 [2022-01-10 06:45:44,771 INFO L226 Difference]: Without dead ends: 2902 [2022-01-10 06:45:44,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 226 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-10 06:45:44,775 INFO L933 BasicCegarLoop]: 474 mSDtfsCounter, 334 mSDsluCounter, 2062 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 2536 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:44,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [351 Valid, 2536 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:45:44,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2022-01-10 06:45:44,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 2077. [2022-01-10 06:45:44,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2077 states, 1568 states have (on average 1.3188775510204083) internal successors, (2068), 1580 states have internal predecessors, (2068), 340 states have call successors, (340), 168 states have call predecessors, (340), 168 states have return successors, (340), 328 states have call predecessors, (340), 340 states have call successors, (340) [2022-01-10 06:45:44,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 2077 states and 2748 transitions. [2022-01-10 06:45:44,866 INFO L78 Accepts]: Start accepts. Automaton has 2077 states and 2748 transitions. Word has length 117 [2022-01-10 06:45:44,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:44,866 INFO L470 AbstractCegarLoop]: Abstraction has 2077 states and 2748 transitions. [2022-01-10 06:45:44,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-10 06:45:44,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 2748 transitions. [2022-01-10 06:45:44,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-01-10 06:45:44,867 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:44,867 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:45:44,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2022-01-10 06:45:45,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:45:45,074 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:45,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:45,075 INFO L85 PathProgramCache]: Analyzing trace with hash -723784830, now seen corresponding path program 1 times [2022-01-10 06:45:45,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:45,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145706171] [2022-01-10 06:45:45,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:45,075 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:45,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:45,079 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:45:45,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-01-10 06:45:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:45,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:45:45,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:45,359 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 06:45:45,359 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:45,359 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:45,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [145706171] [2022-01-10 06:45:45,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [145706171] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:45,359 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:45,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:45:45,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409554783] [2022-01-10 06:45:45,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:45,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:45:45,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:45,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:45:45,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:45:45,360 INFO L87 Difference]: Start difference. First operand 2077 states and 2748 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 06:45:45,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:45,633 INFO L93 Difference]: Finished difference Result 3887 states and 5173 transitions. [2022-01-10 06:45:45,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:45:45,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 116 [2022-01-10 06:45:45,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:45,652 INFO L225 Difference]: With dead ends: 3887 [2022-01-10 06:45:45,652 INFO L226 Difference]: Without dead ends: 2004 [2022-01-10 06:45:45,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 06:45:45,655 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 706 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:45,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [706 Valid, 749 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:45:45,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2022-01-10 06:45:45,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1880. [2022-01-10 06:45:45,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1413 states have (on average 1.3121019108280254) internal successors, (1854), 1424 states have internal predecessors, (1854), 311 states have call successors, (311), 155 states have call predecessors, (311), 155 states have return successors, (311), 300 states have call predecessors, (311), 311 states have call successors, (311) [2022-01-10 06:45:45,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2476 transitions. [2022-01-10 06:45:45,804 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2476 transitions. Word has length 116 [2022-01-10 06:45:45,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:45,804 INFO L470 AbstractCegarLoop]: Abstraction has 1880 states and 2476 transitions. [2022-01-10 06:45:45,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 06:45:45,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2476 transitions. [2022-01-10 06:45:45,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-01-10 06:45:45,805 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:45,805 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:45:45,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-01-10 06:45:46,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:45:46,012 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:46,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:46,013 INFO L85 PathProgramCache]: Analyzing trace with hash 519891230, now seen corresponding path program 1 times [2022-01-10 06:45:46,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:46,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1640028798] [2022-01-10 06:45:46,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:46,013 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:46,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:46,014 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:45:46,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-01-10 06:45:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:46,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 06:45:46,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:46,252 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-01-10 06:45:46,252 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:46,253 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:46,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1640028798] [2022-01-10 06:45:46,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1640028798] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:46,253 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:46,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:45:46,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851543247] [2022-01-10 06:45:46,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:46,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:45:46,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:46,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:45:46,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:45:46,254 INFO L87 Difference]: Start difference. First operand 1880 states and 2476 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-01-10 06:45:46,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:46,326 INFO L93 Difference]: Finished difference Result 3600 states and 4779 transitions. [2022-01-10 06:45:46,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:45:46,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 122 [2022-01-10 06:45:46,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:46,331 INFO L225 Difference]: With dead ends: 3600 [2022-01-10 06:45:46,331 INFO L226 Difference]: Without dead ends: 1976 [2022-01-10 06:45:46,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 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 06:45:46,334 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 8 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:46,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 858 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:45:46,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1976 states. [2022-01-10 06:45:46,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1976 to 1952. [2022-01-10 06:45:46,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1473 states have (on average 1.2993890020366599) internal successors, (1914), 1484 states have internal predecessors, (1914), 311 states have call successors, (311), 167 states have call predecessors, (311), 167 states have return successors, (311), 300 states have call predecessors, (311), 311 states have call successors, (311) [2022-01-10 06:45:46,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2536 transitions. [2022-01-10 06:45:46,403 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2536 transitions. Word has length 122 [2022-01-10 06:45:46,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:46,403 INFO L470 AbstractCegarLoop]: Abstraction has 1952 states and 2536 transitions. [2022-01-10 06:45:46,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-01-10 06:45:46,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2536 transitions. [2022-01-10 06:45:46,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-01-10 06:45:46,404 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:46,404 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:45:46,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-01-10 06:45:46,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:45:46,610 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:46,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:46,612 INFO L85 PathProgramCache]: Analyzing trace with hash -346670069, now seen corresponding path program 1 times [2022-01-10 06:45:46,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:46,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1707045327] [2022-01-10 06:45:46,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:46,612 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:46,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:46,623 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:45:46,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-01-10 06:45:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:46,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:45:46,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:46,939 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-10 06:45:46,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:45:47,131 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-10 06:45:47,131 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:47,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1707045327] [2022-01-10 06:45:47,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1707045327] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 06:45:47,132 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 06:45:47,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2022-01-10 06:45:47,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373666605] [2022-01-10 06:45:47,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:47,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 06:45:47,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:47,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 06:45:47,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-10 06:45:47,132 INFO L87 Difference]: Start difference. First operand 1952 states and 2536 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-10 06:45:47,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:47,336 INFO L93 Difference]: Finished difference Result 4122 states and 5473 transitions. [2022-01-10 06:45:47,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 06:45:47,336 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 125 [2022-01-10 06:45:47,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:47,344 INFO L225 Difference]: With dead ends: 4122 [2022-01-10 06:45:47,344 INFO L226 Difference]: Without dead ends: 2390 [2022-01-10 06:45:47,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 242 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-10 06:45:47,348 INFO L933 BasicCegarLoop]: 371 mSDtfsCounter, 384 mSDsluCounter, 1665 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 2036 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:47,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [398 Valid, 2036 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:45:47,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2390 states. [2022-01-10 06:45:47,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2390 to 1931. [2022-01-10 06:45:47,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1931 states, 1458 states have (on average 1.2956104252400549) internal successors, (1889), 1469 states have internal predecessors, (1889), 305 states have call successors, (305), 167 states have call predecessors, (305), 167 states have return successors, (305), 294 states have call predecessors, (305), 305 states have call successors, (305) [2022-01-10 06:45:47,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 2499 transitions. [2022-01-10 06:45:47,422 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 2499 transitions. Word has length 125 [2022-01-10 06:45:47,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:47,422 INFO L470 AbstractCegarLoop]: Abstraction has 1931 states and 2499 transitions. [2022-01-10 06:45:47,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-10 06:45:47,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2499 transitions. [2022-01-10 06:45:47,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-01-10 06:45:47,423 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:47,423 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:45:47,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-01-10 06:45:47,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:45:47,630 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:47,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:47,630 INFO L85 PathProgramCache]: Analyzing trace with hash 922318007, now seen corresponding path program 1 times [2022-01-10 06:45:47,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:47,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1263125395] [2022-01-10 06:45:47,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:47,631 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:47,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:47,632 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:45:47,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-01-10 06:45:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:47,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 06:45:47,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:47,914 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-10 06:45:47,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:47,914 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:47,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1263125395] [2022-01-10 06:45:47,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1263125395] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:47,914 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:47,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 06:45:47,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805896293] [2022-01-10 06:45:47,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:47,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 06:45:47,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:47,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 06:45:47,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:45:47,916 INFO L87 Difference]: Start difference. First operand 1931 states and 2499 transitions. Second operand has 6 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-01-10 06:45:48,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:48,095 INFO L93 Difference]: Finished difference Result 2770 states and 3781 transitions. [2022-01-10 06:45:48,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 06:45:48,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 128 [2022-01-10 06:45:48,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:48,100 INFO L225 Difference]: With dead ends: 2770 [2022-01-10 06:45:48,100 INFO L226 Difference]: Without dead ends: 2768 [2022-01-10 06:45:48,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 06:45:48,101 INFO L933 BasicCegarLoop]: 433 mSDtfsCounter, 254 mSDsluCounter, 1527 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1960 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:48,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 1960 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:45:48,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2768 states. [2022-01-10 06:45:48,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2768 to 1926. [2022-01-10 06:45:48,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1451 states have (on average 1.2970365265334252) internal successors, (1882), 1463 states have internal predecessors, (1882), 306 states have call successors, (306), 168 states have call predecessors, (306), 168 states have return successors, (306), 294 states have call predecessors, (306), 306 states have call successors, (306) [2022-01-10 06:45:48,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 2494 transitions. [2022-01-10 06:45:48,178 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 2494 transitions. Word has length 128 [2022-01-10 06:45:48,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:48,180 INFO L470 AbstractCegarLoop]: Abstraction has 1926 states and 2494 transitions. [2022-01-10 06:45:48,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-01-10 06:45:48,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2494 transitions. [2022-01-10 06:45:48,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-01-10 06:45:48,182 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:48,182 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:45:48,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-01-10 06:45:48,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:45:48,388 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:48,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:48,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1957294341, now seen corresponding path program 1 times [2022-01-10 06:45:48,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:48,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275935969] [2022-01-10 06:45:48,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:48,389 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:48,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:48,391 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:45:48,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-01-10 06:45:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:48,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:45:48,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:48,758 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-10 06:45:48,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:45:49,036 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-01-10 06:45:49,036 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:49,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275935969] [2022-01-10 06:45:49,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1275935969] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 06:45:49,037 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 06:45:49,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2022-01-10 06:45:49,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616319720] [2022-01-10 06:45:49,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:49,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 06:45:49,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:49,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 06:45:49,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-01-10 06:45:49,038 INFO L87 Difference]: Start difference. First operand 1926 states and 2494 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 6 states have internal predecessors, (95), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-10 06:45:49,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:49,268 INFO L93 Difference]: Finished difference Result 3871 states and 5092 transitions. [2022-01-10 06:45:49,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 06:45:49,268 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 6 states have internal predecessors, (95), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 131 [2022-01-10 06:45:49,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:49,274 INFO L225 Difference]: With dead ends: 3871 [2022-01-10 06:45:49,274 INFO L226 Difference]: Without dead ends: 2204 [2022-01-10 06:45:49,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-01-10 06:45:49,276 INFO L933 BasicCegarLoop]: 361 mSDtfsCounter, 411 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 2004 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:49,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [416 Valid, 2004 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:45:49,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204 states. [2022-01-10 06:45:49,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204 to 1724. [2022-01-10 06:45:49,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1724 states, 1307 states have (on average 1.2884468247895944) internal successors, (1684), 1318 states have internal predecessors, (1684), 268 states have call successors, (268), 148 states have call predecessors, (268), 148 states have return successors, (268), 257 states have call predecessors, (268), 268 states have call successors, (268) [2022-01-10 06:45:49,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2220 transitions. [2022-01-10 06:45:49,360 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2220 transitions. Word has length 131 [2022-01-10 06:45:49,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:49,360 INFO L470 AbstractCegarLoop]: Abstraction has 1724 states and 2220 transitions. [2022-01-10 06:45:49,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 6 states have internal predecessors, (95), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-10 06:45:49,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2220 transitions. [2022-01-10 06:45:49,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-01-10 06:45:49,363 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:49,363 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:45:49,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-01-10 06:45:49,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:45:49,570 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:49,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:49,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1874513171, now seen corresponding path program 1 times [2022-01-10 06:45:49,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:49,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2135649075] [2022-01-10 06:45:49,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:49,572 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:49,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:49,573 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:45:49,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-01-10 06:45:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:49,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 06:45:49,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:50,156 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 75 proven. 17 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-01-10 06:45:50,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:45:50,486 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-01-10 06:45:50,486 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:50,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2135649075] [2022-01-10 06:45:50,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2135649075] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:45:50,487 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:45:50,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2022-01-10 06:45:50,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598098004] [2022-01-10 06:45:50,487 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:45:50,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 06:45:50,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:50,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 06:45:50,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-01-10 06:45:50,488 INFO L87 Difference]: Start difference. First operand 1724 states and 2220 transitions. Second operand has 18 states, 18 states have (on average 14.61111111111111) internal successors, (263), 18 states have internal predecessors, (263), 7 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (34), 7 states have call predecessors, (34), 7 states have call successors, (34) [2022-01-10 06:45:52,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:52,839 INFO L93 Difference]: Finished difference Result 4854 states and 6537 transitions. [2022-01-10 06:45:52,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-01-10 06:45:52,840 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 14.61111111111111) internal successors, (263), 18 states have internal predecessors, (263), 7 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (34), 7 states have call predecessors, (34), 7 states have call successors, (34) Word has length 208 [2022-01-10 06:45:52,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:52,846 INFO L225 Difference]: With dead ends: 4854 [2022-01-10 06:45:52,846 INFO L226 Difference]: Without dead ends: 3397 [2022-01-10 06:45:52,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 399 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1121 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=3470, Unknown=0, NotChecked=0, Total=4290 [2022-01-10 06:45:52,850 INFO L933 BasicCegarLoop]: 433 mSDtfsCounter, 3763 mSDsluCounter, 3049 mSDsCounter, 0 mSdLazyCounter, 2522 mSolverCounterSat, 1510 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3763 SdHoareTripleChecker+Valid, 3482 SdHoareTripleChecker+Invalid, 4032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1510 IncrementalHoareTripleChecker+Valid, 2522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:52,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3763 Valid, 3482 Invalid, 4032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1510 Valid, 2522 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-10 06:45:52,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3397 states. [2022-01-10 06:45:52,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3397 to 2309. [2022-01-10 06:45:52,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2309 states, 1746 states have (on average 1.2823596792668959) internal successors, (2239), 1760 states have internal predecessors, (2239), 358 states have call successors, (358), 204 states have call predecessors, (358), 204 states have return successors, (358), 344 states have call predecessors, (358), 358 states have call successors, (358) [2022-01-10 06:45:52,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 2955 transitions. [2022-01-10 06:45:52,984 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 2955 transitions. Word has length 208 [2022-01-10 06:45:52,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:52,984 INFO L470 AbstractCegarLoop]: Abstraction has 2309 states and 2955 transitions. [2022-01-10 06:45:52,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 14.61111111111111) internal successors, (263), 18 states have internal predecessors, (263), 7 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (34), 7 states have call predecessors, (34), 7 states have call successors, (34) [2022-01-10 06:45:52,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 2955 transitions. [2022-01-10 06:45:52,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-01-10 06:45:52,986 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:52,986 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:45:53,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-01-10 06:45:53,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:45:53,194 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:53,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:53,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2051737563, now seen corresponding path program 1 times [2022-01-10 06:45:53,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:53,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961164847] [2022-01-10 06:45:53,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:53,194 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:53,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:53,196 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:45:53,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-01-10 06:45:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:53,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 06:45:53,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:53,804 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 79 proven. 27 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-01-10 06:45:53,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:45:54,170 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 26 proven. 19 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-01-10 06:45:54,170 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:54,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961164847] [2022-01-10 06:45:54,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961164847] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:45:54,171 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:45:54,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2022-01-10 06:45:54,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062879411] [2022-01-10 06:45:54,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:45:54,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 06:45:54,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:54,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 06:45:54,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-01-10 06:45:54,172 INFO L87 Difference]: Start difference. First operand 2309 states and 2955 transitions. Second operand has 18 states, 18 states have (on average 15.166666666666666) internal successors, (273), 18 states have internal predecessors, (273), 7 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (34), 7 states have call predecessors, (34), 7 states have call successors, (34) [2022-01-10 06:45:57,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:57,309 INFO L93 Difference]: Finished difference Result 6652 states and 8911 transitions. [2022-01-10 06:45:57,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-01-10 06:45:57,310 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 15.166666666666666) internal successors, (273), 18 states have internal predecessors, (273), 7 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (34), 7 states have call predecessors, (34), 7 states have call successors, (34) Word has length 209 [2022-01-10 06:45:57,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:57,319 INFO L225 Difference]: With dead ends: 6652 [2022-01-10 06:45:57,319 INFO L226 Difference]: Without dead ends: 4692 [2022-01-10 06:45:57,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 403 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=787, Invalid=3503, Unknown=0, NotChecked=0, Total=4290 [2022-01-10 06:45:57,322 INFO L933 BasicCegarLoop]: 652 mSDtfsCounter, 2756 mSDsluCounter, 4706 mSDsCounter, 0 mSdLazyCounter, 3912 mSolverCounterSat, 1317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2756 SdHoareTripleChecker+Valid, 5358 SdHoareTripleChecker+Invalid, 5229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1317 IncrementalHoareTripleChecker+Valid, 3912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:57,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2756 Valid, 5358 Invalid, 5229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1317 Valid, 3912 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-01-10 06:45:57,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4692 states. [2022-01-10 06:45:57,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4692 to 3286. [2022-01-10 06:45:57,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3286 states, 2495 states have (on average 1.276553106212425) internal successors, (3185), 2515 states have internal predecessors, (3185), 498 states have call successors, (498), 292 states have call predecessors, (498), 292 states have return successors, (498), 478 states have call predecessors, (498), 498 states have call successors, (498) [2022-01-10 06:45:57,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3286 states to 3286 states and 4181 transitions. [2022-01-10 06:45:57,534 INFO L78 Accepts]: Start accepts. Automaton has 3286 states and 4181 transitions. Word has length 209 [2022-01-10 06:45:57,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:57,534 INFO L470 AbstractCegarLoop]: Abstraction has 3286 states and 4181 transitions. [2022-01-10 06:45:57,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 15.166666666666666) internal successors, (273), 18 states have internal predecessors, (273), 7 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (34), 7 states have call predecessors, (34), 7 states have call successors, (34) [2022-01-10 06:45:57,534 INFO L276 IsEmpty]: Start isEmpty. Operand 3286 states and 4181 transitions. [2022-01-10 06:45:57,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-01-10 06:45:57,537 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:57,537 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:45:57,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-01-10 06:45:57,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:45:57,745 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:57,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:57,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1729087954, now seen corresponding path program 1 times [2022-01-10 06:45:57,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:57,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337070020] [2022-01-10 06:45:57,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:57,746 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:57,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:57,747 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:45:57,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-01-10 06:45:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:57,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 06:45:57,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:58,192 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 64 proven. 28 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-01-10 06:45:58,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:45:58,532 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-01-10 06:45:58,533 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:58,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337070020] [2022-01-10 06:45:58,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1337070020] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:45:58,533 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:45:58,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2022-01-10 06:45:58,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660685001] [2022-01-10 06:45:58,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:45:58,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 06:45:58,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:58,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 06:45:58,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-01-10 06:45:58,534 INFO L87 Difference]: Start difference. First operand 3286 states and 4181 transitions. Second operand has 12 states, 12 states have (on average 23.833333333333332) internal successors, (286), 12 states have internal predecessors, (286), 7 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (34), 7 states have call predecessors, (34), 7 states have call successors, (34) [2022-01-10 06:45:59,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:59,980 INFO L93 Difference]: Finished difference Result 9343 states and 12766 transitions. [2022-01-10 06:45:59,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-10 06:45:59,981 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 23.833333333333332) internal successors, (286), 12 states have internal predecessors, (286), 7 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (34), 7 states have call predecessors, (34), 7 states have call successors, (34) Word has length 210 [2022-01-10 06:45:59,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:59,993 INFO L225 Difference]: With dead ends: 9343 [2022-01-10 06:45:59,993 INFO L226 Difference]: Without dead ends: 6544 [2022-01-10 06:45:59,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 410 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=251, Invalid=619, Unknown=0, NotChecked=0, Total=870 [2022-01-10 06:45:59,997 INFO L933 BasicCegarLoop]: 419 mSDtfsCounter, 2000 mSDsluCounter, 2367 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 889 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2000 SdHoareTripleChecker+Valid, 2786 SdHoareTripleChecker+Invalid, 1919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 889 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:59,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2000 Valid, 2786 Invalid, 1919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [889 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 06:46:00,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6544 states. [2022-01-10 06:46:00,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6544 to 3580. [2022-01-10 06:46:00,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3580 states, 2753 states have (on average 1.2789683981111515) internal successors, (3521), 2773 states have internal predecessors, (3521), 516 states have call successors, (516), 310 states have call predecessors, (516), 310 states have return successors, (516), 496 states have call predecessors, (516), 516 states have call successors, (516) [2022-01-10 06:46:00,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 3580 states and 4553 transitions. [2022-01-10 06:46:00,223 INFO L78 Accepts]: Start accepts. Automaton has 3580 states and 4553 transitions. Word has length 210 [2022-01-10 06:46:00,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:46:00,224 INFO L470 AbstractCegarLoop]: Abstraction has 3580 states and 4553 transitions. [2022-01-10 06:46:00,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 23.833333333333332) internal successors, (286), 12 states have internal predecessors, (286), 7 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (34), 7 states have call predecessors, (34), 7 states have call successors, (34) [2022-01-10 06:46:00,224 INFO L276 IsEmpty]: Start isEmpty. Operand 3580 states and 4553 transitions. [2022-01-10 06:46:00,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-01-10 06:46:00,228 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:46:00,228 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:46:00,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-01-10 06:46:00,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:46:00,436 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:46:00,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:46:00,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1333454595, now seen corresponding path program 1 times [2022-01-10 06:46:00,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:46:00,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85411557] [2022-01-10 06:46:00,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:46:00,436 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:46:00,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:46:00,437 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:46:00,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-01-10 06:46:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:46:00,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:46:00,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:46:00,853 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 80 proven. 13 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-01-10 06:46:00,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:46:01,067 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-01-10 06:46:01,068 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:46:01,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [85411557] [2022-01-10 06:46:01,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [85411557] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:46:01,068 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:46:01,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-01-10 06:46:01,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490034551] [2022-01-10 06:46:01,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:46:01,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 06:46:01,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:46:01,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 06:46:01,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-01-10 06:46:01,069 INFO L87 Difference]: Start difference. First operand 3580 states and 4553 transitions. Second operand has 12 states, 12 states have (on average 20.916666666666668) internal successors, (251), 12 states have internal predecessors, (251), 6 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (33), 6 states have call predecessors, (33), 6 states have call successors, (33) [2022-01-10 06:46:02,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:46:02,642 INFO L93 Difference]: Finished difference Result 14483 states and 19708 transitions. [2022-01-10 06:46:02,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-10 06:46:02,642 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 20.916666666666668) internal successors, (251), 12 states have internal predecessors, (251), 6 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (33), 6 states have call predecessors, (33), 6 states have call successors, (33) Word has length 211 [2022-01-10 06:46:02,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:46:02,662 INFO L225 Difference]: With dead ends: 14483 [2022-01-10 06:46:02,662 INFO L226 Difference]: Without dead ends: 11390 [2022-01-10 06:46:02,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=239, Invalid=753, Unknown=0, NotChecked=0, Total=992 [2022-01-10 06:46:02,670 INFO L933 BasicCegarLoop]: 1078 mSDtfsCounter, 1199 mSDsluCounter, 7200 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 8278 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 06:46:02,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1274 Valid, 8278 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 06:46:02,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11390 states. [2022-01-10 06:46:03,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11390 to 6014. [2022-01-10 06:46:03,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6014 states, 4656 states have (on average 1.262242268041237) internal successors, (5877), 4686 states have internal predecessors, (5877), 833 states have call successors, (833), 524 states have call predecessors, (833), 524 states have return successors, (833), 803 states have call predecessors, (833), 833 states have call successors, (833) [2022-01-10 06:46:03,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6014 states to 6014 states and 7543 transitions. [2022-01-10 06:46:03,105 INFO L78 Accepts]: Start accepts. Automaton has 6014 states and 7543 transitions. Word has length 211 [2022-01-10 06:46:03,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:46:03,105 INFO L470 AbstractCegarLoop]: Abstraction has 6014 states and 7543 transitions. [2022-01-10 06:46:03,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.916666666666668) internal successors, (251), 12 states have internal predecessors, (251), 6 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (33), 6 states have call predecessors, (33), 6 states have call successors, (33) [2022-01-10 06:46:03,106 INFO L276 IsEmpty]: Start isEmpty. Operand 6014 states and 7543 transitions. [2022-01-10 06:46:03,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-01-10 06:46:03,114 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:46:03,114 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:46:03,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-01-10 06:46:03,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:46:03,322 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:46:03,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:46:03,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1553786751, now seen corresponding path program 1 times [2022-01-10 06:46:03,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:46:03,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129573226] [2022-01-10 06:46:03,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:46:03,323 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:46:03,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:46:03,324 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:46:03,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-01-10 06:46:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:46:03,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:46:03,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:46:03,724 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-01-10 06:46:03,724 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:46:03,724 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:46:03,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1129573226] [2022-01-10 06:46:03,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1129573226] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:46:03,724 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:46:03,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:46:03,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217097877] [2022-01-10 06:46:03,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:46:03,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:46:03,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:46:03,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:46:03,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:46:03,725 INFO L87 Difference]: Start difference. First operand 6014 states and 7543 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-01-10 06:46:04,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:46:04,089 INFO L93 Difference]: Finished difference Result 9872 states and 12537 transitions. [2022-01-10 06:46:04,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:46:04,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 211 [2022-01-10 06:46:04,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:46:04,098 INFO L225 Difference]: With dead ends: 9872 [2022-01-10 06:46:04,098 INFO L226 Difference]: Without dead ends: 4345 [2022-01-10 06:46:04,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:46:04,106 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 281 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:46:04,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 467 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:46:04,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4345 states. [2022-01-10 06:46:04,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4345 to 4345. [2022-01-10 06:46:04,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4345 states, 3390 states have (on average 1.271976401179941) internal successors, (4312), 3411 states have internal predecessors, (4312), 587 states have call successors, (587), 367 states have call predecessors, (587), 367 states have return successors, (587), 566 states have call predecessors, (587), 587 states have call successors, (587) [2022-01-10 06:46:04,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4345 states to 4345 states and 5486 transitions. [2022-01-10 06:46:04,424 INFO L78 Accepts]: Start accepts. Automaton has 4345 states and 5486 transitions. Word has length 211 [2022-01-10 06:46:04,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:46:04,424 INFO L470 AbstractCegarLoop]: Abstraction has 4345 states and 5486 transitions. [2022-01-10 06:46:04,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-01-10 06:46:04,424 INFO L276 IsEmpty]: Start isEmpty. Operand 4345 states and 5486 transitions. [2022-01-10 06:46:04,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-01-10 06:46:04,430 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:46:04,430 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:46:04,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-01-10 06:46:04,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:46:04,637 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:46:04,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:46:04,637 INFO L85 PathProgramCache]: Analyzing trace with hash 13361221, now seen corresponding path program 1 times [2022-01-10 06:46:04,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:46:04,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1063025178] [2022-01-10 06:46:04,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:46:04,638 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:46:04,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:46:04,639 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:46:04,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-01-10 06:46:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 06:46:04,773 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 06:46:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 06:46:05,094 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-01-10 06:46:05,094 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 06:46:05,095 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 06:46:05,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2022-01-10 06:46:05,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:46:05,306 INFO L732 BasicCegarLoop]: Path program 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] [2022-01-10 06:46:05,308 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 06:46:05,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:46:05 BoogieIcfgContainer [2022-01-10 06:46:05,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 06:46:05,450 INFO L158 Benchmark]: Toolchain (without parser) took 37300.56ms. Allocated memory was 209.7MB in the beginning and 822.1MB in the end (delta: 612.4MB). Free memory was 157.5MB in the beginning and 491.6MB in the end (delta: -334.1MB). Peak memory consumption was 279.1MB. Max. memory is 8.0GB. [2022-01-10 06:46:05,451 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 209.7MB. Free memory was 174.5MB in the beginning and 174.3MB in the end (delta: 132.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 06:46:05,451 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.33ms. Allocated memory is still 209.7MB. Free memory was 157.3MB in the beginning and 172.6MB in the end (delta: -15.4MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. [2022-01-10 06:46:05,451 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.66ms. Allocated memory is still 209.7MB. Free memory was 172.6MB in the beginning and 169.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 06:46:05,454 INFO L158 Benchmark]: Boogie Preprocessor took 31.56ms. Allocated memory is still 209.7MB. Free memory was 169.5MB in the beginning and 166.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 06:46:05,455 INFO L158 Benchmark]: RCFGBuilder took 513.81ms. Allocated memory is still 209.7MB. Free memory was 166.9MB in the beginning and 139.6MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-01-10 06:46:05,456 INFO L158 Benchmark]: TraceAbstraction took 36397.50ms. Allocated memory was 209.7MB in the beginning and 822.1MB in the end (delta: 612.4MB). Free memory was 139.1MB in the beginning and 491.6MB in the end (delta: -352.5MB). Peak memory consumption was 260.7MB. Max. memory is 8.0GB. [2022-01-10 06:46:05,456 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.11ms. Allocated memory is still 209.7MB. Free memory was 174.5MB in the beginning and 174.3MB in the end (delta: 132.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 314.33ms. Allocated memory is still 209.7MB. Free memory was 157.3MB in the beginning and 172.6MB in the end (delta: -15.4MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.66ms. Allocated memory is still 209.7MB. Free memory was 172.6MB in the beginning and 169.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.56ms. Allocated memory is still 209.7MB. Free memory was 169.5MB in the beginning and 166.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 513.81ms. Allocated memory is still 209.7MB. Free memory was 166.9MB in the beginning and 139.6MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 36397.50ms. Allocated memory was 209.7MB in the beginning and 822.1MB in the end (delta: 612.4MB). Free memory was 139.1MB in the beginning and 491.6MB in the end (delta: -352.5MB). Peak memory consumption was 260.7MB. 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: 611]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L534] int c1 ; [L535] int i2 ; [L538] c1 = 0 [L539] side1Failed = __VERIFIER_nondet_bool() [L540] side2Failed = __VERIFIER_nondet_bool() [L541] side1_written = __VERIFIER_nondet_char() [L542] side2_written = __VERIFIER_nondet_char() [L543] side1Failed_History_0 = __VERIFIER_nondet_bool() [L544] side1Failed_History_1 = __VERIFIER_nondet_bool() [L545] side1Failed_History_2 = __VERIFIER_nondet_bool() [L546] side2Failed_History_0 = __VERIFIER_nondet_bool() [L547] side2Failed_History_1 = __VERIFIER_nondet_bool() [L548] side2Failed_History_2 = __VERIFIER_nondet_bool() [L549] active_side_History_0 = __VERIFIER_nondet_char() [L550] active_side_History_1 = __VERIFIER_nondet_char() [L551] active_side_History_2 = __VERIFIER_nondet_char() [L552] manual_selection_History_0 = __VERIFIER_nondet_char() [L553] manual_selection_History_1 = __VERIFIER_nondet_char() [L554] manual_selection_History_2 = __VERIFIER_nondet_char() [L555] CALL, EXPR init() [L197] COND FALSE !((int )side1Failed_History_0 != 0) VAL [cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0] [L200] COND FALSE !((int )side2Failed_History_0 != 0) VAL [cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side2Failed_History_0=0] [L203] COND FALSE !((int )active_side_History_0 != -2) VAL [active_side_History_0=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side2Failed_History_0=0] [L206] COND FALSE !((int )manual_selection_History_0 != 0) VAL [active_side_History_0=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side2Failed_History_0=0] [L209] COND FALSE !((int )side1Failed_History_1 != 0) VAL [active_side_History_0=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side2Failed_History_0=0] [L212] COND FALSE !((int )side2Failed_History_1 != 0) VAL [active_side_History_0=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side2Failed_History_0=0, side2Failed_History_1=0] [L215] COND FALSE !((int )active_side_History_1 != -2) VAL [active_side_History_0=254, active_side_History_1=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side2Failed_History_0=0, side2Failed_History_1=0] [L218] COND FALSE !((int )manual_selection_History_1 != 0) VAL [active_side_History_0=254, active_side_History_1=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side2Failed_History_0=0, side2Failed_History_1=0] [L221] COND FALSE !((int )side1Failed_History_2 != 0) VAL [active_side_History_0=254, active_side_History_1=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2Failed_History_0=0, side2Failed_History_1=0] [L224] COND FALSE !((int )side2Failed_History_2 != 0) VAL [active_side_History_0=254, active_side_History_1=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L227] COND FALSE !((int )active_side_History_2 != -2) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); VAL [\result=1, active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L555] RET, EXPR init() [L555] i2 = init() [L556] CALL assume_abort_if_not(i2) VAL [\old(cond)=1, active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cond=1, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L556] RET assume_abort_if_not(i2) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, c1=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L557] cs1_old = nomsg [L558] cs1_new = nomsg [L559] cs2_old = nomsg [L560] cs2_new = nomsg [L561] s1s2_old = nomsg [L562] s1s2_new = nomsg [L563] s1s1_old = nomsg [L564] s1s1_new = nomsg [L565] s2s1_old = nomsg [L566] s2s1_new = nomsg [L567] s2s2_old = nomsg [L568] s2s2_new = nomsg [L569] s1p_old = nomsg [L570] s1p_new = nomsg [L571] s2p_old = nomsg [L572] s2p_new = nomsg [L573] i2 = 0 VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, c1=0, cs1=0, cs1_new=255, cs1_old=255, cs2=0, cs2_new=255, cs2_old=255, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L574] COND TRUE i2 < 10 [L576] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val VAL [\old(val)=128, active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=255, cs2=0, cs2_new=255, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=128] [L257] RET write_manual_selection_history(manual_selection) [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=255, cs2=0, cs2_new=255, cs2_old=255, manual_selection=128, manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new=-128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=128] [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=255, cs2_old=255, manual_selection=128, manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new=-128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=128] [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection=0, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=128] [L576] RET Console_task_each_pals_period() [L577] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [\old(val)=128, active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=128] [L276] RET write_side1_failed_history(side1Failed) [L277] COND TRUE \read(side1Failed) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection=0, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2=255, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] EXPR nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection=0, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new=-1, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2=255, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] EXPR nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection=0, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new=-1, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2=255, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] EXPR nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection=0, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new=-1, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2=255, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = nomsg VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection=0, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2=255, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L577] RET Side1_activestandby_task_each_pals_period() [L578] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [\old(val)=0, active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2=255, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )0 VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2=255, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2=255, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2=255, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=0, s2s2_old=255, side1=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2=255, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=0, s2s2_old=255, side1=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2=255, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L578] RET Side2_activestandby_task_each_pals_period() [L579] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=-2, active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, index=0, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, read_active_side_history((unsigned char)0)=-2, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side=254, active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=0, s2s2_old=255, side1=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2=255, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=254] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=254, active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=0, s2s2_old=255, side1=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2=255, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=254] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=254, active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=0, s2s2_old=255, side1=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2=255, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=254] [L400] COND FALSE !((int )side1 == 0) [L407] active_side = (int8_t )0 VAL [active_side=0, active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=0, s2s2_old=255, side1=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2=255, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=254] [L409] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L409] RET write_active_side_history(active_side) [L579] RET Pendulum_prism_task_each_pals_period() [L580] cs1_old = cs1_new [L581] cs1_new = nomsg [L582] cs2_old = cs2_new [L583] cs2_new = nomsg [L584] s1s2_old = s1s2_new [L585] s1s2_new = nomsg [L586] s1s1_old = s1s1_new [L587] s1s1_new = nomsg [L588] s2s1_old = s2s1_new [L589] s2s1_new = nomsg [L590] s2s2_old = s2s2_new [L591] s2s2_new = nomsg [L592] s1p_old = s1p_new [L593] s1p_new = nomsg [L594] s2p_old = s2p_new [L595] s2p_new = nomsg [L596] CALL, EXPR check() [L415] int tmp ; [L416] msg_t tmp___0 ; [L417] _Bool tmp___1 ; [L418] _Bool tmp___2 ; [L419] _Bool tmp___3 ; [L420] _Bool tmp___4 ; [L421] int8_t tmp___5 ; [L422] _Bool tmp___6 ; [L423] _Bool tmp___7 ; [L424] _Bool tmp___8 ; [L425] int8_t tmp___9 ; [L426] _Bool tmp___10 ; [L427] _Bool tmp___11 ; [L428] _Bool tmp___12 ; [L429] msg_t tmp___13 ; [L430] _Bool tmp___14 ; [L431] _Bool tmp___15 ; [L432] _Bool tmp___16 ; [L433] _Bool tmp___17 ; [L434] int8_t tmp___18 ; [L435] int8_t tmp___19 ; [L436] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L439] COND FALSE !(! side1Failed) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L442] COND TRUE ! side2Failed [L443] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L447] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cond=1, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L447] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L448] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, index=1, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, index=1, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L448] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, read_manual_selection_history((unsigned char)1)=0, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L448] tmp___0 = read_manual_selection_history((unsigned char)1) [L449] COND TRUE ! tmp___0 VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L450] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, index=1, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, index=1, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L450] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L450] tmp___1 = read_side1_failed_history((unsigned char)1) [L451] COND TRUE ! tmp___1 VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L452] CALL, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [\old(index)=0, \result=-128, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, index=0, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L452] RET, EXPR read_side1_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, read_side1_failed_history((unsigned char)0)=-128, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L452] tmp___2 = read_side1_failed_history((unsigned char)0) [L453] COND FALSE !(! tmp___2) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=128] [L478] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, index=1, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, index=1, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L478] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=128] [L478] tmp___7 = read_side1_failed_history((unsigned char)1) [L479] COND FALSE !(\read(tmp___7)) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=128, tmp___7=0] [L494] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, index=1, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, index=1, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L494] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=128, tmp___7=0] [L494] tmp___11 = read_side1_failed_history((unsigned char)1) [L495] COND TRUE ! tmp___11 VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___2=128, tmp___7=0] [L496] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, index=1, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, index=1, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L496] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___2=128, tmp___7=0] [L496] tmp___12 = read_side2_failed_history((unsigned char)1) [L497] COND FALSE !(\read(tmp___12)) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=128, tmp___7=0] [L510] CALL, EXPR read_active_side_history((unsigned char)2) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND FALSE !((int )index == 0) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, index=2, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L151] COND FALSE !((int )index == 1) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, index=2, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L154] COND TRUE (int )index == 2 [L155] return (active_side_History_2); VAL [\old(index)=2, \result=-2, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, index=2, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L510] RET, EXPR read_active_side_history((unsigned char)2) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, read_active_side_history((unsigned char)2)=-2, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=128, tmp___7=0] [L510] tmp___20 = read_active_side_history((unsigned char)2) [L511] COND FALSE !((int )tmp___20 > -2) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=128, tmp___20=254, tmp___7=0] [L529] return (1); VAL [\result=1, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=128, tmp___20=254, tmp___7=0] [L596] RET, EXPR check() [L596] c1 = check() [L597] CALL assert(c1) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L609] COND FALSE !(! arg) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, arg=1, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L597] RET assert(c1) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, c1=1, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, i2=0, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L598] i2 ++ VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, c1=1, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, i2=1, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L574] COND TRUE i2 < 10 [L576] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L257] RET write_manual_selection_history(manual_selection) [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection=0, manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection=0, manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=0, cs2_old=128, manual_selection=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L576] RET Console_task_each_pals_period() [L577] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L276] RET write_side1_failed_history(side1Failed) [L277] COND FALSE !(\read(side1Failed)) [L284] side1 = s1s1_old [L285] s1s1_old = nomsg [L286] side2 = s2s1_old [L287] s2s1_old = nomsg [L288] manual_selection = cs1_old [L289] cs1_old = nomsg VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1=255, side1_written=255, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L290] COND FALSE !((int )side1 == (int )side2) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1=255, side1_written=255, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L293] COND TRUE (int )side1 == (int )nomsg VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1=255, side1_written=255, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L294] COND TRUE (int )side2 != (int )nomsg [L295] next_state = (int8_t )0 VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, next_state=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1=255, side1_written=255, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L314] EXPR next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, next_state=0, next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1=255, side1_written=255, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L314] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L315] EXPR next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, next_state=0, next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1=255, side1_written=255, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L315] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L316] EXPR next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, next_state=0, next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1=255, side1_written=255, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L316] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L317] side1_written = next_state VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, next_state=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L577] RET Side1_activestandby_task_each_pals_period() [L578] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [\old(val)=128, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0, val=128] [L333] RET write_side2_failed_history(side2Failed) [L334] COND TRUE \read(side2Failed) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2=255, side2_written=0, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L335] EXPR nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new=-1, s1p=0, s1p_new=0, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2=255, side2_written=0, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L335] s2s1_new = nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new [L336] EXPR nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new=-1, s1p=0, s1p_new=0, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2=255, side2_written=0, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L336] s2s2_new = nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new [L337] EXPR nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new=-1, s1p=0, s1p_new=0, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2=255, side2_written=0, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L337] s2p_new = nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new [L338] side2_written = nomsg VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2=255, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L578] RET Side2_activestandby_task_each_pals_period() [L579] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, index=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, read_active_side_history((unsigned char)0)=0, s1p=0, s1p_new=0, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side=0, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=0, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=0, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L400] COND FALSE !((int )side1 == 0) [L407] active_side = (int8_t )0 VAL [active_side=0, active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L409] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L409] RET write_active_side_history(active_side) [L579] RET Pendulum_prism_task_each_pals_period() [L580] cs1_old = cs1_new [L581] cs1_new = nomsg [L582] cs2_old = cs2_new [L583] cs2_new = nomsg [L584] s1s2_old = s1s2_new [L585] s1s2_new = nomsg [L586] s1s1_old = s1s1_new [L587] s1s1_new = nomsg [L588] s2s1_old = s2s1_new [L589] s2s1_new = nomsg [L590] s2s2_old = s2s2_new [L591] s2s2_new = nomsg [L592] s1p_old = s1p_new [L593] s1p_new = nomsg [L594] s2p_old = s2p_new [L595] s2p_new = nomsg [L596] CALL, EXPR check() [L415] int tmp ; [L416] msg_t tmp___0 ; [L417] _Bool tmp___1 ; [L418] _Bool tmp___2 ; [L419] _Bool tmp___3 ; [L420] _Bool tmp___4 ; [L421] int8_t tmp___5 ; [L422] _Bool tmp___6 ; [L423] _Bool tmp___7 ; [L424] _Bool tmp___8 ; [L425] int8_t tmp___9 ; [L426] _Bool tmp___10 ; [L427] _Bool tmp___11 ; [L428] _Bool tmp___12 ; [L429] msg_t tmp___13 ; [L430] _Bool tmp___14 ; [L431] _Bool tmp___15 ; [L432] _Bool tmp___16 ; [L433] _Bool tmp___17 ; [L434] int8_t tmp___18 ; [L435] int8_t tmp___19 ; [L436] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L439] COND TRUE ! side1Failed [L440] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L447] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cond=1, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L447] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L448] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, index=1, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=-128, active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, index=1, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L448] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, read_manual_selection_history((unsigned char)1)=-128, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L448] tmp___0 = read_manual_selection_history((unsigned char)1) [L449] COND FALSE !(! tmp___0) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=128] [L478] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, index=1, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=-128, active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, index=1, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L478] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, read_side1_failed_history((unsigned char)1)=-128, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=128] [L478] tmp___7 = read_side1_failed_history((unsigned char)1) [L479] COND TRUE \read(tmp___7) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=128, tmp___7=128] [L480] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, index=1, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, index=1, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L480] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=128, tmp___7=128] [L480] tmp___8 = read_side2_failed_history((unsigned char)1) [L481] COND TRUE ! tmp___8 VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=128, tmp___7=128, tmp___8=0] [L482] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, index=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L482] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, read_active_side_history((unsigned char)0)=0, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=128, tmp___7=128, tmp___8=0] [L482] tmp___5 = read_active_side_history((unsigned char)0) [L483] COND TRUE ! ((int )tmp___5 == 2) [L484] return (0); VAL [\result=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=128, tmp___5=0, tmp___7=128, tmp___8=0] [L596] RET, EXPR check() [L596] c1 = check() [L597] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L609] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, arg=0, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L611] reach_error() VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, arg=0, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 205 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.2s, OverallIterations: 34, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19424 SdHoareTripleChecker+Valid, 7.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19200 mSDsluCounter, 59194 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45832 mSDsCounter, 5186 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11670 IncrementalHoareTripleChecker+Invalid, 16856 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5186 mSolverCounterUnsat, 13362 mSDtfsCounter, 11670 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5426 GetRequests, 5062 SyntacticMatches, 17 SemanticMatches, 347 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2637 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6014occurred in iteration=32, InterpolantAutomatonStates: 336, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 33 MinimizatonAttempts, 17156 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 3928 NumberOfCodeBlocks, 3928 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 5186 ConstructedInterpolants, 0 QuantifiedInterpolants, 14328 SizeOfPredicates, 76 NumberOfNonLiveVariables, 9233 ConjunctsInSsa, 167 ConjunctsInUnsatCore, 43 InterpolantComputations, 28 PerfectInterpolantSequences, 1503/1669 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 06:46:05,501 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...