/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.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 06:45:28,947 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 06:45:28,948 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 06:45:29,007 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 06:45:29,011 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 06:45:29,014 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 06:45:29,018 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 06:45:29,024 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 06:45:29,025 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 06:45:29,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 06:45:29,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 06:45:29,028 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 06:45:29,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 06:45:29,029 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 06:45:29,030 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 06:45:29,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 06:45:29,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 06:45:29,032 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 06:45:29,033 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 06:45:29,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 06:45:29,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 06:45:29,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 06:45:29,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 06:45:29,048 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 06:45:29,056 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 06:45:29,056 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 06:45:29,056 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 06:45:29,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 06:45:29,058 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 06:45:29,059 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 06:45:29,059 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 06:45:29,059 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 06:45:29,061 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 06:45:29,061 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 06:45:29,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 06:45:29,063 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 06:45:29,063 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 06:45:29,063 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 06:45:29,064 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 06:45:29,064 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 06:45:29,065 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 06:45:29,066 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:29,097 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 06:45:29,098 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 06:45:29,098 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 06:45:29,098 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 06:45:29,099 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 06:45:29,099 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 06:45:29,099 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 06:45:29,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 06:45:29,099 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 06:45:29,100 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 06:45:29,100 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 06:45:29,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 06:45:29,100 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 06:45:29,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 06:45:29,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 06:45:29,100 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 06:45:29,100 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 06:45:29,100 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 06:45:29,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 06:45:29,101 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 06:45:29,101 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 06:45:29,101 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 06:45:29,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 06:45:29,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:45:29,101 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 06:45:29,102 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 06:45:29,102 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 06:45:29,102 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 06:45:29,102 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 06:45:29,102 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 06:45:29,102 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 06:45:29,102 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 06:45:29,102 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 06:45:29,103 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:29,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 06:45:29,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 06:45:29,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 06:45:29,352 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 06:45:29,352 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 06:45:29,353 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.UNBOUNDED.pals.c [2022-01-10 06:45:29,463 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fa28e05b/3e68c7f3fdda4a9dbd4b8c20440a4068/FLAG7540590d9 [2022-01-10 06:45:29,852 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 06:45:29,853 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2022-01-10 06:45:29,866 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fa28e05b/3e68c7f3fdda4a9dbd4b8c20440a4068/FLAG7540590d9 [2022-01-10 06:45:30,212 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fa28e05b/3e68c7f3fdda4a9dbd4b8c20440a4068 [2022-01-10 06:45:30,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 06:45:30,215 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 06:45:30,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 06:45:30,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 06:45:30,219 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 06:45:30,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:45:30" (1/1) ... [2022-01-10 06:45:30,221 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ff8d631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:30, skipping insertion in model container [2022-01-10 06:45:30,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:45:30" (1/1) ... [2022-01-10 06:45:30,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 06:45:30,255 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 06:45:30,472 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.UNBOUNDED.pals.c[14522,14535] [2022-01-10 06:45:30,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:45:30,484 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 06:45:30,535 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.UNBOUNDED.pals.c[14522,14535] [2022-01-10 06:45:30,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:45:30,557 INFO L208 MainTranslator]: Completed translation [2022-01-10 06:45:30,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:30 WrapperNode [2022-01-10 06:45:30,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 06:45:30,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 06:45:30,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 06:45:30,559 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 06:45:30,565 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:30" (1/1) ... [2022-01-10 06:45:30,577 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:30" (1/1) ... [2022-01-10 06:45:30,603 INFO L137 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 509 [2022-01-10 06:45:30,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 06:45:30,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 06:45:30,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 06:45:30,604 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 06:45:30,612 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:30" (1/1) ... [2022-01-10 06:45:30,612 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:30" (1/1) ... [2022-01-10 06:45:30,617 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:30" (1/1) ... [2022-01-10 06:45:30,617 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:30" (1/1) ... [2022-01-10 06:45:30,627 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:30" (1/1) ... [2022-01-10 06:45:30,632 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:30" (1/1) ... [2022-01-10 06:45:30,635 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:30" (1/1) ... [2022-01-10 06:45:30,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 06:45:30,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 06:45:30,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 06:45:30,641 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 06:45:30,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:30" (1/1) ... [2022-01-10 06:45:30,660 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:45:30,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 06:45:30,682 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:30,683 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:30,712 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2022-01-10 06:45:30,713 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2022-01-10 06:45:30,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 06:45:30,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 06:45:30,713 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2022-01-10 06:45:30,713 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2022-01-10 06:45:30,713 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-01-10 06:45:30,714 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-01-10 06:45:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2022-01-10 06:45:30,715 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2022-01-10 06:45:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-10 06:45:30,715 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-10 06:45:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2022-01-10 06:45:30,716 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2022-01-10 06:45:30,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 06:45:30,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 06:45:30,716 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2022-01-10 06:45:30,716 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2022-01-10 06:45:30,879 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 06:45:30,881 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 06:45:31,363 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 06:45:31,371 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 06:45:31,372 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 06:45:31,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:45:31 BoogieIcfgContainer [2022-01-10 06:45:31,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 06:45:31,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 06:45:31,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 06:45:31,378 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 06:45:31,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:45:30" (1/3) ... [2022-01-10 06:45:31,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21cacf4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:45:31, skipping insertion in model container [2022-01-10 06:45:31,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:30" (2/3) ... [2022-01-10 06:45:31,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21cacf4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:45:31, skipping insertion in model container [2022-01-10 06:45:31,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:45:31" (3/3) ... [2022-01-10 06:45:31,381 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2022-01-10 06:45:31,385 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 06:45:31,385 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 06:45:31,437 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 06:45:31,444 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:31,444 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 06:45:31,477 INFO L276 IsEmpty]: Start isEmpty. Operand has 204 states, 164 states have (on average 1.548780487804878) internal successors, (254), 166 states have internal predecessors, (254), 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:31,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 06:45:31,486 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:31,486 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:31,487 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:31,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:31,492 INFO L85 PathProgramCache]: Analyzing trace with hash -753912551, now seen corresponding path program 1 times [2022-01-10 06:45:31,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:31,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87762698] [2022-01-10 06:45:31,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:31,505 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:31,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:31,511 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:31,548 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:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:31,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 06:45:31,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:31,781 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:31,781 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:31,782 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:31,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [87762698] [2022-01-10 06:45:31,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [87762698] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:31,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:31,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 06:45:31,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032210447] [2022-01-10 06:45:31,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:31,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 06:45:31,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:31,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 06:45:31,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 06:45:31,823 INFO L87 Difference]: Start difference. First operand has 204 states, 164 states have (on average 1.548780487804878) internal successors, (254), 166 states have internal predecessors, (254), 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:31,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:31,892 INFO L93 Difference]: Finished difference Result 388 states and 629 transitions. [2022-01-10 06:45:31,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 06:45:31,897 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:31,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:31,909 INFO L225 Difference]: With dead ends: 388 [2022-01-10 06:45:31,909 INFO L226 Difference]: Without dead ends: 200 [2022-01-10 06:45:31,917 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:31,923 INFO L933 BasicCegarLoop]: 303 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, 303 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:31,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 303 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:31,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-01-10 06:45:31,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2022-01-10 06:45:31,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 161 states have (on average 1.4968944099378882) internal successors, (241), 162 states have internal predecessors, (241), 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:31,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 303 transitions. [2022-01-10 06:45:31,978 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 303 transitions. Word has length 44 [2022-01-10 06:45:31,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:31,979 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 303 transitions. [2022-01-10 06:45:31,979 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:31,979 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 303 transitions. [2022-01-10 06:45:31,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 06:45:31,981 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:31,981 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:31,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-01-10 06:45:32,190 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:32,191 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:32,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:32,192 INFO L85 PathProgramCache]: Analyzing trace with hash -762678055, now seen corresponding path program 1 times [2022-01-10 06:45:32,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:32,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465408135] [2022-01-10 06:45:32,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:32,193 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:32,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:32,195 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:32,197 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:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:32,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 06:45:32,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:32,415 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:32,416 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:32,416 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:32,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465408135] [2022-01-10 06:45:32,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465408135] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:32,417 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:32,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 06:45:32,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783055195] [2022-01-10 06:45:32,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:32,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 06:45:32,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:32,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 06:45:32,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:45:32,420 INFO L87 Difference]: Start difference. First operand 200 states and 303 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:32,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:32,526 INFO L93 Difference]: Finished difference Result 386 states and 580 transitions. [2022-01-10 06:45:32,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 06:45:32,529 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:32,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:32,536 INFO L225 Difference]: With dead ends: 386 [2022-01-10 06:45:32,537 INFO L226 Difference]: Without dead ends: 200 [2022-01-10 06:45:32,538 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:32,540 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 167 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:32,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 1282 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:45:32,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-01-10 06:45:32,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2022-01-10 06:45:32,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 161 states have (on average 1.4223602484472049) internal successors, (229), 162 states have internal predecessors, (229), 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:32,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 291 transitions. [2022-01-10 06:45:32,583 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 291 transitions. Word has length 44 [2022-01-10 06:45:32,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:32,583 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 291 transitions. [2022-01-10 06:45:32,584 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:32,584 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 291 transitions. [2022-01-10 06:45:32,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 06:45:32,589 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:32,589 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:32,607 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:32,799 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:32,800 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:32,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:32,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1438178434, now seen corresponding path program 1 times [2022-01-10 06:45:32,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:32,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183663885] [2022-01-10 06:45:32,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:32,802 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:32,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:32,803 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:32,806 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:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:32,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 06:45:32,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:33,038 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:33,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:33,039 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:33,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183663885] [2022-01-10 06:45:33,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1183663885] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:33,039 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:33,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:45:33,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878026852] [2022-01-10 06:45:33,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:33,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:45:33,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:33,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:45:33,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:45:33,041 INFO L87 Difference]: Start difference. First operand 200 states and 291 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:33,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:33,085 INFO L93 Difference]: Finished difference Result 389 states and 575 transitions. [2022-01-10 06:45:33,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:45:33,085 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:33,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:33,089 INFO L225 Difference]: With dead ends: 389 [2022-01-10 06:45:33,089 INFO L226 Difference]: Without dead ends: 206 [2022-01-10 06:45:33,090 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:33,092 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 6 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 845 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:33,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 845 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:33,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-01-10 06:45:33,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2022-01-10 06:45:33,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 164 states have (on average 1.4146341463414633) internal successors, (232), 165 states have internal predecessors, (232), 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:33,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 294 transitions. [2022-01-10 06:45:33,122 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 294 transitions. Word has length 55 [2022-01-10 06:45:33,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:33,123 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 294 transitions. [2022-01-10 06:45:33,123 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:33,124 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 294 transitions. [2022-01-10 06:45:33,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-10 06:45:33,126 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:33,127 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:33,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 06:45:33,335 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:33,336 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:33,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:33,336 INFO L85 PathProgramCache]: Analyzing trace with hash -844326800, now seen corresponding path program 1 times [2022-01-10 06:45:33,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:33,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856377567] [2022-01-10 06:45:33,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:33,337 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:33,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:33,338 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:33,340 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:33,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:33,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:45:33,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:33,601 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:33,602 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:33,602 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:33,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856377567] [2022-01-10 06:45:33,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [856377567] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:33,602 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:33,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:45:33,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665317773] [2022-01-10 06:45:33,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:33,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:45:33,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:33,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:45:33,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:45:33,604 INFO L87 Difference]: Start difference. First operand 204 states and 294 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:33,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:33,918 INFO L93 Difference]: Finished difference Result 588 states and 869 transitions. [2022-01-10 06:45:33,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:45:33,919 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:33,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:33,926 INFO L225 Difference]: With dead ends: 588 [2022-01-10 06:45:33,926 INFO L226 Difference]: Without dead ends: 401 [2022-01-10 06:45:33,927 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:33,928 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 760 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 773 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:33,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [760 Valid, 773 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:33,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2022-01-10 06:45:33,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 271. [2022-01-10 06:45:33,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 226 states have (on average 1.407079646017699) internal successors, (318), 226 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:33,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 386 transitions. [2022-01-10 06:45:33,945 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 386 transitions. Word has length 71 [2022-01-10 06:45:33,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:33,946 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 386 transitions. [2022-01-10 06:45:33,946 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:33,946 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 386 transitions. [2022-01-10 06:45:33,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-10 06:45:33,947 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:33,947 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:33,958 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:34,156 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:34,156 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:34,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:34,157 INFO L85 PathProgramCache]: Analyzing trace with hash 786827451, now seen corresponding path program 1 times [2022-01-10 06:45:34,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:34,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949523690] [2022-01-10 06:45:34,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:34,158 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:34,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:34,159 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:34,160 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:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:34,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:45:34,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:34,453 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:34,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:34,454 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:34,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949523690] [2022-01-10 06:45:34,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1949523690] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:34,454 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:34,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:45:34,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564569640] [2022-01-10 06:45:34,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:34,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:45:34,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:34,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:45:34,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:45:34,457 INFO L87 Difference]: Start difference. First operand 271 states and 386 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:34,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:34,750 INFO L93 Difference]: Finished difference Result 588 states and 867 transitions. [2022-01-10 06:45:34,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:45:34,750 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:34,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:34,754 INFO L225 Difference]: With dead ends: 588 [2022-01-10 06:45:34,755 INFO L226 Difference]: Without dead ends: 401 [2022-01-10 06:45:34,756 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:34,757 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 756 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 776 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:34,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [756 Valid, 776 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:34,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2022-01-10 06:45:34,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 271. [2022-01-10 06:45:34,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 226 states have (on average 1.4026548672566372) internal successors, (317), 226 states have internal predecessors, (317), 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:34,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 385 transitions. [2022-01-10 06:45:34,787 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 385 transitions. Word has length 72 [2022-01-10 06:45:34,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:34,790 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 385 transitions. [2022-01-10 06:45:34,790 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:34,790 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 385 transitions. [2022-01-10 06:45:34,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-10 06:45:34,791 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:34,791 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:34,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 06:45:35,000 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:35,001 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:35,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:35,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1719769245, now seen corresponding path program 1 times [2022-01-10 06:45:35,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:35,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [751519970] [2022-01-10 06:45:35,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:35,002 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:35,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:35,003 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:35,005 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:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:35,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 06:45:35,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:35,227 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:35,227 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:35,227 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:35,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [751519970] [2022-01-10 06:45:35,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [751519970] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:35,228 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:35,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:45:35,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546726505] [2022-01-10 06:45:35,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:35,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:45:35,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:35,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:45:35,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:45:35,229 INFO L87 Difference]: Start difference. First operand 271 states and 385 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:35,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:35,265 INFO L93 Difference]: Finished difference Result 660 states and 951 transitions. [2022-01-10 06:45:35,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:45:35,265 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:35,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:35,270 INFO L225 Difference]: With dead ends: 660 [2022-01-10 06:45:35,270 INFO L226 Difference]: Without dead ends: 473 [2022-01-10 06:45:35,271 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:35,274 INFO L933 BasicCegarLoop]: 336 mSDtfsCounter, 216 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 612 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:35,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 612 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:35,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2022-01-10 06:45:35,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 464. [2022-01-10 06:45:35,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 378 states have (on average 1.4126984126984128) internal successors, (534), 379 states have internal predecessors, (534), 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:35,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 664 transitions. [2022-01-10 06:45:35,309 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 664 transitions. Word has length 73 [2022-01-10 06:45:35,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:35,309 INFO L470 AbstractCegarLoop]: Abstraction has 464 states and 664 transitions. [2022-01-10 06:45:35,309 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:35,309 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 664 transitions. [2022-01-10 06:45:35,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-01-10 06:45:35,311 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:35,312 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:35,325 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:35,521 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:35,521 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:35,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:35,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1107494047, now seen corresponding path program 1 times [2022-01-10 06:45:35,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:35,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [77245483] [2022-01-10 06:45:35,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:35,523 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:35,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:35,524 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:35,524 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:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:35,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 06:45:35,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:35,732 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:35,732 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:35,733 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:35,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [77245483] [2022-01-10 06:45:35,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [77245483] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:35,733 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:35,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:45:35,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627085956] [2022-01-10 06:45:35,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:35,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:45:35,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:35,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:45:35,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:45:35,734 INFO L87 Difference]: Start difference. First operand 464 states and 664 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:35,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:35,778 INFO L93 Difference]: Finished difference Result 1119 states and 1625 transitions. [2022-01-10 06:45:35,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:45:35,779 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:35,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:35,783 INFO L225 Difference]: With dead ends: 1119 [2022-01-10 06:45:35,784 INFO L226 Difference]: Without dead ends: 777 [2022-01-10 06:45:35,785 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:35,786 INFO L933 BasicCegarLoop]: 369 mSDtfsCounter, 224 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 647 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:35,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 647 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:35,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2022-01-10 06:45:35,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 760. [2022-01-10 06:45:35,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 598 states have (on average 1.4230769230769231) internal successors, (851), 601 states have internal predecessors, (851), 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:35,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1099 transitions. [2022-01-10 06:45:35,833 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1099 transitions. Word has length 74 [2022-01-10 06:45:35,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:35,834 INFO L470 AbstractCegarLoop]: Abstraction has 760 states and 1099 transitions. [2022-01-10 06:45:35,834 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:35,834 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1099 transitions. [2022-01-10 06:45:35,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-01-10 06:45:35,835 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:35,835 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:35,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 06:45:36,046 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:36,047 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:36,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:36,048 INFO L85 PathProgramCache]: Analyzing trace with hash -172369631, now seen corresponding path program 1 times [2022-01-10 06:45:36,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:36,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176230637] [2022-01-10 06:45:36,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:36,048 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:36,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:36,049 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:36,050 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:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:36,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:45:36,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:36,253 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:36,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:36,253 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:36,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176230637] [2022-01-10 06:45:36,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176230637] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:36,254 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:36,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 06:45:36,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90277262] [2022-01-10 06:45:36,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:36,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:45:36,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:36,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:45:36,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:45:36,255 INFO L87 Difference]: Start difference. First operand 760 states and 1099 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:36,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:36,306 INFO L93 Difference]: Finished difference Result 1271 states and 1853 transitions. [2022-01-10 06:45:36,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:45:36,307 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:36,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:36,310 INFO L225 Difference]: With dead ends: 1271 [2022-01-10 06:45:36,311 INFO L226 Difference]: Without dead ends: 610 [2022-01-10 06:45:36,312 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:36,313 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 2 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1140 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:36,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1140 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:36,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-01-10 06:45:36,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2022-01-10 06:45:36,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 485 states have (on average 1.4247422680412372) internal successors, (691), 487 states have internal predecessors, (691), 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:36,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 881 transitions. [2022-01-10 06:45:36,354 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 881 transitions. Word has length 74 [2022-01-10 06:45:36,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:36,355 INFO L470 AbstractCegarLoop]: Abstraction has 610 states and 881 transitions. [2022-01-10 06:45:36,355 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:36,355 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 881 transitions. [2022-01-10 06:45:36,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-01-10 06:45:36,356 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:36,356 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:36,367 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:36,567 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:36,568 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:36,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:36,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1075573198, now seen corresponding path program 1 times [2022-01-10 06:45:36,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:36,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229544205] [2022-01-10 06:45:36,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:36,569 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:36,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:36,570 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:36,571 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:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:36,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 06:45:36,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:36,801 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:36,801 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:36,801 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:36,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229544205] [2022-01-10 06:45:36,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229544205] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:36,802 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:36,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:45:36,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736078689] [2022-01-10 06:45:36,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:36,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:45:36,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:36,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:45:36,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:45:36,804 INFO L87 Difference]: Start difference. First operand 610 states and 881 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:36,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:36,845 INFO L93 Difference]: Finished difference Result 1115 states and 1628 transitions. [2022-01-10 06:45:36,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:45:36,846 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:36,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:36,850 INFO L225 Difference]: With dead ends: 1115 [2022-01-10 06:45:36,851 INFO L226 Difference]: Without dead ends: 631 [2022-01-10 06:45:36,852 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:36,854 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 7 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 858 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:36,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 858 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:36,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2022-01-10 06:45:36,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 625. [2022-01-10 06:45:36,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 497 states have (on average 1.414486921529175) internal successors, (703), 499 states have internal predecessors, (703), 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:36,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 893 transitions. [2022-01-10 06:45:36,884 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 893 transitions. Word has length 74 [2022-01-10 06:45:36,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:36,884 INFO L470 AbstractCegarLoop]: Abstraction has 625 states and 893 transitions. [2022-01-10 06:45:36,885 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:36,885 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 893 transitions. [2022-01-10 06:45:36,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-10 06:45:36,886 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:36,886 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:36,897 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:37,094 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:37,095 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:37,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:37,095 INFO L85 PathProgramCache]: Analyzing trace with hash 128621081, now seen corresponding path program 1 times [2022-01-10 06:45:37,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:37,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [905973212] [2022-01-10 06:45:37,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:37,096 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:37,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:37,097 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:37,098 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:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:37,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:45:37,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:37,414 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:37,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:45:37,620 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:37,620 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:37,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [905973212] [2022-01-10 06:45:37,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [905973212] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 06:45:37,620 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 06:45:37,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2022-01-10 06:45:37,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534964147] [2022-01-10 06:45:37,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:37,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 06:45:37,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:37,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 06:45:37,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-10 06:45:37,622 INFO L87 Difference]: Start difference. First operand 625 states and 893 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:37,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:37,885 INFO L93 Difference]: Finished difference Result 1785 states and 2617 transitions. [2022-01-10 06:45:37,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 06:45:37,885 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:37,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:37,908 INFO L225 Difference]: With dead ends: 1785 [2022-01-10 06:45:37,908 INFO L226 Difference]: Without dead ends: 1286 [2022-01-10 06:45:37,909 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:37,910 INFO L933 BasicCegarLoop]: 399 mSDtfsCounter, 449 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 2156 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.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:37,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [474 Valid, 2156 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:45:37,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2022-01-10 06:45:37,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 884. [2022-01-10 06:45:37,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 685 states have (on average 1.4131386861313868) internal successors, (968), 689 states have internal predecessors, (968), 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:37,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1266 transitions. [2022-01-10 06:45:37,954 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1266 transitions. Word has length 82 [2022-01-10 06:45:37,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:37,954 INFO L470 AbstractCegarLoop]: Abstraction has 884 states and 1266 transitions. [2022-01-10 06:45:37,954 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:37,954 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1266 transitions. [2022-01-10 06:45:37,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-10 06:45:37,955 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:37,955 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:37,965 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:38,164 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:38,164 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:38,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:38,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1984857844, now seen corresponding path program 1 times [2022-01-10 06:45:38,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:38,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [316068984] [2022-01-10 06:45:38,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:38,165 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:38,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:38,167 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:38,167 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:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:38,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 06:45:38,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:38,374 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:38,374 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:38,374 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:38,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [316068984] [2022-01-10 06:45:38,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [316068984] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:38,375 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:38,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:45:38,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785566411] [2022-01-10 06:45:38,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:38,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:45:38,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:38,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:45:38,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:45:38,376 INFO L87 Difference]: Start difference. First operand 884 states and 1266 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:38,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:38,432 INFO L93 Difference]: Finished difference Result 1632 states and 2394 transitions. [2022-01-10 06:45:38,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:45:38,433 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:38,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:38,437 INFO L225 Difference]: With dead ends: 1632 [2022-01-10 06:45:38,437 INFO L226 Difference]: Without dead ends: 919 [2022-01-10 06:45:38,439 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:38,440 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 7 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 850 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:38,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 850 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:38,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2022-01-10 06:45:38,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 909. [2022-01-10 06:45:38,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 705 states have (on average 1.401418439716312) internal successors, (988), 709 states have internal predecessors, (988), 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:38,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1286 transitions. [2022-01-10 06:45:38,481 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1286 transitions. Word has length 82 [2022-01-10 06:45:38,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:38,481 INFO L470 AbstractCegarLoop]: Abstraction has 909 states and 1286 transitions. [2022-01-10 06:45:38,481 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:38,481 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1286 transitions. [2022-01-10 06:45:38,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-01-10 06:45:38,482 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:38,482 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:38,491 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:38,691 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:38,691 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:38,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:38,692 INFO L85 PathProgramCache]: Analyzing trace with hash -128918338, now seen corresponding path program 1 times [2022-01-10 06:45:38,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:38,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829002593] [2022-01-10 06:45:38,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:38,693 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:38,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:38,694 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:38,696 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:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:38,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 06:45:38,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:38,949 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:38,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:38,950 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:38,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [829002593] [2022-01-10 06:45:38,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [829002593] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:38,950 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:38,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:45:38,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259294514] [2022-01-10 06:45:38,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:38,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:45:38,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:38,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:45:38,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:45:38,952 INFO L87 Difference]: Start difference. First operand 909 states and 1286 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:39,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:39,005 INFO L93 Difference]: Finished difference Result 1671 states and 2394 transitions. [2022-01-10 06:45:39,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:45:39,006 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:39,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:39,011 INFO L225 Difference]: With dead ends: 1671 [2022-01-10 06:45:39,011 INFO L226 Difference]: Without dead ends: 939 [2022-01-10 06:45:39,028 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:39,029 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 6 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 850 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:39,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 850 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:39,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2022-01-10 06:45:39,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 929. [2022-01-10 06:45:39,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 720 states have (on average 1.3930555555555555) internal successors, (1003), 724 states have internal predecessors, (1003), 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:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1301 transitions. [2022-01-10 06:45:39,079 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1301 transitions. Word has length 90 [2022-01-10 06:45:39,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:39,079 INFO L470 AbstractCegarLoop]: Abstraction has 929 states and 1301 transitions. [2022-01-10 06:45:39,079 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:39,079 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1301 transitions. [2022-01-10 06:45:39,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-01-10 06:45:39,083 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:39,083 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:39,091 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:39,291 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:39,292 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:39,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:39,292 INFO L85 PathProgramCache]: Analyzing trace with hash 188406696, now seen corresponding path program 1 times [2022-01-10 06:45:39,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:39,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204485385] [2022-01-10 06:45:39,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:39,293 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:39,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:39,294 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:39,295 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:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:39,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 06:45:39,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:39,524 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:39,524 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:39,524 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:39,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204485385] [2022-01-10 06:45:39,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204485385] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:39,525 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:39,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:45:39,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801508207] [2022-01-10 06:45:39,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:39,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:45:39,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:39,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:45:39,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:45:39,526 INFO L87 Difference]: Start difference. First operand 929 states and 1301 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:39,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:39,582 INFO L93 Difference]: Finished difference Result 1710 states and 2444 transitions. [2022-01-10 06:45:39,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:45:39,583 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:39,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:39,588 INFO L225 Difference]: With dead ends: 1710 [2022-01-10 06:45:39,588 INFO L226 Difference]: Without dead ends: 964 [2022-01-10 06:45:39,590 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:39,591 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 7 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 850 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:39,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 850 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:39,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2022-01-10 06:45:39,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 954. [2022-01-10 06:45:39,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 740 states have (on average 1.3824324324324324) internal successors, (1023), 744 states have internal predecessors, (1023), 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:39,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1321 transitions. [2022-01-10 06:45:39,633 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1321 transitions. Word has length 97 [2022-01-10 06:45:39,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:39,633 INFO L470 AbstractCegarLoop]: Abstraction has 954 states and 1321 transitions. [2022-01-10 06:45:39,634 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:39,634 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1321 transitions. [2022-01-10 06:45:39,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-10 06:45:39,635 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:39,635 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:39,644 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:39,844 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:39,844 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:39,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:39,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1204287246, now seen corresponding path program 1 times [2022-01-10 06:45:39,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:39,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657307869] [2022-01-10 06:45:39,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:39,845 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:39,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:39,846 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:39,847 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:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:39,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 06:45:39,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:40,095 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:40,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:40,095 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:40,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657307869] [2022-01-10 06:45:40,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1657307869] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:40,096 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:40,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:45:40,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738593693] [2022-01-10 06:45:40,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:40,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:45:40,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:40,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:45:40,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:45:40,097 INFO L87 Difference]: Start difference. First operand 954 states and 1321 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:40,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:40,151 INFO L93 Difference]: Finished difference Result 1749 states and 2444 transitions. [2022-01-10 06:45:40,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:45:40,152 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:40,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:40,158 INFO L225 Difference]: With dead ends: 1749 [2022-01-10 06:45:40,158 INFO L226 Difference]: Without dead ends: 984 [2022-01-10 06:45:40,161 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:40,161 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 6 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 850 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:40,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 850 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:40,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2022-01-10 06:45:40,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 974. [2022-01-10 06:45:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 755 states have (on average 1.3748344370860928) internal successors, (1038), 759 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:40,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1336 transitions. [2022-01-10 06:45:40,221 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1336 transitions. Word has length 105 [2022-01-10 06:45:40,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:40,221 INFO L470 AbstractCegarLoop]: Abstraction has 974 states and 1336 transitions. [2022-01-10 06:45:40,221 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:40,222 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1336 transitions. [2022-01-10 06:45:40,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-10 06:45:40,224 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:40,224 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:40,238 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:40,433 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:40,433 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:40,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:40,433 INFO L85 PathProgramCache]: Analyzing trace with hash -307065323, now seen corresponding path program 1 times [2022-01-10 06:45:40,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:40,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1464014405] [2022-01-10 06:45:40,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:40,434 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:40,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:40,435 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:40,436 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:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:40,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:45:40,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:40,744 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:40,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:45:40,989 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:40,989 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:40,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1464014405] [2022-01-10 06:45:40,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1464014405] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:45:40,989 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:45:40,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2022-01-10 06:45:40,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926565839] [2022-01-10 06:45:40,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:45:40,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 06:45:40,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:40,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 06:45:40,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-10 06:45:40,991 INFO L87 Difference]: Start difference. First operand 974 states and 1336 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:41,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:41,269 INFO L93 Difference]: Finished difference Result 2034 states and 2856 transitions. [2022-01-10 06:45:41,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 06:45:41,270 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:41,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:41,277 INFO L225 Difference]: With dead ends: 2034 [2022-01-10 06:45:41,277 INFO L226 Difference]: Without dead ends: 1265 [2022-01-10 06:45:41,280 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-10 06:45:41,280 INFO L933 BasicCegarLoop]: 485 mSDtfsCounter, 442 mSDsluCounter, 2252 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 2737 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:41,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [466 Valid, 2737 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:45:41,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2022-01-10 06:45:41,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 974. [2022-01-10 06:45:41,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 755 states have (on average 1.372185430463576) internal successors, (1036), 759 states have internal predecessors, (1036), 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:41,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1334 transitions. [2022-01-10 06:45:41,324 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1334 transitions. Word has length 106 [2022-01-10 06:45:41,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:41,325 INFO L470 AbstractCegarLoop]: Abstraction has 974 states and 1334 transitions. [2022-01-10 06:45:41,325 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:41,325 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1334 transitions. [2022-01-10 06:45:41,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-10 06:45:41,326 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:41,326 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:41,337 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:41,537 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:41,538 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:41,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:41,538 INFO L85 PathProgramCache]: Analyzing trace with hash -774266467, now seen corresponding path program 1 times [2022-01-10 06:45:41,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:41,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883440850] [2022-01-10 06:45:41,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:41,539 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:41,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:41,540 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:41,541 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:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:41,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 06:45:41,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:41,856 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:41,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:41,857 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:41,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883440850] [2022-01-10 06:45:41,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883440850] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:41,857 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:41,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 06:45:41,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143592803] [2022-01-10 06:45:41,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:41,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 06:45:41,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:41,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 06:45:41,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 06:45:41,859 INFO L87 Difference]: Start difference. First operand 974 states and 1334 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:42,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:42,357 INFO L93 Difference]: Finished difference Result 2035 states and 2875 transitions. [2022-01-10 06:45:42,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 06:45:42,357 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:42,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:42,364 INFO L225 Difference]: With dead ends: 2035 [2022-01-10 06:45:42,364 INFO L226 Difference]: Without dead ends: 1368 [2022-01-10 06:45:42,366 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:42,366 INFO L933 BasicCegarLoop]: 598 mSDtfsCounter, 735 mSDsluCounter, 1977 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 2575 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:42,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [735 Valid, 2575 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 06:45:42,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2022-01-10 06:45:42,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 967. [2022-01-10 06:45:42,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 747 states have (on average 1.358768406961178) internal successors, (1015), 751 states have internal predecessors, (1015), 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:42,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1313 transitions. [2022-01-10 06:45:42,415 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1313 transitions. Word has length 110 [2022-01-10 06:45:42,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:42,415 INFO L470 AbstractCegarLoop]: Abstraction has 967 states and 1313 transitions. [2022-01-10 06:45:42,415 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:42,416 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1313 transitions. [2022-01-10 06:45:42,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-01-10 06:45:42,417 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:42,417 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:42,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-01-10 06:45:42,625 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:42,626 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:42,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:42,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1865099635, now seen corresponding path program 1 times [2022-01-10 06:45:42,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:42,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291645969] [2022-01-10 06:45:42,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:42,627 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:42,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:42,628 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:42,629 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:42,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:42,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 06:45:42,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:42,926 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:42,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:42,926 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:42,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291645969] [2022-01-10 06:45:42,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291645969] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:42,926 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:42,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 06:45:42,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528351124] [2022-01-10 06:45:42,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:42,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 06:45:42,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:42,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 06:45:42,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 06:45:42,928 INFO L87 Difference]: Start difference. First operand 967 states and 1313 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:43,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:43,396 INFO L93 Difference]: Finished difference Result 2134 states and 2998 transitions. [2022-01-10 06:45:43,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 06:45:43,397 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:43,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:43,403 INFO L225 Difference]: With dead ends: 2134 [2022-01-10 06:45:43,403 INFO L226 Difference]: Without dead ends: 1467 [2022-01-10 06:45:43,405 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:43,406 INFO L933 BasicCegarLoop]: 655 mSDtfsCounter, 608 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 2417 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:43,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [608 Valid, 2417 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 06:45:43,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2022-01-10 06:45:43,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1082. [2022-01-10 06:45:43,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 827 states have (on average 1.347037484885127) internal successors, (1114), 832 states have internal predecessors, (1114), 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:43,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1458 transitions. [2022-01-10 06:45:43,461 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1458 transitions. Word has length 111 [2022-01-10 06:45:43,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:43,462 INFO L470 AbstractCegarLoop]: Abstraction has 1082 states and 1458 transitions. [2022-01-10 06:45:43,462 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:43,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1458 transitions. [2022-01-10 06:45:43,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-01-10 06:45:43,463 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:43,463 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:43,475 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:43,673 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:43,673 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:43,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:43,673 INFO L85 PathProgramCache]: Analyzing trace with hash -397934538, now seen corresponding path program 1 times [2022-01-10 06:45:43,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:43,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1447990069] [2022-01-10 06:45:43,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:43,674 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:43,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:43,675 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:43,676 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:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:43,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 06:45:43,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:43,953 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,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:43,954 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:43,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1447990069] [2022-01-10 06:45:43,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1447990069] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:43,954 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:43,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:45:43,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416351595] [2022-01-10 06:45:43,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:43,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:45:43,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:43,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:45:43,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:45:43,956 INFO L87 Difference]: Start difference. First operand 1082 states and 1458 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:44,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:44,182 INFO L93 Difference]: Finished difference Result 2928 states and 4024 transitions. [2022-01-10 06:45:44,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:45:44,183 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:44,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:44,192 INFO L225 Difference]: With dead ends: 2928 [2022-01-10 06:45:44,192 INFO L226 Difference]: Without dead ends: 2268 [2022-01-10 06:45:44,194 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:44,195 INFO L933 BasicCegarLoop]: 388 mSDtfsCounter, 409 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 1040 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.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:44,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 1040 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:45:44,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2022-01-10 06:45:44,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 2010. [2022-01-10 06:45:44,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2010 states, 1514 states have (on average 1.3381770145310437) internal successors, (2026), 1525 states have internal predecessors, (2026), 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:44,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 2700 transitions. [2022-01-10 06:45:44,309 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 2700 transitions. Word has length 111 [2022-01-10 06:45:44,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:44,310 INFO L470 AbstractCegarLoop]: Abstraction has 2010 states and 2700 transitions. [2022-01-10 06:45:44,310 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:44,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 2700 transitions. [2022-01-10 06:45:44,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-10 06:45:44,312 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:44,312 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:44,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-01-10 06:45:44,524 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:44,524 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:44,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:44,525 INFO L85 PathProgramCache]: Analyzing trace with hash -136330877, now seen corresponding path program 1 times [2022-01-10 06:45:44,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:44,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508829307] [2022-01-10 06:45:44,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:44,525 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:44,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:44,526 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:44,542 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:44,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:44,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 06:45:44,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:44,817 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:44,817 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:44,818 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:44,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [508829307] [2022-01-10 06:45:44,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [508829307] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:44,818 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:44,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 06:45:44,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870128887] [2022-01-10 06:45:44,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:44,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 06:45:44,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:44,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 06:45:44,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 06:45:44,819 INFO L87 Difference]: Start difference. First operand 2010 states and 2700 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:45,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:45,256 INFO L93 Difference]: Finished difference Result 4006 states and 5494 transitions. [2022-01-10 06:45:45,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 06:45:45,257 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:45,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:45,267 INFO L225 Difference]: With dead ends: 4006 [2022-01-10 06:45:45,267 INFO L226 Difference]: Without dead ends: 2314 [2022-01-10 06:45:45,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 109 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:45,272 INFO L933 BasicCegarLoop]: 536 mSDtfsCounter, 706 mSDsluCounter, 1444 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 1980 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:45,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [706 Valid, 1980 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 06:45:45,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2022-01-10 06:45:45,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1828. [2022-01-10 06:45:45,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1828 states, 1385 states have (on average 1.3335740072202167) internal successors, (1847), 1395 states have internal predecessors, (1847), 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:45,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 2447 transitions. [2022-01-10 06:45:45,376 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 2447 transitions. Word has length 113 [2022-01-10 06:45:45,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:45,376 INFO L470 AbstractCegarLoop]: Abstraction has 1828 states and 2447 transitions. [2022-01-10 06:45:45,376 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:45,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 2447 transitions. [2022-01-10 06:45:45,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-10 06:45:45,378 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:45,378 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:45,389 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:45,587 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:45,587 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:45,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:45,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1252925933, now seen corresponding path program 1 times [2022-01-10 06:45:45,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:45,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [620247950] [2022-01-10 06:45:45,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:45,589 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:45,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:45,590 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:45,626 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:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:45,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:45:45,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:45,919 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:45,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:45:46,150 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:46,150 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:46,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [620247950] [2022-01-10 06:45:46,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [620247950] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 06:45:46,151 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 06:45:46,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2022-01-10 06:45:46,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905494038] [2022-01-10 06:45:46,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:46,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 06:45:46,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:46,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 06:45:46,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-10 06:45:46,152 INFO L87 Difference]: Start difference. First operand 1828 states and 2447 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:46,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:46,422 INFO L93 Difference]: Finished difference Result 3600 states and 4889 transitions. [2022-01-10 06:45:46,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 06:45:46,423 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:46,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:46,432 INFO L225 Difference]: With dead ends: 3600 [2022-01-10 06:45:46,432 INFO L226 Difference]: Without dead ends: 2280 [2022-01-10 06:45:46,437 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:46,438 INFO L933 BasicCegarLoop]: 521 mSDtfsCounter, 353 mSDsluCounter, 2217 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 2738 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:46,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 2738 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:46,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2280 states. [2022-01-10 06:45:46,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2280 to 1828. [2022-01-10 06:45:46,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1828 states, 1385 states have (on average 1.3299638989169675) internal successors, (1842), 1395 states have internal predecessors, (1842), 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:46,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 2442 transitions. [2022-01-10 06:45:46,564 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 2442 transitions. Word has length 114 [2022-01-10 06:45:46,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:46,564 INFO L470 AbstractCegarLoop]: Abstraction has 1828 states and 2442 transitions. [2022-01-10 06:45:46,564 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:46,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 2442 transitions. [2022-01-10 06:45:46,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-10 06:45:46,566 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:46,566 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:46,577 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:46,775 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:46,775 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:46,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:46,775 INFO L85 PathProgramCache]: Analyzing trace with hash 567569707, now seen corresponding path program 1 times [2022-01-10 06:45:46,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:46,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080564039] [2022-01-10 06:45:46,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:46,776 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:46,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:46,777 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:46,778 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:46,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:46,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 06:45:46,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:47,033 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:47,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:47,034 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:47,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080564039] [2022-01-10 06:45:47,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1080564039] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:47,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:47,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:45:47,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307875691] [2022-01-10 06:45:47,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:47,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:45:47,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:47,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:45:47,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:45:47,035 INFO L87 Difference]: Start difference. First operand 1828 states and 2442 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:47,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:47,287 INFO L93 Difference]: Finished difference Result 4365 states and 5908 transitions. [2022-01-10 06:45:47,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:45:47,288 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:47,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:47,302 INFO L225 Difference]: With dead ends: 4365 [2022-01-10 06:45:47,302 INFO L226 Difference]: Without dead ends: 3106 [2022-01-10 06:45:47,305 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:47,306 INFO L933 BasicCegarLoop]: 492 mSDtfsCounter, 456 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1238 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:47,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [456 Valid, 1238 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:47,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2022-01-10 06:45:47,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 2745. [2022-01-10 06:45:47,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2745 states, 2063 states have (on average 1.3228308288899662) internal successors, (2729), 2079 states have internal predecessors, (2729), 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:47,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2745 states to 2745 states and 3657 transitions. [2022-01-10 06:45:47,492 INFO L78 Accepts]: Start accepts. Automaton has 2745 states and 3657 transitions. Word has length 113 [2022-01-10 06:45:47,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:47,493 INFO L470 AbstractCegarLoop]: Abstraction has 2745 states and 3657 transitions. [2022-01-10 06:45:47,493 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:47,493 INFO L276 IsEmpty]: Start isEmpty. Operand 2745 states and 3657 transitions. [2022-01-10 06:45:47,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-10 06:45:47,496 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:47,497 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:47,508 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:47,703 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:47,703 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:47,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:47,704 INFO L85 PathProgramCache]: Analyzing trace with hash -2081657829, now seen corresponding path program 1 times [2022-01-10 06:45:47,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:47,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [605880517] [2022-01-10 06:45:47,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:47,705 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:47,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:47,706 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:47,708 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:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:47,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:45:47,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:47,992 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:47,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:47,993 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:47,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [605880517] [2022-01-10 06:45:47,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [605880517] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:47,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:47,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:45:47,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073946644] [2022-01-10 06:45:47,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:47,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:45:47,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:47,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:45:47,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:45:47,994 INFO L87 Difference]: Start difference. First operand 2745 states and 3657 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:48,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:48,341 INFO L93 Difference]: Finished difference Result 4683 states and 6249 transitions. [2022-01-10 06:45:48,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:45:48,341 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:48,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:48,367 INFO L225 Difference]: With dead ends: 4683 [2022-01-10 06:45:48,367 INFO L226 Difference]: Without dead ends: 2287 [2022-01-10 06:45:48,372 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:48,373 INFO L933 BasicCegarLoop]: 313 mSDtfsCounter, 744 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 850 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:48,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [744 Valid, 850 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:48,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2287 states. [2022-01-10 06:45:48,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2287 to 2266. [2022-01-10 06:45:48,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2266 states, 1705 states have (on average 1.321407624633431) internal successors, (2253), 1718 states have internal predecessors, (2253), 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:48,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2266 states to 2266 states and 3009 transitions. [2022-01-10 06:45:48,516 INFO L78 Accepts]: Start accepts. Automaton has 2266 states and 3009 transitions. Word has length 113 [2022-01-10 06:45:48,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:48,516 INFO L470 AbstractCegarLoop]: Abstraction has 2266 states and 3009 transitions. [2022-01-10 06:45:48,516 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:48,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2266 states and 3009 transitions. [2022-01-10 06:45:48,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-01-10 06:45:48,518 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:48,518 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:48,533 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:48,728 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:48,728 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:48,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:48,728 INFO L85 PathProgramCache]: Analyzing trace with hash 251845704, now seen corresponding path program 1 times [2022-01-10 06:45:48,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:48,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688308990] [2022-01-10 06:45:48,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:48,729 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:48,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:48,730 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:48,731 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:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:48,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:45:48,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:49,041 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:49,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:45:49,244 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:49,244 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:49,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688308990] [2022-01-10 06:45:49,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688308990] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 06:45:49,245 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 06:45:49,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2022-01-10 06:45:49,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549815903] [2022-01-10 06:45:49,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:49,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 06:45:49,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:49,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 06:45:49,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-10 06:45:49,246 INFO L87 Difference]: Start difference. First operand 2266 states and 3009 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:49,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:49,547 INFO L93 Difference]: Finished difference Result 4845 states and 6587 transitions. [2022-01-10 06:45:49,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 06:45:49,548 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:49,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:49,561 INFO L225 Difference]: With dead ends: 4845 [2022-01-10 06:45:49,561 INFO L226 Difference]: Without dead ends: 2892 [2022-01-10 06:45:49,565 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:49,565 INFO L933 BasicCegarLoop]: 474 mSDtfsCounter, 332 mSDsluCounter, 2063 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 2537 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:49,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [349 Valid, 2537 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:49,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2022-01-10 06:45:49,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 2074. [2022-01-10 06:45:49,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2074 states, 1565 states have (on average 1.3194888178913737) internal successors, (2065), 1577 states have internal predecessors, (2065), 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:49,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 2745 transitions. [2022-01-10 06:45:49,686 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 2745 transitions. Word has length 117 [2022-01-10 06:45:49,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:49,686 INFO L470 AbstractCegarLoop]: Abstraction has 2074 states and 2745 transitions. [2022-01-10 06:45:49,686 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:49,686 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 2745 transitions. [2022-01-10 06:45:49,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-01-10 06:45:49,688 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:49,688 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:49,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-01-10 06:45:49,897 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:49,897 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:49,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:49,898 INFO L85 PathProgramCache]: Analyzing trace with hash 2125702498, now seen corresponding path program 1 times [2022-01-10 06:45:49,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:49,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1848321346] [2022-01-10 06:45:49,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:49,898 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:49,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:49,899 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:49,901 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:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:49,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:45:49,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:50,215 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:50,216 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:50,216 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:50,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1848321346] [2022-01-10 06:45:50,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1848321346] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:50,216 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:50,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:45:50,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011472971] [2022-01-10 06:45:50,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:50,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:45:50,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:50,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:45:50,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:45:50,217 INFO L87 Difference]: Start difference. First operand 2074 states and 2745 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:50,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:50,516 INFO L93 Difference]: Finished difference Result 3879 states and 5165 transitions. [2022-01-10 06:45:50,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:45:50,517 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:50,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:50,522 INFO L225 Difference]: With dead ends: 3879 [2022-01-10 06:45:50,522 INFO L226 Difference]: Without dead ends: 1999 [2022-01-10 06:45:50,527 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:50,528 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 703 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 746 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:50,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [703 Valid, 746 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:50,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2022-01-10 06:45:50,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1879. [2022-01-10 06:45:50,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1412 states have (on average 1.3123229461756374) internal successors, (1853), 1423 states have internal predecessors, (1853), 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:50,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 2475 transitions. [2022-01-10 06:45:50,638 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 2475 transitions. Word has length 116 [2022-01-10 06:45:50,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:50,638 INFO L470 AbstractCegarLoop]: Abstraction has 1879 states and 2475 transitions. [2022-01-10 06:45:50,639 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:50,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2475 transitions. [2022-01-10 06:45:50,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-01-10 06:45:50,640 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:50,640 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:50,649 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:50,849 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:50,849 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:50,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:50,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1844289053, now seen corresponding path program 1 times [2022-01-10 06:45:50,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:50,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390935281] [2022-01-10 06:45:50,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:50,850 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:50,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:50,851 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:50,852 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:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:50,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 06:45:50,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:51,071 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:51,072 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:51,072 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:51,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1390935281] [2022-01-10 06:45:51,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1390935281] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:51,072 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:51,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:45:51,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504224784] [2022-01-10 06:45:51,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:51,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:45:51,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:51,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:45:51,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:45:51,073 INFO L87 Difference]: Start difference. First operand 1879 states and 2475 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:51,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:51,167 INFO L93 Difference]: Finished difference Result 3598 states and 4777 transitions. [2022-01-10 06:45:51,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:45:51,168 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:51,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:51,172 INFO L225 Difference]: With dead ends: 3598 [2022-01-10 06:45:51,172 INFO L226 Difference]: Without dead ends: 1975 [2022-01-10 06:45:51,175 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:51,175 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 8 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 855 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:51,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 855 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:51,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2022-01-10 06:45:51,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1951. [2022-01-10 06:45:51,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1951 states, 1472 states have (on average 1.299592391304348) internal successors, (1913), 1483 states have internal predecessors, (1913), 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:51,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 2535 transitions. [2022-01-10 06:45:51,274 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 2535 transitions. Word has length 122 [2022-01-10 06:45:51,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:51,275 INFO L470 AbstractCegarLoop]: Abstraction has 1951 states and 2535 transitions. [2022-01-10 06:45:51,275 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:51,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 2535 transitions. [2022-01-10 06:45:51,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-01-10 06:45:51,276 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:51,276 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:51,288 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:51,485 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:51,486 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:51,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:51,486 INFO L85 PathProgramCache]: Analyzing trace with hash 2106767758, now seen corresponding path program 1 times [2022-01-10 06:45:51,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:51,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479050502] [2022-01-10 06:45:51,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:51,487 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:51,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:51,488 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:51,490 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:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:51,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:45:51,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:51,845 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:51,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:45:52,056 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:52,056 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:52,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1479050502] [2022-01-10 06:45:52,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1479050502] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 06:45:52,056 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 06:45:52,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2022-01-10 06:45:52,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850873030] [2022-01-10 06:45:52,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:52,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 06:45:52,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:52,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 06:45:52,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-10 06:45:52,057 INFO L87 Difference]: Start difference. First operand 1951 states and 2535 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:52,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:52,330 INFO L93 Difference]: Finished difference Result 4118 states and 5469 transitions. [2022-01-10 06:45:52,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 06:45:52,331 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:52,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:52,336 INFO L225 Difference]: With dead ends: 4118 [2022-01-10 06:45:52,336 INFO L226 Difference]: Without dead ends: 2387 [2022-01-10 06:45:52,339 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:52,340 INFO L933 BasicCegarLoop]: 370 mSDtfsCounter, 381 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 2029 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:52,340 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 2029 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:52,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2387 states. [2022-01-10 06:45:52,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2387 to 1930. [2022-01-10 06:45:52,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1457 states have (on average 1.2958133150308855) internal successors, (1888), 1468 states have internal predecessors, (1888), 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:52,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 2498 transitions. [2022-01-10 06:45:52,449 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 2498 transitions. Word has length 125 [2022-01-10 06:45:52,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:52,449 INFO L470 AbstractCegarLoop]: Abstraction has 1930 states and 2498 transitions. [2022-01-10 06:45:52,449 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:52,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2498 transitions. [2022-01-10 06:45:52,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-01-10 06:45:52,451 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:52,451 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:52,462 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:52,658 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:52,658 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:52,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:52,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1868346602, now seen corresponding path program 1 times [2022-01-10 06:45:52,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:52,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [713469623] [2022-01-10 06:45:52,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:52,659 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:52,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:52,660 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:52,662 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:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:52,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 06:45:52,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:52,936 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:52,937 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:45:52,937 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:52,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [713469623] [2022-01-10 06:45:52,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [713469623] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:45:52,937 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:45:52,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 06:45:52,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110380441] [2022-01-10 06:45:52,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:52,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 06:45:52,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:52,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 06:45:52,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:45:52,939 INFO L87 Difference]: Start difference. First operand 1930 states and 2498 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:53,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:53,155 INFO L93 Difference]: Finished difference Result 2768 states and 3779 transitions. [2022-01-10 06:45:53,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 06:45:53,155 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:53,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:53,162 INFO L225 Difference]: With dead ends: 2768 [2022-01-10 06:45:53,163 INFO L226 Difference]: Without dead ends: 2766 [2022-01-10 06:45:53,163 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:53,164 INFO L933 BasicCegarLoop]: 432 mSDtfsCounter, 252 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1955 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:53,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 1955 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:53,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2766 states. [2022-01-10 06:45:53,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2766 to 1925. [2022-01-10 06:45:53,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1450 states have (on average 1.2972413793103448) internal successors, (1881), 1462 states have internal predecessors, (1881), 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:53,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2493 transitions. [2022-01-10 06:45:53,298 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2493 transitions. Word has length 128 [2022-01-10 06:45:53,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:53,300 INFO L470 AbstractCegarLoop]: Abstraction has 1925 states and 2493 transitions. [2022-01-10 06:45:53,300 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:53,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2493 transitions. [2022-01-10 06:45:53,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-01-10 06:45:53,301 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:53,301 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:53,311 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:53,510 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:53,511 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:53,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:53,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1349837351, now seen corresponding path program 1 times [2022-01-10 06:45:53,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:53,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166660877] [2022-01-10 06:45:53,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:53,512 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:53,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:53,513 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:53,514 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:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:53,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:45:53,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:53,884 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:53,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:45:54,147 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:54,148 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:54,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166660877] [2022-01-10 06:45:54,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166660877] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 06:45:54,148 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 06:45:54,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2022-01-10 06:45:54,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509009402] [2022-01-10 06:45:54,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:45:54,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 06:45:54,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:54,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 06:45:54,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-01-10 06:45:54,149 INFO L87 Difference]: Start difference. First operand 1925 states and 2493 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:54,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:54,372 INFO L93 Difference]: Finished difference Result 3867 states and 5088 transitions. [2022-01-10 06:45:54,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 06:45:54,372 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:54,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:54,379 INFO L225 Difference]: With dead ends: 3867 [2022-01-10 06:45:54,379 INFO L226 Difference]: Without dead ends: 2201 [2022-01-10 06:45:54,383 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:54,383 INFO L933 BasicCegarLoop]: 360 mSDtfsCounter, 408 mSDsluCounter, 1637 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1997 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:54,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 1997 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:54,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2201 states. [2022-01-10 06:45:54,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2201 to 1723. [2022-01-10 06:45:54,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1723 states, 1306 states have (on average 1.2886676875957122) internal successors, (1683), 1317 states have internal predecessors, (1683), 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:54,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2219 transitions. [2022-01-10 06:45:54,486 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2219 transitions. Word has length 131 [2022-01-10 06:45:54,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:54,486 INFO L470 AbstractCegarLoop]: Abstraction has 1723 states and 2219 transitions. [2022-01-10 06:45:54,486 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:54,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2219 transitions. [2022-01-10 06:45:54,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-01-10 06:45:54,490 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:54,490 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] [2022-01-10 06:45:54,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-01-10 06:45:54,699 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:54,700 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:54,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:54,700 INFO L85 PathProgramCache]: Analyzing trace with hash -521683756, now seen corresponding path program 1 times [2022-01-10 06:45:54,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:54,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723736191] [2022-01-10 06:45:54,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:54,701 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:54,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:54,702 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:54,702 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:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:54,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 06:45:54,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:45:55,440 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:55,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:45:55,818 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:55,818 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:45:55,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723736191] [2022-01-10 06:45:55,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723736191] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:45:55,818 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:45:55,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2022-01-10 06:45:55,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90089023] [2022-01-10 06:45:55,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:45:55,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 06:45:55,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:45:55,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 06:45:55,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-01-10 06:45:55,820 INFO L87 Difference]: Start difference. First operand 1723 states and 2219 transitions. Second operand has 18 states, 18 states have (on average 14.5) internal successors, (261), 18 states have internal predecessors, (261), 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,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:45:59,039 INFO L93 Difference]: Finished difference Result 4846 states and 6529 transitions. [2022-01-10 06:45:59,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-01-10 06:45:59,039 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 14.5) internal successors, (261), 18 states have internal predecessors, (261), 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 207 [2022-01-10 06:45:59,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:45:59,048 INFO L225 Difference]: With dead ends: 4846 [2022-01-10 06:45:59,048 INFO L226 Difference]: Without dead ends: 3390 [2022-01-10 06:45:59,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 397 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1121 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=820, Invalid=3470, Unknown=0, NotChecked=0, Total=4290 [2022-01-10 06:45:59,053 INFO L933 BasicCegarLoop]: 431 mSDtfsCounter, 3837 mSDsluCounter, 3529 mSDsCounter, 0 mSdLazyCounter, 3028 mSolverCounterSat, 1413 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3837 SdHoareTripleChecker+Valid, 3960 SdHoareTripleChecker+Invalid, 4441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1413 IncrementalHoareTripleChecker+Valid, 3028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:45:59,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3837 Valid, 3960 Invalid, 4441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1413 Valid, 3028 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-01-10 06:45:59,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3390 states. [2022-01-10 06:45:59,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3390 to 2306. [2022-01-10 06:45:59,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2306 states, 1743 states have (on average 1.282845668387837) internal successors, (2236), 1757 states have internal predecessors, (2236), 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:59,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 2952 transitions. [2022-01-10 06:45:59,240 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 2952 transitions. Word has length 207 [2022-01-10 06:45:59,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:45:59,240 INFO L470 AbstractCegarLoop]: Abstraction has 2306 states and 2952 transitions. [2022-01-10 06:45:59,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 14.5) internal successors, (261), 18 states have internal predecessors, (261), 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,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 2952 transitions. [2022-01-10 06:45:59,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-01-10 06:45:59,244 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:45:59,244 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] [2022-01-10 06:45:59,257 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:59,454 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:59,454 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:45:59,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:45:59,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1645416822, now seen corresponding path program 1 times [2022-01-10 06:45:59,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:45:59,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887992086] [2022-01-10 06:45:59,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:45:59,455 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:45:59,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:45:59,456 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:59,457 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:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:45:59,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 06:45:59,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:46:00,223 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:46:00,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:46:00,615 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:46:00,615 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:46:00,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [887992086] [2022-01-10 06:46:00,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [887992086] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:46:00,615 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:46:00,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2022-01-10 06:46:00,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422650084] [2022-01-10 06:46:00,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:46:00,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 06:46:00,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:46:00,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 06:46:00,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-01-10 06:46:00,617 INFO L87 Difference]: Start difference. First operand 2306 states and 2952 transitions. Second operand has 18 states, 18 states have (on average 15.055555555555555) internal successors, (271), 18 states have internal predecessors, (271), 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:04,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:46:04,233 INFO L93 Difference]: Finished difference Result 6634 states and 8893 transitions. [2022-01-10 06:46:04,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-01-10 06:46:04,234 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 15.055555555555555) internal successors, (271), 18 states have internal predecessors, (271), 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:46:04,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:46:04,246 INFO L225 Difference]: With dead ends: 6634 [2022-01-10 06:46:04,246 INFO L226 Difference]: Without dead ends: 4677 [2022-01-10 06:46:04,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 401 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:46:04,253 INFO L933 BasicCegarLoop]: 649 mSDtfsCounter, 2562 mSDsluCounter, 5236 mSDsCounter, 0 mSdLazyCounter, 4081 mSolverCounterSat, 1363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2562 SdHoareTripleChecker+Valid, 5885 SdHoareTripleChecker+Invalid, 5444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1363 IncrementalHoareTripleChecker+Valid, 4081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-01-10 06:46:04,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2562 Valid, 5885 Invalid, 5444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1363 Valid, 4081 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-01-10 06:46:04,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4677 states. [2022-01-10 06:46:04,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4677 to 3280. [2022-01-10 06:46:04,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3280 states, 2489 states have (on average 1.2772197669746885) internal successors, (3179), 2509 states have internal predecessors, (3179), 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:46:04,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3280 states to 3280 states and 4175 transitions. [2022-01-10 06:46:04,530 INFO L78 Accepts]: Start accepts. Automaton has 3280 states and 4175 transitions. Word has length 208 [2022-01-10 06:46:04,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:46:04,530 INFO L470 AbstractCegarLoop]: Abstraction has 3280 states and 4175 transitions. [2022-01-10 06:46:04,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 15.055555555555555) internal successors, (271), 18 states have internal predecessors, (271), 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:04,530 INFO L276 IsEmpty]: Start isEmpty. Operand 3280 states and 4175 transitions. [2022-01-10 06:46:04,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-01-10 06:46:04,535 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:46:04,536 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] [2022-01-10 06:46:04,545 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:46:04,745 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:46:04,745 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:46:04,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:46:04,746 INFO L85 PathProgramCache]: Analyzing trace with hash 174341753, now seen corresponding path program 1 times [2022-01-10 06:46:04,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:46:04,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488006221] [2022-01-10 06:46:04,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:46:04,747 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:46:04,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:46:04,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:46:04,748 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:46:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:46:04,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 06:46:04,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:46:05,252 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:46:05,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:46:05,635 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:46:05,635 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:46:05,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [488006221] [2022-01-10 06:46:05,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [488006221] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:46:05,635 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:46:05,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2022-01-10 06:46:05,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578763330] [2022-01-10 06:46:05,635 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:46:05,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 06:46:05,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:46:05,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 06:46:05,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-01-10 06:46:05,636 INFO L87 Difference]: Start difference. First operand 3280 states and 4175 transitions. Second operand has 12 states, 12 states have (on average 23.666666666666668) internal successors, (284), 12 states have internal predecessors, (284), 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:07,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:46:07,095 INFO L93 Difference]: Finished difference Result 9316 states and 12739 transitions. [2022-01-10 06:46:07,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-10 06:46:07,096 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 23.666666666666668) internal successors, (284), 12 states have internal predecessors, (284), 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:46:07,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:46:07,120 INFO L225 Difference]: With dead ends: 9316 [2022-01-10 06:46:07,120 INFO L226 Difference]: Without dead ends: 6523 [2022-01-10 06:46:07,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 408 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:46:07,128 INFO L933 BasicCegarLoop]: 418 mSDtfsCounter, 2458 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 965 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2458 SdHoareTripleChecker+Valid, 2021 SdHoareTripleChecker+Invalid, 1797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 965 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 06:46:07,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2458 Valid, 2021 Invalid, 1797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [965 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 06:46:07,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6523 states. [2022-01-10 06:46:07,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6523 to 3573. [2022-01-10 06:46:07,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3573 states, 2746 states have (on average 1.2796795338674436) internal successors, (3514), 2766 states have internal predecessors, (3514), 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:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 4546 transitions. [2022-01-10 06:46:07,490 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 4546 transitions. Word has length 209 [2022-01-10 06:46:07,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:46:07,490 INFO L470 AbstractCegarLoop]: Abstraction has 3573 states and 4546 transitions. [2022-01-10 06:46:07,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 23.666666666666668) internal successors, (284), 12 states have internal predecessors, (284), 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:07,491 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 4546 transitions. [2022-01-10 06:46:07,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-01-10 06:46:07,496 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:46:07,496 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] [2022-01-10 06:46:07,508 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:07,705 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:07,706 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:46:07,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:46:07,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1680306216, now seen corresponding path program 1 times [2022-01-10 06:46:07,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:46:07,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408116611] [2022-01-10 06:46:07,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:46:07,707 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:46:07,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:46:07,708 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:07,708 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:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:46:07,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:46:07,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:46:08,149 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:08,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:46:08,481 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:08,481 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:46:08,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408116611] [2022-01-10 06:46:08,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408116611] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:46:08,481 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:46:08,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-01-10 06:46:08,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115883868] [2022-01-10 06:46:08,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:46:08,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 06:46:08,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:46:08,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 06:46:08,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-01-10 06:46:08,483 INFO L87 Difference]: Start difference. First operand 3573 states and 4546 transitions. Second operand has 12 states, 12 states have (on average 20.75) internal successors, (249), 12 states have internal predecessors, (249), 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:10,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:46:10,084 INFO L93 Difference]: Finished difference Result 14434 states and 19659 transitions. [2022-01-10 06:46:10,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-10 06:46:10,084 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 20.75) internal successors, (249), 12 states have internal predecessors, (249), 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 210 [2022-01-10 06:46:10,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:46:10,114 INFO L225 Difference]: With dead ends: 14434 [2022-01-10 06:46:10,115 INFO L226 Difference]: Without dead ends: 11348 [2022-01-10 06:46:10,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 415 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:10,123 INFO L933 BasicCegarLoop]: 1085 mSDtfsCounter, 1524 mSDsluCounter, 4876 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 431 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1599 SdHoareTripleChecker+Valid, 5961 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 431 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 06:46:10,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1599 Valid, 5961 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [431 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 06:46:10,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11348 states. [2022-01-10 06:46:10,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11348 to 6002. [2022-01-10 06:46:10,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6002 states, 4644 states have (on average 1.2629198966408268) internal successors, (5865), 4674 states have internal predecessors, (5865), 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:10,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6002 states to 6002 states and 7531 transitions. [2022-01-10 06:46:10,738 INFO L78 Accepts]: Start accepts. Automaton has 6002 states and 7531 transitions. Word has length 210 [2022-01-10 06:46:10,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:46:10,739 INFO L470 AbstractCegarLoop]: Abstraction has 6002 states and 7531 transitions. [2022-01-10 06:46:10,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.75) internal successors, (249), 12 states have internal predecessors, (249), 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:10,739 INFO L276 IsEmpty]: Start isEmpty. Operand 6002 states and 7531 transitions. [2022-01-10 06:46:10,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-01-10 06:46:10,750 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:46:10,750 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] [2022-01-10 06:46:10,761 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:10,959 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:10,959 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:46:10,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:46:10,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1171527402, now seen corresponding path program 1 times [2022-01-10 06:46:10,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:46:10,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850165431] [2022-01-10 06:46:10,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:46:10,960 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:46:10,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:46:10,961 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:10,962 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:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:46:11,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:46:11,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:46:11,442 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:11,442 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:46:11,442 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:46:11,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850165431] [2022-01-10 06:46:11,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1850165431] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:46:11,443 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:46:11,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:46:11,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836166714] [2022-01-10 06:46:11,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:46:11,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:46:11,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:46:11,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:46:11,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:46:11,444 INFO L87 Difference]: Start difference. First operand 6002 states and 7531 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 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:11,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:46:11,950 INFO L93 Difference]: Finished difference Result 9851 states and 12516 transitions. [2022-01-10 06:46:11,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:46:11,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 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 210 [2022-01-10 06:46:11,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:46:11,963 INFO L225 Difference]: With dead ends: 9851 [2022-01-10 06:46:11,963 INFO L226 Difference]: Without dead ends: 4336 [2022-01-10 06:46:11,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 206 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:11,976 INFO L933 BasicCegarLoop]: 251 mSDtfsCounter, 457 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:46:11,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [457 Valid, 465 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:46:11,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4336 states. [2022-01-10 06:46:12,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4336 to 4336. [2022-01-10 06:46:12,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4336 states, 3381 states have (on average 1.2727003845016267) internal successors, (4303), 3402 states have internal predecessors, (4303), 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:12,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4336 states to 4336 states and 5477 transitions. [2022-01-10 06:46:12,450 INFO L78 Accepts]: Start accepts. Automaton has 4336 states and 5477 transitions. Word has length 210 [2022-01-10 06:46:12,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:46:12,451 INFO L470 AbstractCegarLoop]: Abstraction has 4336 states and 5477 transitions. [2022-01-10 06:46:12,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 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:12,451 INFO L276 IsEmpty]: Start isEmpty. Operand 4336 states and 5477 transitions. [2022-01-10 06:46:12,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-01-10 06:46:12,458 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:46:12,458 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] [2022-01-10 06:46:12,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Ended with exit code 0 [2022-01-10 06:46:12,666 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:12,666 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:46:12,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:46:12,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1543464084, now seen corresponding path program 1 times [2022-01-10 06:46:12,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:46:12,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324139724] [2022-01-10 06:46:12,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:46:12,667 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:46:12,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:46:12,668 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:12,669 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:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 06:46:12,803 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 06:46:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 06:46:13,156 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-01-10 06:46:13,157 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 06:46:13,157 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 06:46:13,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Ended with exit code 0 [2022-01-10 06:46:13,369 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:13,372 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:13,375 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 06:46:13,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:46:13 BoogieIcfgContainer [2022-01-10 06:46:13,565 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 06:46:13,568 INFO L158 Benchmark]: Toolchain (without parser) took 43350.55ms. Allocated memory was 170.9MB in the beginning and 767.6MB in the end (delta: 596.6MB). Free memory was 119.4MB in the beginning and 456.6MB in the end (delta: -337.3MB). Peak memory consumption was 260.5MB. Max. memory is 8.0GB. [2022-01-10 06:46:13,569 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 170.9MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 06:46:13,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.35ms. Allocated memory is still 170.9MB. Free memory was 119.2MB in the beginning and 139.6MB in the end (delta: -20.4MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. [2022-01-10 06:46:13,569 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.91ms. Allocated memory is still 170.9MB. Free memory was 139.6MB in the beginning and 136.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 06:46:13,569 INFO L158 Benchmark]: Boogie Preprocessor took 36.37ms. Allocated memory is still 170.9MB. Free memory was 136.4MB in the beginning and 133.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 06:46:13,573 INFO L158 Benchmark]: RCFGBuilder took 732.56ms. Allocated memory is still 170.9MB. Free memory was 133.8MB in the beginning and 106.5MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-01-10 06:46:13,574 INFO L158 Benchmark]: TraceAbstraction took 42190.07ms. Allocated memory was 170.9MB in the beginning and 767.6MB in the end (delta: 596.6MB). Free memory was 106.0MB in the beginning and 456.6MB in the end (delta: -350.6MB). Peak memory consumption was 247.0MB. Max. memory is 8.0GB. [2022-01-10 06:46:13,575 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 170.9MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 341.35ms. Allocated memory is still 170.9MB. Free memory was 119.2MB in the beginning and 139.6MB in the end (delta: -20.4MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.91ms. Allocated memory is still 170.9MB. Free memory was 139.6MB in the beginning and 136.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.37ms. Allocated memory is still 170.9MB. Free memory was 136.4MB in the beginning and 133.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 732.56ms. Allocated memory is still 170.9MB. Free memory was 133.8MB in the beginning and 106.5MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 42190.07ms. Allocated memory was 170.9MB in the beginning and 767.6MB in the end (delta: 596.6MB). Free memory was 106.0MB in the beginning and 456.6MB in the end (delta: -350.6MB). Peak memory consumption was 247.0MB. 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: 610]: 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 1 [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] [L608] 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] [L574] COND TRUE 1 [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] [L608] 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] [L610] 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, 204 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.9s, OverallIterations: 34, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 16.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20212 SdHoareTripleChecker+Valid, 9.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19988 mSDsluCounter, 56778 SdHoareTripleChecker+Invalid, 7.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43476 mSDsCounter, 5422 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11914 IncrementalHoareTripleChecker+Invalid, 17336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5422 mSolverCounterUnsat, 13302 mSDtfsCounter, 11914 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5417 GetRequests, 5053 SyntacticMatches, 17 SemanticMatches, 347 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2637 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6002occurred 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: 3.9s AutomataMinimizationTime, 33 MinimizatonAttempts, 16906 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 3922 NumberOfCodeBlocks, 3922 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 5177 ConstructedInterpolants, 0 QuantifiedInterpolants, 14279 SizeOfPredicates, 76 NumberOfNonLiveVariables, 9190 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:13,615 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...