/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/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 12:39:56,002 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 12:39:56,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 12:39:56,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 12:39:56,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 12:39:56,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 12:39:56,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 12:39:56,100 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 12:39:56,102 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 12:39:56,102 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 12:39:56,103 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 12:39:56,104 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 12:39:56,104 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 12:39:56,105 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 12:39:56,106 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 12:39:56,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 12:39:56,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 12:39:56,108 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 12:39:56,112 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 12:39:56,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 12:39:56,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 12:39:56,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 12:39:56,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 12:39:56,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 12:39:56,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 12:39:56,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 12:39:56,124 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 12:39:56,125 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 12:39:56,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 12:39:56,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 12:39:56,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 12:39:56,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 12:39:56,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 12:39:56,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 12:39:56,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 12:39:56,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 12:39:56,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 12:39:56,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 12:39:56,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 12:39:56,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 12:39:56,139 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 12:39:56,142 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 12:39:56,178 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 12:39:56,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 12:39:56,179 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 12:39:56,179 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 12:39:56,181 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 12:39:56,181 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 12:39:56,181 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 12:39:56,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 12:39:56,182 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 12:39:56,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 12:39:56,183 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 12:39:56,183 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 12:39:56,183 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 12:39:56,183 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 12:39:56,183 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 12:39:56,183 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 12:39:56,183 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 12:39:56,184 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 12:39:56,184 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 12:39:56,184 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 12:39:56,184 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 12:39:56,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 12:39:56,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 12:39:56,186 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 12:39:56,186 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 12:39:56,186 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 12:39:56,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 12:39:56,186 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 12:39:56,186 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 12:39:56,187 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 12:39:56,187 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 12:39:56,187 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 12:39:56,188 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 12:39:56,189 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE 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 12:39:56,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 12:39:56,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 12:39:56,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 12:39:56,435 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 12:39:56,436 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 12:39:56,437 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2022-01-10 12:39:56,502 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/700d97530/a6e4bb2ddd4644c2974cc0fb4f92a1ce/FLAG5602a0f1b [2022-01-10 12:39:56,940 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 12:39:56,941 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2022-01-10 12:39:56,971 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/700d97530/a6e4bb2ddd4644c2974cc0fb4f92a1ce/FLAG5602a0f1b [2022-01-10 12:39:57,295 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/700d97530/a6e4bb2ddd4644c2974cc0fb4f92a1ce [2022-01-10 12:39:57,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 12:39:57,298 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 12:39:57,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 12:39:57,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 12:39:57,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 12:39:57,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:39:57" (1/1) ... [2022-01-10 12:39:57,304 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e788a31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:57, skipping insertion in model container [2022-01-10 12:39:57,304 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:39:57" (1/1) ... [2022-01-10 12:39:57,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 12:39:57,347 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 12:39:57,573 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.1.ufo.BOUNDED-10.pals.c[14700,14713] [2022-01-10 12:39:57,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 12:39:57,592 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 12:39:57,672 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.1.ufo.BOUNDED-10.pals.c[14700,14713] [2022-01-10 12:39:57,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 12:39:57,686 INFO L208 MainTranslator]: Completed translation [2022-01-10 12:39:57,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:57 WrapperNode [2022-01-10 12:39:57,687 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 12:39:57,688 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 12:39:57,688 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 12:39:57,688 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 12:39:57,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:57" (1/1) ... [2022-01-10 12:39:57,708 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:57" (1/1) ... [2022-01-10 12:39:57,742 INFO L137 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 43, calls inlined = 61, statements flattened = 938 [2022-01-10 12:39:57,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 12:39:57,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 12:39:57,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 12:39:57,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 12:39:57,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:57" (1/1) ... [2022-01-10 12:39:57,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:57" (1/1) ... [2022-01-10 12:39:57,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:57" (1/1) ... [2022-01-10 12:39:57,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:57" (1/1) ... [2022-01-10 12:39:57,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:57" (1/1) ... [2022-01-10 12:39:57,784 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:57" (1/1) ... [2022-01-10 12:39:57,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:57" (1/1) ... [2022-01-10 12:39:57,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 12:39:57,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 12:39:57,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 12:39:57,795 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 12:39:57,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:57" (1/1) ... [2022-01-10 12:39:57,821 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 12:39:57,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:39:57,861 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 12:39:57,886 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 12:39:57,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 12:39:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 12:39:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 12:39:57,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 12:39:58,057 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 12:39:58,059 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 12:39:58,809 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 12:39:58,819 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 12:39:58,819 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 12:39:58,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:39:58 BoogieIcfgContainer [2022-01-10 12:39:58,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 12:39:58,822 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 12:39:58,822 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 12:39:58,823 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 12:39:58,826 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:39:58" (1/1) ... [2022-01-10 12:39:59,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 12:39:59 BasicIcfg [2022-01-10 12:39:59,235 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 12:39:59,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 12:39:59,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 12:39:59,240 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 12:39:59,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:39:57" (1/4) ... [2022-01-10 12:39:59,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125f1b21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:39:59, skipping insertion in model container [2022-01-10 12:39:59,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:57" (2/4) ... [2022-01-10 12:39:59,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125f1b21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:39:59, skipping insertion in model container [2022-01-10 12:39:59,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:39:58" (3/4) ... [2022-01-10 12:39:59,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125f1b21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:39:59, skipping insertion in model container [2022-01-10 12:39:59,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 12:39:59" (4/4) ... [2022-01-10 12:39:59,243 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.cTransformedIcfg [2022-01-10 12:39:59,248 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 12:39:59,249 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2022-01-10 12:39:59,307 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 12:39:59,316 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 12:39:59,316 INFO L340 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2022-01-10 12:39:59,343 INFO L276 IsEmpty]: Start isEmpty. Operand has 301 states, 277 states have (on average 1.6931407942238268) internal successors, (469), 300 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:39:59,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 12:39:59,350 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:39:59,351 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] [2022-01-10 12:39:59,351 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-01-10 12:39:59,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:39:59,357 INFO L85 PathProgramCache]: Analyzing trace with hash 677488487, now seen corresponding path program 1 times [2022-01-10 12:39:59,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:39:59,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125438002] [2022-01-10 12:39:59,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:39:59,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:39:59,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:39:59,685 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 12:39:59,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:39:59,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125438002] [2022-01-10 12:39:59,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125438002] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:39:59,700 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:39:59,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 12:39:59,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021110973] [2022-01-10 12:39:59,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:39:59,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 12:39:59,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:39:59,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 12:39:59,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 12:39:59,734 INFO L87 Difference]: Start difference. First operand has 301 states, 277 states have (on average 1.6931407942238268) internal successors, (469), 300 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:39:59,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:39:59,818 INFO L93 Difference]: Finished difference Result 586 states and 909 transitions. [2022-01-10 12:39:59,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 12:39:59,824 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-01-10 12:39:59,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:39:59,846 INFO L225 Difference]: With dead ends: 586 [2022-01-10 12:39:59,847 INFO L226 Difference]: Without dead ends: 297 [2022-01-10 12:39:59,854 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 12:39:59,862 INFO L933 BasicCegarLoop]: 437 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, 437 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 12:39:59,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:39:59,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-01-10 12:39:59,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2022-01-10 12:39:59,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 274 states have (on average 1.5802919708029197) internal successors, (433), 296 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:39:59,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 433 transitions. [2022-01-10 12:39:59,933 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 433 transitions. Word has length 36 [2022-01-10 12:39:59,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:39:59,934 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 433 transitions. [2022-01-10 12:39:59,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:39:59,939 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 433 transitions. [2022-01-10 12:39:59,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 12:39:59,940 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:39:59,940 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] [2022-01-10 12:39:59,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 12:39:59,941 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-01-10 12:39:59,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:39:59,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1221910521, now seen corresponding path program 1 times [2022-01-10 12:39:59,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:39:59,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127857537] [2022-01-10 12:39:59,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:39:59,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:40:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:40:00,142 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 12:40:00,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:40:00,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127857537] [2022-01-10 12:40:00,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127857537] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:40:00,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:40:00,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:40:00,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041579007] [2022-01-10 12:40:00,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:40:00,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:40:00,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:40:00,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:40:00,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:40:00,148 INFO L87 Difference]: Start difference. First operand 297 states and 433 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:00,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:40:00,235 INFO L93 Difference]: Finished difference Result 660 states and 955 transitions. [2022-01-10 12:40:00,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:40:00,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-01-10 12:40:00,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:40:00,238 INFO L225 Difference]: With dead ends: 660 [2022-01-10 12:40:00,238 INFO L226 Difference]: Without dead ends: 380 [2022-01-10 12:40:00,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 12:40:00,245 INFO L933 BasicCegarLoop]: 472 mSDtfsCounter, 342 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:40:00,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [342 Valid, 656 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:40:00,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-01-10 12:40:00,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 273. [2022-01-10 12:40:00,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 254 states have (on average 1.562992125984252) internal successors, (397), 272 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:00,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 397 transitions. [2022-01-10 12:40:00,274 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 397 transitions. Word has length 36 [2022-01-10 12:40:00,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:40:00,275 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 397 transitions. [2022-01-10 12:40:00,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:00,275 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 397 transitions. [2022-01-10 12:40:00,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-10 12:40:00,276 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:40:00,276 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] [2022-01-10 12:40:00,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 12:40:00,277 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-01-10 12:40:00,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:40:00,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1889584923, now seen corresponding path program 1 times [2022-01-10 12:40:00,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:40:00,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775400066] [2022-01-10 12:40:00,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:40:00,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:40:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:40:00,426 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 12:40:00,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:40:00,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775400066] [2022-01-10 12:40:00,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775400066] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:40:00,427 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:40:00,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:40:00,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213138945] [2022-01-10 12:40:00,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:40:00,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:40:00,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:40:00,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:40:00,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:40:00,429 INFO L87 Difference]: Start difference. First operand 273 states and 397 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:00,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:40:00,468 INFO L93 Difference]: Finished difference Result 761 states and 1097 transitions. [2022-01-10 12:40:00,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:40:00,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-01-10 12:40:00,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:40:00,472 INFO L225 Difference]: With dead ends: 761 [2022-01-10 12:40:00,472 INFO L226 Difference]: Without dead ends: 505 [2022-01-10 12:40:00,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:40:00,479 INFO L933 BasicCegarLoop]: 405 mSDtfsCounter, 316 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 787 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 12:40:00,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 787 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:40:00,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-01-10 12:40:00,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 310. [2022-01-10 12:40:00,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 291 states have (on average 1.5498281786941581) internal successors, (451), 309 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:00,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 451 transitions. [2022-01-10 12:40:00,498 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 451 transitions. Word has length 46 [2022-01-10 12:40:00,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:40:00,498 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 451 transitions. [2022-01-10 12:40:00,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:00,499 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 451 transitions. [2022-01-10 12:40:00,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-10 12:40:00,505 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:40:00,505 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] [2022-01-10 12:40:00,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 12:40:00,506 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-01-10 12:40:00,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:40:00,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1409628564, now seen corresponding path program 1 times [2022-01-10 12:40:00,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:40:00,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457788272] [2022-01-10 12:40:00,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:40:00,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:40:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:40:00,609 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 12:40:00,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:40:00,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457788272] [2022-01-10 12:40:00,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457788272] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:40:00,609 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:40:00,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:40:00,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057927493] [2022-01-10 12:40:00,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:40:00,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:40:00,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:40:00,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:40:00,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:40:00,612 INFO L87 Difference]: Start difference. First operand 310 states and 451 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:00,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:40:00,645 INFO L93 Difference]: Finished difference Result 850 states and 1227 transitions. [2022-01-10 12:40:00,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:40:00,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-01-10 12:40:00,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:40:00,650 INFO L225 Difference]: With dead ends: 850 [2022-01-10 12:40:00,651 INFO L226 Difference]: Without dead ends: 557 [2022-01-10 12:40:00,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:40:00,657 INFO L933 BasicCegarLoop]: 440 mSDtfsCounter, 324 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 824 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 12:40:00,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [324 Valid, 824 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:40:00,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2022-01-10 12:40:00,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 337. [2022-01-10 12:40:00,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 318 states have (on average 1.5440251572327044) internal successors, (491), 336 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:00,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 491 transitions. [2022-01-10 12:40:00,671 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 491 transitions. Word has length 47 [2022-01-10 12:40:00,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:40:00,672 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 491 transitions. [2022-01-10 12:40:00,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:00,673 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 491 transitions. [2022-01-10 12:40:00,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-10 12:40:00,675 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:40:00,676 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] [2022-01-10 12:40:00,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 12:40:00,676 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-01-10 12:40:00,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:40:00,677 INFO L85 PathProgramCache]: Analyzing trace with hash -397825899, now seen corresponding path program 1 times [2022-01-10 12:40:00,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:40:00,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124387261] [2022-01-10 12:40:00,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:40:00,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:40:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:40:00,809 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 12:40:00,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:40:00,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124387261] [2022-01-10 12:40:00,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124387261] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:40:00,810 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:40:00,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:40:00,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679193870] [2022-01-10 12:40:00,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:40:00,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:40:00,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:40:00,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:40:00,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:40:00,811 INFO L87 Difference]: Start difference. First operand 337 states and 491 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:00,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:40:00,857 INFO L93 Difference]: Finished difference Result 1028 states and 1485 transitions. [2022-01-10 12:40:00,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 12:40:00,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-01-10 12:40:00,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:40:00,863 INFO L225 Difference]: With dead ends: 1028 [2022-01-10 12:40:00,863 INFO L226 Difference]: Without dead ends: 708 [2022-01-10 12:40:00,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:40:00,865 INFO L933 BasicCegarLoop]: 556 mSDtfsCounter, 803 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:40:00,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [803 Valid, 937 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:40:00,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2022-01-10 12:40:00,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 332. [2022-01-10 12:40:00,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 314 states have (on average 1.5382165605095541) internal successors, (483), 331 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:00,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 483 transitions. [2022-01-10 12:40:00,881 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 483 transitions. Word has length 47 [2022-01-10 12:40:00,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:40:00,883 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 483 transitions. [2022-01-10 12:40:00,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:00,886 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 483 transitions. [2022-01-10 12:40:00,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 12:40:00,892 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:40:00,892 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] [2022-01-10 12:40:00,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 12:40:00,893 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-01-10 12:40:00,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:40:00,893 INFO L85 PathProgramCache]: Analyzing trace with hash 873255488, now seen corresponding path program 1 times [2022-01-10 12:40:00,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:40:00,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070396437] [2022-01-10 12:40:00,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:40:00,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:40:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:40:01,027 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 12:40:01,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:40:01,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070396437] [2022-01-10 12:40:01,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070396437] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:40:01,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:40:01,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:40:01,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432876786] [2022-01-10 12:40:01,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:40:01,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:40:01,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:40:01,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:40:01,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:40:01,030 INFO L87 Difference]: Start difference. First operand 332 states and 483 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:01,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:40:01,094 INFO L93 Difference]: Finished difference Result 822 states and 1196 transitions. [2022-01-10 12:40:01,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:40:01,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-01-10 12:40:01,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:40:01,098 INFO L225 Difference]: With dead ends: 822 [2022-01-10 12:40:01,098 INFO L226 Difference]: Without dead ends: 507 [2022-01-10 12:40:01,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:40:01,101 INFO L933 BasicCegarLoop]: 505 mSDtfsCounter, 290 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:40:01,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 731 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:40:01,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-01-10 12:40:01,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 312. [2022-01-10 12:40:01,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 298 states have (on average 1.5134228187919463) internal successors, (451), 311 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:01,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 451 transitions. [2022-01-10 12:40:01,118 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 451 transitions. Word has length 51 [2022-01-10 12:40:01,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:40:01,118 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 451 transitions. [2022-01-10 12:40:01,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:01,118 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 451 transitions. [2022-01-10 12:40:01,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 12:40:01,119 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:40:01,119 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 12:40:01,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 12:40:01,120 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-01-10 12:40:01,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:40:01,121 INFO L85 PathProgramCache]: Analyzing trace with hash 630265709, now seen corresponding path program 1 times [2022-01-10 12:40:01,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:40:01,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280382743] [2022-01-10 12:40:01,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:40:01,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:40:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:40:01,215 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 12:40:01,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:40:01,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280382743] [2022-01-10 12:40:01,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280382743] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:40:01,216 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:40:01,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:40:01,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342525032] [2022-01-10 12:40:01,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:40:01,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:40:01,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:40:01,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:40:01,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:40:01,218 INFO L87 Difference]: Start difference. First operand 312 states and 451 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:01,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:40:01,264 INFO L93 Difference]: Finished difference Result 761 states and 1094 transitions. [2022-01-10 12:40:01,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:40:01,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-01-10 12:40:01,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:40:01,267 INFO L225 Difference]: With dead ends: 761 [2022-01-10 12:40:01,268 INFO L226 Difference]: Without dead ends: 466 [2022-01-10 12:40:01,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 12:40:01,269 INFO L933 BasicCegarLoop]: 479 mSDtfsCounter, 187 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:40:01,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 749 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:40:01,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-01-10 12:40:01,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 300. [2022-01-10 12:40:01,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 288 states have (on average 1.5034722222222223) internal successors, (433), 299 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:01,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 433 transitions. [2022-01-10 12:40:01,285 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 433 transitions. Word has length 55 [2022-01-10 12:40:01,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:40:01,286 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 433 transitions. [2022-01-10 12:40:01,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:01,287 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 433 transitions. [2022-01-10 12:40:01,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-10 12:40:01,287 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:40:01,287 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:40:01,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 12:40:01,288 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-01-10 12:40:01,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:40:01,288 INFO L85 PathProgramCache]: Analyzing trace with hash -235147109, now seen corresponding path program 1 times [2022-01-10 12:40:01,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:40:01,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612919532] [2022-01-10 12:40:01,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:40:01,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:40:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:40:01,395 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 12:40:01,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:40:01,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612919532] [2022-01-10 12:40:01,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612919532] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:40:01,396 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:40:01,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:40:01,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003841511] [2022-01-10 12:40:01,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:40:01,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:40:01,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:40:01,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:40:01,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:40:01,397 INFO L87 Difference]: Start difference. First operand 300 states and 433 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:01,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:40:01,481 INFO L93 Difference]: Finished difference Result 952 states and 1367 transitions. [2022-01-10 12:40:01,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 12:40:01,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-01-10 12:40:01,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:40:01,485 INFO L225 Difference]: With dead ends: 952 [2022-01-10 12:40:01,485 INFO L226 Difference]: Without dead ends: 669 [2022-01-10 12:40:01,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:40:01,486 INFO L933 BasicCegarLoop]: 473 mSDtfsCounter, 439 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:40:01,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [439 Valid, 1081 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:40:01,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-01-10 12:40:01,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 270. [2022-01-10 12:40:01,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 264 states have (on average 1.4659090909090908) internal successors, (387), 269 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:01,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 387 transitions. [2022-01-10 12:40:01,507 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 387 transitions. Word has length 56 [2022-01-10 12:40:01,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:40:01,509 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 387 transitions. [2022-01-10 12:40:01,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:01,509 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 387 transitions. [2022-01-10 12:40:01,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-10 12:40:01,510 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:40:01,510 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:40:01,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 12:40:01,511 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-01-10 12:40:01,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:40:01,511 INFO L85 PathProgramCache]: Analyzing trace with hash 370525189, now seen corresponding path program 1 times [2022-01-10 12:40:01,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:40:01,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624274225] [2022-01-10 12:40:01,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:40:01,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:40:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:40:01,621 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 12:40:01,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:40:01,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624274225] [2022-01-10 12:40:01,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624274225] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:40:01,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:40:01,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:40:01,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404599743] [2022-01-10 12:40:01,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:40:01,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:40:01,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:40:01,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:40:01,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:40:01,624 INFO L87 Difference]: Start difference. First operand 270 states and 387 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:01,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:40:01,666 INFO L93 Difference]: Finished difference Result 526 states and 748 transitions. [2022-01-10 12:40:01,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 12:40:01,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-01-10 12:40:01,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:40:01,668 INFO L225 Difference]: With dead ends: 526 [2022-01-10 12:40:01,668 INFO L226 Difference]: Without dead ends: 270 [2022-01-10 12:40:01,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 12:40:01,671 INFO L933 BasicCegarLoop]: 292 mSDtfsCounter, 1 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:40:01,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 859 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:40:01,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-01-10 12:40:01,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2022-01-10 12:40:01,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 264 states have (on average 1.4204545454545454) internal successors, (375), 269 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:01,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 375 transitions. [2022-01-10 12:40:01,687 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 375 transitions. Word has length 61 [2022-01-10 12:40:01,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:40:01,687 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 375 transitions. [2022-01-10 12:40:01,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:01,687 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 375 transitions. [2022-01-10 12:40:01,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-10 12:40:01,688 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:40:01,688 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:40:01,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 12:40:01,688 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-01-10 12:40:01,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:40:01,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1076438723, now seen corresponding path program 1 times [2022-01-10 12:40:01,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:40:01,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618362085] [2022-01-10 12:40:01,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:40:01,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:40:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:40:01,835 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 12:40:01,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:40:01,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618362085] [2022-01-10 12:40:01,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618362085] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:40:01,836 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:40:01,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:40:01,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204461513] [2022-01-10 12:40:01,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:40:01,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 12:40:01,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:40:01,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 12:40:01,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 12:40:01,837 INFO L87 Difference]: Start difference. First operand 270 states and 375 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:02,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:40:02,174 INFO L93 Difference]: Finished difference Result 850 states and 1192 transitions. [2022-01-10 12:40:02,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 12:40:02,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-01-10 12:40:02,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:40:02,177 INFO L225 Difference]: With dead ends: 850 [2022-01-10 12:40:02,178 INFO L226 Difference]: Without dead ends: 597 [2022-01-10 12:40:02,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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 12:40:02,179 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 928 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 12:40:02,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [928 Valid, 729 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 12:40:02,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2022-01-10 12:40:02,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 376. [2022-01-10 12:40:02,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 370 states have (on average 1.4054054054054055) internal successors, (520), 375 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:02,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 520 transitions. [2022-01-10 12:40:02,215 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 520 transitions. Word has length 72 [2022-01-10 12:40:02,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:40:02,215 INFO L470 AbstractCegarLoop]: Abstraction has 376 states and 520 transitions. [2022-01-10 12:40:02,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:02,215 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 520 transitions. [2022-01-10 12:40:02,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-10 12:40:02,216 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:40:02,216 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:40:02,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 12:40:02,217 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-01-10 12:40:02,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:40:02,218 INFO L85 PathProgramCache]: Analyzing trace with hash 345240174, now seen corresponding path program 1 times [2022-01-10 12:40:02,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:40:02,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303623860] [2022-01-10 12:40:02,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:40:02,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:40:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:40:02,337 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 12:40:02,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:40:02,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303623860] [2022-01-10 12:40:02,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303623860] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:40:02,337 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:40:02,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:40:02,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218631589] [2022-01-10 12:40:02,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:40:02,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 12:40:02,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:40:02,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 12:40:02,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 12:40:02,339 INFO L87 Difference]: Start difference. First operand 376 states and 520 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:02,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:40:02,622 INFO L93 Difference]: Finished difference Result 854 states and 1188 transitions. [2022-01-10 12:40:02,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 12:40:02,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2022-01-10 12:40:02,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:40:02,625 INFO L225 Difference]: With dead ends: 854 [2022-01-10 12:40:02,625 INFO L226 Difference]: Without dead ends: 601 [2022-01-10 12:40:02,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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 12:40:02,628 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 925 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 12:40:02,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [925 Valid, 731 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 12:40:02,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-01-10 12:40:02,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 380. [2022-01-10 12:40:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 374 states have (on average 1.3903743315508021) internal successors, (520), 379 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:02,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 520 transitions. [2022-01-10 12:40:02,655 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 520 transitions. Word has length 73 [2022-01-10 12:40:02,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:40:02,655 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 520 transitions. [2022-01-10 12:40:02,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:02,655 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 520 transitions. [2022-01-10 12:40:02,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-01-10 12:40:02,661 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:40:02,661 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:40:02,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 12:40:02,661 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-01-10 12:40:02,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:40:02,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1277480536, now seen corresponding path program 1 times [2022-01-10 12:40:02,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:40:02,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013252406] [2022-01-10 12:40:02,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:40:02,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:40:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:40:02,811 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 12:40:02,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:40:02,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013252406] [2022-01-10 12:40:02,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013252406] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:40:02,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:40:02,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:40:02,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893179426] [2022-01-10 12:40:02,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:40:02,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:40:02,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:40:02,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:40:02,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:40:02,813 INFO L87 Difference]: Start difference. First operand 380 states and 520 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:02,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:40:02,852 INFO L93 Difference]: Finished difference Result 635 states and 880 transitions. [2022-01-10 12:40:02,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 12:40:02,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-01-10 12:40:02,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:40:02,855 INFO L225 Difference]: With dead ends: 635 [2022-01-10 12:40:02,855 INFO L226 Difference]: Without dead ends: 346 [2022-01-10 12:40:02,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 12:40:02,856 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 1 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:40:02,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 833 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:40:02,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-01-10 12:40:02,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2022-01-10 12:40:02,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 340 states have (on average 1.4) internal successors, (476), 345 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:02,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 476 transitions. [2022-01-10 12:40:02,879 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 476 transitions. Word has length 76 [2022-01-10 12:40:02,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:40:02,880 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 476 transitions. [2022-01-10 12:40:02,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:02,880 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 476 transitions. [2022-01-10 12:40:02,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-01-10 12:40:02,881 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:40:02,881 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:40:02,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 12:40:02,881 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-01-10 12:40:02,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:40:02,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1101420899, now seen corresponding path program 1 times [2022-01-10 12:40:02,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:40:02,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443878261] [2022-01-10 12:40:02,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:40:02,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:40:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:40:03,054 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 12:40:03,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:40:03,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443878261] [2022-01-10 12:40:03,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443878261] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:40:03,055 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:40:03,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 12:40:03,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616135372] [2022-01-10 12:40:03,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:40:03,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 12:40:03,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:40:03,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 12:40:03,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 12:40:03,056 INFO L87 Difference]: Start difference. First operand 346 states and 476 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:03,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:40:03,199 INFO L93 Difference]: Finished difference Result 1268 states and 1765 transitions. [2022-01-10 12:40:03,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 12:40:03,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-01-10 12:40:03,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:40:03,204 INFO L225 Difference]: With dead ends: 1268 [2022-01-10 12:40:03,204 INFO L226 Difference]: Without dead ends: 1035 [2022-01-10 12:40:03,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-01-10 12:40:03,206 INFO L933 BasicCegarLoop]: 418 mSDtfsCounter, 1134 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 2134 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:40:03,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1134 Valid, 2134 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:40:03,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2022-01-10 12:40:03,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 366. [2022-01-10 12:40:03,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 360 states have (on average 1.3805555555555555) internal successors, (497), 365 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:03,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 497 transitions. [2022-01-10 12:40:03,237 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 497 transitions. Word has length 76 [2022-01-10 12:40:03,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:40:03,237 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 497 transitions. [2022-01-10 12:40:03,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:03,238 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 497 transitions. [2022-01-10 12:40:03,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-10 12:40:03,238 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:40:03,239 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:40:03,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 12:40:03,239 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-01-10 12:40:03,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:40:03,239 INFO L85 PathProgramCache]: Analyzing trace with hash 194458744, now seen corresponding path program 1 times [2022-01-10 12:40:03,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:40:03,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492903062] [2022-01-10 12:40:03,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:40:03,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:40:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:40:03,428 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 12:40:03,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:40:03,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492903062] [2022-01-10 12:40:03,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492903062] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:40:03,429 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:40:03,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 12:40:03,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64833213] [2022-01-10 12:40:03,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:40:03,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 12:40:03,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:40:03,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 12:40:03,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 12:40:03,430 INFO L87 Difference]: Start difference. First operand 366 states and 497 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:03,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:40:03,783 INFO L93 Difference]: Finished difference Result 1516 states and 2097 transitions. [2022-01-10 12:40:03,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 12:40:03,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-01-10 12:40:03,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:40:03,789 INFO L225 Difference]: With dead ends: 1516 [2022-01-10 12:40:03,789 INFO L226 Difference]: Without dead ends: 1283 [2022-01-10 12:40:03,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-01-10 12:40:03,790 INFO L933 BasicCegarLoop]: 826 mSDtfsCounter, 1393 mSDsluCounter, 1918 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1393 SdHoareTripleChecker+Valid, 2744 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 12:40:03,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1393 Valid, 2744 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 12:40:03,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2022-01-10 12:40:03,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 394. [2022-01-10 12:40:03,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 388 states have (on average 1.365979381443299) internal successors, (530), 393 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:03,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 530 transitions. [2022-01-10 12:40:03,835 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 530 transitions. Word has length 80 [2022-01-10 12:40:03,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:40:03,835 INFO L470 AbstractCegarLoop]: Abstraction has 394 states and 530 transitions. [2022-01-10 12:40:03,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:03,836 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 530 transitions. [2022-01-10 12:40:03,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-10 12:40:03,836 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:40:03,837 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:40:03,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 12:40:03,837 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-01-10 12:40:03,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:40:03,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1591536714, now seen corresponding path program 1 times [2022-01-10 12:40:03,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:40:03,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198658691] [2022-01-10 12:40:03,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:40:03,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:40:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:40:04,027 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 12:40:04,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:40:04,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198658691] [2022-01-10 12:40:04,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198658691] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:40:04,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:40:04,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 12:40:04,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605912693] [2022-01-10 12:40:04,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:40:04,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 12:40:04,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:40:04,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 12:40:04,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 12:40:04,030 INFO L87 Difference]: Start difference. First operand 394 states and 530 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:04,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:40:04,263 INFO L93 Difference]: Finished difference Result 1139 states and 1570 transitions. [2022-01-10 12:40:04,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 12:40:04,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-01-10 12:40:04,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:40:04,267 INFO L225 Difference]: With dead ends: 1139 [2022-01-10 12:40:04,267 INFO L226 Difference]: Without dead ends: 885 [2022-01-10 12:40:04,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-01-10 12:40:04,272 INFO L933 BasicCegarLoop]: 469 mSDtfsCounter, 898 mSDsluCounter, 1594 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 2063 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 12:40:04,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [898 Valid, 2063 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 12:40:04,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2022-01-10 12:40:04,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 402. [2022-01-10 12:40:04,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 396 states have (on average 1.3585858585858586) internal successors, (538), 401 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:04,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 538 transitions. [2022-01-10 12:40:04,312 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 538 transitions. Word has length 80 [2022-01-10 12:40:04,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:40:04,312 INFO L470 AbstractCegarLoop]: Abstraction has 402 states and 538 transitions. [2022-01-10 12:40:04,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:04,313 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 538 transitions. [2022-01-10 12:40:04,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-10 12:40:04,313 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:40:04,313 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:40:04,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 12:40:04,314 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-01-10 12:40:04,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:40:04,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1586684041, now seen corresponding path program 1 times [2022-01-10 12:40:04,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:40:04,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501203967] [2022-01-10 12:40:04,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:40:04,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:40:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:40:04,497 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 12:40:04,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:40:04,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501203967] [2022-01-10 12:40:04,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501203967] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:40:04,499 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:40:04,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 12:40:04,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404171860] [2022-01-10 12:40:04,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:40:04,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 12:40:04,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:40:04,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 12:40:04,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 12:40:04,501 INFO L87 Difference]: Start difference. First operand 402 states and 538 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:04,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:40:04,794 INFO L93 Difference]: Finished difference Result 1377 states and 1890 transitions. [2022-01-10 12:40:04,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 12:40:04,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-01-10 12:40:04,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:40:04,799 INFO L225 Difference]: With dead ends: 1377 [2022-01-10 12:40:04,799 INFO L226 Difference]: Without dead ends: 1123 [2022-01-10 12:40:04,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-01-10 12:40:04,800 INFO L933 BasicCegarLoop]: 663 mSDtfsCounter, 1393 mSDsluCounter, 1941 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1393 SdHoareTripleChecker+Valid, 2604 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 12:40:04,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1393 Valid, 2604 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 12:40:04,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2022-01-10 12:40:04,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 427. [2022-01-10 12:40:04,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 421 states have (on average 1.342042755344418) internal successors, (565), 426 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:04,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 565 transitions. [2022-01-10 12:40:04,882 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 565 transitions. Word has length 81 [2022-01-10 12:40:04,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:40:04,883 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 565 transitions. [2022-01-10 12:40:04,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:04,883 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 565 transitions. [2022-01-10 12:40:04,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-10 12:40:04,884 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:40:04,884 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:40:04,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 12:40:04,884 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-01-10 12:40:04,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:40:04,885 INFO L85 PathProgramCache]: Analyzing trace with hash -2012861069, now seen corresponding path program 1 times [2022-01-10 12:40:04,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:40:04,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243915794] [2022-01-10 12:40:04,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:40:04,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:40:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:40:04,988 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 12:40:04,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:40:04,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243915794] [2022-01-10 12:40:04,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243915794] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:40:04,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:40:04,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:40:04,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890810207] [2022-01-10 12:40:04,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:40:04,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:40:04,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:40:04,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:40:04,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:40:04,990 INFO L87 Difference]: Start difference. First operand 427 states and 565 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:05,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:40:05,086 INFO L93 Difference]: Finished difference Result 895 states and 1211 transitions. [2022-01-10 12:40:05,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:40:05,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-01-10 12:40:05,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:40:05,088 INFO L225 Difference]: With dead ends: 895 [2022-01-10 12:40:05,088 INFO L226 Difference]: Without dead ends: 627 [2022-01-10 12:40:05,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:40:05,090 INFO L933 BasicCegarLoop]: 437 mSDtfsCounter, 195 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:40:05,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 670 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:40:05,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2022-01-10 12:40:05,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 425. [2022-01-10 12:40:05,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 419 states have (on average 1.3365155131264916) internal successors, (560), 424 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:05,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 560 transitions. [2022-01-10 12:40:05,139 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 560 transitions. Word has length 81 [2022-01-10 12:40:05,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:40:05,139 INFO L470 AbstractCegarLoop]: Abstraction has 425 states and 560 transitions. [2022-01-10 12:40:05,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:05,140 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 560 transitions. [2022-01-10 12:40:05,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-10 12:40:05,140 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:40:05,141 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:40:05,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 12:40:05,141 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-01-10 12:40:05,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:40:05,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1280709097, now seen corresponding path program 1 times [2022-01-10 12:40:05,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:40:05,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823553215] [2022-01-10 12:40:05,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:40:05,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:40:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:40:05,479 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 12:40:05,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:40:05,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823553215] [2022-01-10 12:40:05,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823553215] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:40:05,480 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:40:05,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:40:05,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397112738] [2022-01-10 12:40:05,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:40:05,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:40:05,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:40:05,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:40:05,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:40:05,481 INFO L87 Difference]: Start difference. First operand 425 states and 560 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:05,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:40:05,712 INFO L93 Difference]: Finished difference Result 1125 states and 1497 transitions. [2022-01-10 12:40:05,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 12:40:05,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-01-10 12:40:05,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:40:05,716 INFO L225 Difference]: With dead ends: 1125 [2022-01-10 12:40:05,717 INFO L226 Difference]: Without dead ends: 859 [2022-01-10 12:40:05,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 12:40:05,718 INFO L933 BasicCegarLoop]: 349 mSDtfsCounter, 567 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 12:40:05,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [567 Valid, 1014 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 12:40:05,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2022-01-10 12:40:05,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 661. [2022-01-10 12:40:05,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 655 states have (on average 1.3099236641221375) internal successors, (858), 660 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:05,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 858 transitions. [2022-01-10 12:40:05,805 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 858 transitions. Word has length 81 [2022-01-10 12:40:05,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:40:05,805 INFO L470 AbstractCegarLoop]: Abstraction has 661 states and 858 transitions. [2022-01-10 12:40:05,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:05,806 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 858 transitions. [2022-01-10 12:40:05,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-10 12:40:05,806 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:40:05,807 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:40:05,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 12:40:05,807 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-01-10 12:40:05,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:40:05,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1312791415, now seen corresponding path program 1 times [2022-01-10 12:40:05,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:40:05,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729053329] [2022-01-10 12:40:05,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:40:05,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:40:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:40:05,947 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 12:40:05,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:40:05,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729053329] [2022-01-10 12:40:05,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729053329] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:40:05,948 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:40:05,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 12:40:05,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186302807] [2022-01-10 12:40:05,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:40:05,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 12:40:05,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:40:05,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 12:40:05,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 12:40:05,949 INFO L87 Difference]: Start difference. First operand 661 states and 858 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:06,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:40:06,374 INFO L93 Difference]: Finished difference Result 1924 states and 2600 transitions. [2022-01-10 12:40:06,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 12:40:06,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2022-01-10 12:40:06,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:40:06,380 INFO L225 Difference]: With dead ends: 1924 [2022-01-10 12:40:06,380 INFO L226 Difference]: Without dead ends: 1480 [2022-01-10 12:40:06,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-01-10 12:40:06,383 INFO L933 BasicCegarLoop]: 588 mSDtfsCounter, 1294 mSDsluCounter, 1397 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 1985 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 12:40:06,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1294 Valid, 1985 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 12:40:06,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2022-01-10 12:40:06,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 658. [2022-01-10 12:40:06,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 652 states have (on average 1.3021472392638036) internal successors, (849), 657 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:06,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 849 transitions. [2022-01-10 12:40:06,488 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 849 transitions. Word has length 83 [2022-01-10 12:40:06,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:40:06,489 INFO L470 AbstractCegarLoop]: Abstraction has 658 states and 849 transitions. [2022-01-10 12:40:06,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:06,489 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 849 transitions. [2022-01-10 12:40:06,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-10 12:40:06,490 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:40:06,490 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:40:06,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 12:40:06,490 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2022-01-10 12:40:06,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:40:06,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1354078392, now seen corresponding path program 1 times [2022-01-10 12:40:06,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:40:06,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933549506] [2022-01-10 12:40:06,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:40:06,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:40:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 12:40:06,638 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 12:40:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 12:40:06,856 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 12:40:06,857 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 12:40:06,857 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION (22 of 23 remaining) [2022-01-10 12:40:06,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (21 of 23 remaining) [2022-01-10 12:40:06,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (20 of 23 remaining) [2022-01-10 12:40:06,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (19 of 23 remaining) [2022-01-10 12:40:06,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (18 of 23 remaining) [2022-01-10 12:40:06,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (17 of 23 remaining) [2022-01-10 12:40:06,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (16 of 23 remaining) [2022-01-10 12:40:06,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (15 of 23 remaining) [2022-01-10 12:40:06,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (14 of 23 remaining) [2022-01-10 12:40:06,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (13 of 23 remaining) [2022-01-10 12:40:06,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (12 of 23 remaining) [2022-01-10 12:40:06,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (11 of 23 remaining) [2022-01-10 12:40:06,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (10 of 23 remaining) [2022-01-10 12:40:06,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (9 of 23 remaining) [2022-01-10 12:40:06,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (8 of 23 remaining) [2022-01-10 12:40:06,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (7 of 23 remaining) [2022-01-10 12:40:06,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (6 of 23 remaining) [2022-01-10 12:40:06,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (5 of 23 remaining) [2022-01-10 12:40:06,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (4 of 23 remaining) [2022-01-10 12:40:06,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (3 of 23 remaining) [2022-01-10 12:40:06,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (2 of 23 remaining) [2022-01-10 12:40:06,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (1 of 23 remaining) [2022-01-10 12:40:06,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION (0 of 23 remaining) [2022-01-10 12:40:06,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 12:40:06,864 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] [2022-01-10 12:40:06,868 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 12:40:07,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:40:07 BasicIcfg [2022-01-10 12:40:07,292 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 12:40:07,293 INFO L158 Benchmark]: Toolchain (without parser) took 9994.59ms. Allocated memory was 181.4MB in the beginning and 482.3MB in the end (delta: 300.9MB). Free memory was 126.6MB in the beginning and 441.2MB in the end (delta: -314.6MB). Peak memory consumption was 205.0MB. Max. memory is 8.0GB. [2022-01-10 12:40:07,293 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 181.4MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 12:40:07,293 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.46ms. Allocated memory is still 181.4MB. Free memory was 126.4MB in the beginning and 146.6MB in the end (delta: -20.2MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-01-10 12:40:07,293 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.61ms. Allocated memory is still 181.4MB. Free memory was 146.6MB in the beginning and 142.0MB in the end (delta: 4.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-10 12:40:07,293 INFO L158 Benchmark]: Boogie Preprocessor took 50.43ms. Allocated memory is still 181.4MB. Free memory was 142.0MB in the beginning and 138.3MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 12:40:07,294 INFO L158 Benchmark]: RCFGBuilder took 1026.80ms. Allocated memory is still 181.4MB. Free memory was 138.3MB in the beginning and 99.8MB in the end (delta: 38.5MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-01-10 12:40:07,294 INFO L158 Benchmark]: IcfgTransformer took 413.06ms. Allocated memory was 181.4MB in the beginning and 250.6MB in the end (delta: 69.2MB). Free memory was 99.8MB in the beginning and 163.8MB in the end (delta: -64.0MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. [2022-01-10 12:40:07,294 INFO L158 Benchmark]: TraceAbstraction took 8055.32ms. Allocated memory was 250.6MB in the beginning and 482.3MB in the end (delta: 231.7MB). Free memory was 163.3MB in the beginning and 441.2MB in the end (delta: -278.0MB). Peak memory consumption was 171.3MB. Max. memory is 8.0GB. [2022-01-10 12:40:07,296 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.09ms. Allocated memory is still 181.4MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 387.46ms. Allocated memory is still 181.4MB. Free memory was 126.4MB in the beginning and 146.6MB in the end (delta: -20.2MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.61ms. Allocated memory is still 181.4MB. Free memory was 146.6MB in the beginning and 142.0MB in the end (delta: 4.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.43ms. Allocated memory is still 181.4MB. Free memory was 142.0MB in the beginning and 138.3MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1026.80ms. Allocated memory is still 181.4MB. Free memory was 138.3MB in the beginning and 99.8MB in the end (delta: 38.5MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * IcfgTransformer took 413.06ms. Allocated memory was 181.4MB in the beginning and 250.6MB in the end (delta: 69.2MB). Free memory was 99.8MB in the beginning and 163.8MB in the end (delta: -64.0MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. * TraceAbstraction took 8055.32ms. Allocated memory was 250.6MB in the beginning and 482.3MB in the end (delta: 231.7MB). Free memory was 163.3MB in the beginning and 441.2MB in the end (delta: -278.0MB). Peak memory consumption was 171.3MB. 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: 619]: 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] [L542] int c1 ; [L543] int i2 ; [L546] c1 = 0 [L547] side1Failed = __VERIFIER_nondet_bool() [L548] side2Failed = __VERIFIER_nondet_bool() [L549] side1_written = __VERIFIER_nondet_char() [L550] side2_written = __VERIFIER_nondet_char() [L551] side1Failed_History_0 = __VERIFIER_nondet_bool() [L552] side1Failed_History_1 = __VERIFIER_nondet_bool() [L553] side1Failed_History_2 = __VERIFIER_nondet_bool() [L554] side2Failed_History_0 = __VERIFIER_nondet_bool() [L555] side2Failed_History_1 = __VERIFIER_nondet_bool() [L556] side2Failed_History_2 = __VERIFIER_nondet_bool() [L557] active_side_History_0 = __VERIFIER_nondet_char() [L558] active_side_History_1 = __VERIFIER_nondet_char() [L559] active_side_History_2 = __VERIFIER_nondet_char() [L560] manual_selection_History_0 = __VERIFIER_nondet_char() [L561] manual_selection_History_1 = __VERIFIER_nondet_char() [L562] manual_selection_History_2 = __VERIFIER_nondet_char() [L563] 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] [L563] RET, EXPR init() [L563] i2 = init() [L564] CALL assume_abort_if_not(i2) [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] [L564] RET assume_abort_if_not(i2) [L565] cs1_old = nomsg [L566] cs1_new = nomsg [L567] cs2_old = nomsg [L568] cs2_new = nomsg [L569] s1s2_old = nomsg [L570] s1s2_new = nomsg [L571] s1s1_old = nomsg [L572] s1s1_new = nomsg [L573] s2s1_old = nomsg [L574] s2s1_new = nomsg [L575] s2s2_old = nomsg [L576] s2s2_new = nomsg [L577] s1p_old = nomsg [L578] s1p_new = nomsg [L579] s2p_old = nomsg [L580] s2p_new = nomsg [L581] 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] [L582] COND TRUE i2 < 10 [L584] 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=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=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, 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=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=0, manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new=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, 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=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=255, cs2_old=255, manual_selection=0, manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new=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, 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=254, 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=255, manual_selection=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, tmp=0] [L584] RET Console_task_each_pals_period() [L585] 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=254, 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=255, 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=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, 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=254, 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=255, manual_selection=255, 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, side1=255, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=255, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L290] COND TRUE (int )side1 == (int )side2 [L291] next_state = (int8_t )1 VAL [active_side_History_0=254, 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=255, manual_selection=255, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=255, 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=254, 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=255, manual_selection=255, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new=-1, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=255, 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=254, 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=255, manual_selection=255, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new=-1, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=1, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=255, 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=254, 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=255, manual_selection=255, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new=-1, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=1, s1s1_old=255, s1s2=0, s1s2_new=1, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=255, 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=254, 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=255, manual_selection=255, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=255, s1p=0, s1p_new=1, s1p_old=255, s1s1=0, s1s1_new=1, s1s1_old=255, s1s2=0, s1s2_new=1, 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=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=255, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L585] RET Side1_activestandby_task_each_pals_period() [L586] 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=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=255, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=1, s1p_old=255, s1s1=0, s1s1_new=1, s1s1_old=255, s1s2=0, s1s2_new=1, 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=1, side1Failed=0, side1Failed_History_0=0, 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=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=255, manual_selection=255, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=1, s1p_old=255, s1s1=0, s1s1_new=1, s1s1_old=255, s1s2=0, s1s2_new=1, 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=1, side1Failed=0, side1Failed_History_0=0, 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 )1 VAL [active_side_History_0=254, 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=255, manual_selection=255, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=255, s1p=0, s1p_new=1, s1p_old=255, s1s1=0, s1s1_new=1, s1s1_old=255, s1s2=0, s1s2_new=1, 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=1, side1Failed=0, side1Failed_History_0=0, 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=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=255, manual_selection=255, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new=-1, nomsg=255, s1p=0, s1p_new=1, s1p_old=255, s1s1=0, s1s1_new=1, s1s1_old=255, s1s2=0, s1s2_new=1, 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=1, side1Failed=0, side1Failed_History_0=0, 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=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=255, manual_selection=255, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new=-1, nomsg=255, s1p=0, s1p_new=1, s1p_old=255, s1s1=0, s1s1_new=1, s1s1_old=255, s1s2=0, s1s2_new=1, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=1, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1=255, side1_written=1, side1Failed=0, side1Failed_History_0=0, 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=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=255, manual_selection=255, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new=-1, nomsg=255, s1p=0, s1p_new=1, s1p_old=255, s1s1=0, s1s1_new=1, s1s1_old=255, s1s2=0, s1s2_new=1, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=1, s2s1_old=255, s2s2=0, s2s2_new=1, s2s2_old=255, side1=255, side1_written=1, side1Failed=0, side1Failed_History_0=0, 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=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=255, manual_selection=255, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=255, s1p=0, s1p_new=1, s1p_old=255, s1s1=0, s1s1_new=1, s1s1_old=255, s1s2=0, s1s2_new=1, s1s2_old=255, s2p=0, s2p_new=1, s2p_old=255, s2s1=0, s2s1_new=1, s2s1_old=255, s2s2=0, s2s2_new=1, s2s2_old=255, side1=255, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=255, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L586] RET Side2_activestandby_task_each_pals_period() [L587] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; [L386] CALL, EXPR read_active_side_history((unsigned char)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=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=255, index=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=1, s1p_old=255, s1s1=0, s1s1_new=1, s1s1_old=255, s1s2=0, s1s2_new=1, s1s2_old=255, s2p=0, s2p_new=1, s2p_old=255, s2s1=0, s2s1_new=1, s2s1_old=255, s2s2=0, s2s2_new=1, s2s2_old=255, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_history((unsigned char)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=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=255, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=1, s1p_old=255, s1s1=0, s1s1_new=1, s1s1_old=255, s1s2=0, s1s2_new=1, s1s2_old=255, s2p=0, s2p_new=1, s2p_old=255, s2s1=0, s2s1_new=1, s2s1_old=255, s2s2=0, s2s2_new=1, s2s2_old=255, side1=255, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=255, side2_written=1, 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=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=255, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=1, s1p_old=255, s1s1=0, s1s1_new=1, s1s1_old=255, s1s2=0, s1s2_new=1, s1s2_old=255, s2p=0, s2p_new=1, s2p_old=255, s2s1=0, s2s1_new=1, s2s1_old=255, s2s2=0, s2s2_new=1, s2s2_old=255, side1=255, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=255, side2_written=1, 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=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=255, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=1, s1p_old=255, s1s1=0, s1s1_new=1, s1s1_old=255, s1s2=0, s1s2_new=1, s1s2_old=255, s2p=0, s2p_new=1, s2p_old=255, s2s1=0, s2s1_new=1, s2s1_old=255, s2s2=0, s2s2_new=1, s2s2_old=255, side1=255, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=255, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=254] [L400] COND FALSE !((int )side1 == 0) VAL [active_side=254, active_side_History_0=254, 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=255, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=1, s1p_old=255, s1s1=0, s1s1_new=1, s1s1_old=255, s1s2=0, s1s2_new=1, s1s2_old=255, s2p=0, s2p_new=1, s2p_old=255, s2s1=0, s2s1_new=1, s2s1_old=255, s2s2=0, s2s2_new=1, s2s2_old=255, side1=255, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=255, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=254] [L408] COND TRUE (int )side1 == (int )nomsg VAL [active_side=254, active_side_History_0=254, 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=255, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=1, s1p_old=255, s1s1=0, s1s1_new=1, s1s1_old=255, s1s2=0, s1s2_new=1, s1s2_old=255, s2p=0, s2p_new=1, s2p_old=255, s2s1=0, s2s1_new=1, s2s1_old=255, s2s2=0, s2s2_new=1, s2s2_old=255, side1=255, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=255, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=254] [L409] COND FALSE !((int )side2 == 0) [L412] 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=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=255, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=1, s1p_old=255, s1s1=0, s1s1_new=1, s1s1_old=255, s1s2=0, s1s2_new=1, s1s2_old=255, s2p=0, s2p_new=1, s2p_old=255, s2s1=0, s2s1_new=1, s2s1_old=255, s2s2=0, s2s2_new=1, s2s2_old=255, side1=255, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=255, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=254] [L417] 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=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=255, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=1, s1p_old=255, s1s1=0, s1s1_new=1, s1s1_old=255, s1s2=0, s1s2_new=1, s1s2_old=255, s2p=0, s2p_new=1, s2p_old=255, s2s1=0, s2s1_new=1, s2s1_old=255, s2s2=0, s2s2_new=1, s2s2_old=255, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] 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=0, cs2=0, cs2_new=255, cs2_old=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=1, s1s1=0, s1s1_new=255, s1s1_old=1, s1s2=0, s1s2_new=255, s1s2_old=1, s2p=0, s2p_new=255, s2p_old=1, s2s1=0, s2s1_new=255, s2s1_old=1, s2s2=0, s2s2_new=255, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L447] COND TRUE ! side1Failed [L448] 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=0, cs2=0, cs2_new=255, cs2_old=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=1, s1s1=0, s1s1_new=255, s1s1_old=1, s1s2=0, s1s2_new=255, s1s2_old=1, s2p=0, s2p_new=255, s2p_old=1, s2s1=0, s2s1_new=255, s2s1_old=1, s2s2=0, s2s2_new=255, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L455] CALL assume_abort_if_not((_Bool )tmp) [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=0, cs2=0, cs2_new=255, cs2_old=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=1, s1s1=0, s1s1_new=255, s1s1_old=1, s1s2=0, s1s2_new=255, s1s2_old=1, s2p=0, s2p_new=255, s2p_old=1, s2s1=0, s2s1_new=255, s2s1_old=1, s2s2=0, s2s2_new=255, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L455] RET assume_abort_if_not((_Bool )tmp) [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) [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=0, cs2=0, cs2_new=255, cs2_old=0, index=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=1, s1s1=0, s1s1_new=255, s1s1_old=1, s1s2=0, s1s2_new=255, s1s2_old=1, s2p=0, s2p_new=255, s2p_old=1, s2s1=0, s2s1_new=255, s2s1_old=1, s2s2=0, s2s2_new=255, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, 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=0, cs2=0, cs2_new=255, cs2_old=0, index=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=1, s1s1=0, s1s1_new=255, s1s1_old=1, s1s2=0, s1s2_new=255, s1s2_old=1, s2p=0, s2p_new=255, s2p_old=1, s2s1=0, s2s1_new=255, s2s1_old=1, s2s2=0, s2s2_new=255, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L456] RET, EXPR read_manual_selection_history((unsigned char)1) [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND TRUE ! tmp___0 [L458] CALL, EXPR read_side1_failed_history((unsigned char)1) [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=0, cs2=0, cs2_new=255, cs2_old=0, index=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=1, s1s1=0, s1s1_new=255, s1s1_old=1, s1s2=0, s1s2_new=255, s1s2_old=1, s2p=0, s2p_new=255, s2p_old=1, s2s1=0, s2s1_new=255, s2s1_old=1, s2s2=0, s2s2_new=255, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, 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=0, cs2=0, cs2_new=255, cs2_old=0, index=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=1, s1s1=0, s1s1_new=255, s1s1_old=1, s1s2=0, s1s2_new=255, s1s2_old=1, s2p=0, s2p_new=255, s2p_old=1, s2s1=0, s2s1_new=255, s2s1_old=1, s2s2=0, s2s2_new=255, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L458] RET, EXPR read_side1_failed_history((unsigned char)1) [L458] tmp___1 = read_side1_failed_history((unsigned char)1) [L459] COND TRUE ! tmp___1 [L460] CALL, EXPR read_side1_failed_history((unsigned char)0) [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_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=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, index=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=1, s1s1=0, s1s1_new=255, s1s1_old=1, s1s2=0, s1s2_new=255, s1s2_old=1, s2p=0, s2p_new=255, s2p_old=1, s2s1=0, s2s1_new=255, s2s1_old=1, s2s2=0, s2s2_new=255, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L460] RET, EXPR read_side1_failed_history((unsigned char)0) [L460] tmp___2 = read_side1_failed_history((unsigned char)0) [L461] COND TRUE ! tmp___2 [L462] CALL, EXPR read_side2_failed_history((unsigned char)1) [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=0, cs2=0, cs2_new=255, cs2_old=0, index=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=1, s1s1=0, s1s1_new=255, s1s1_old=1, s1s2=0, s1s2_new=255, s1s2_old=1, s2p=0, s2p_new=255, s2p_old=1, s2s1=0, s2s1_new=255, s2s1_old=1, s2s2=0, s2s2_new=255, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, 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=0, cs2=0, cs2_new=255, cs2_old=0, index=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=1, s1s1=0, s1s1_new=255, s1s1_old=1, s1s2=0, s1s2_new=255, s1s2_old=1, s2p=0, s2p_new=255, s2p_old=1, s2s1=0, s2s1_new=255, s2s1_old=1, s2s2=0, s2s2_new=255, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L462] RET, EXPR read_side2_failed_history((unsigned char)1) [L462] tmp___3 = read_side2_failed_history((unsigned char)1) [L463] COND TRUE ! tmp___3 [L464] CALL, EXPR read_side2_failed_history((unsigned char)0) [L118] COND TRUE (int )index == 0 [L119] return (side2Failed_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=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, index=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=1, s1s1=0, s1s1_new=255, s1s1_old=1, s1s2=0, s1s2_new=255, s1s2_old=1, s2p=0, s2p_new=255, s2p_old=1, s2s1=0, s2s1_new=255, s2s1_old=1, s2s2=0, s2s2_new=255, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L464] RET, EXPR read_side2_failed_history((unsigned char)0) [L464] tmp___4 = read_side2_failed_history((unsigned char)0) [L465] COND TRUE ! tmp___4 VAL [active_side_History_0=0, active_side_History_1=254, 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=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=1, s1s1=0, s1s1_new=255, s1s1_old=1, s1s2=0, s1s2_new=255, s1s2_old=1, s2p=0, s2p_new=255, s2p_old=1, s2s1=0, s2s1_new=255, s2s1_old=1, s2s2=0, s2s2_new=255, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L466] COND FALSE !(! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=254, 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=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=1, s1s1=0, s1s1_new=255, s1s1_old=1, s1s2=0, s1s2_new=255, s1s2_old=1, s2p=0, s2p_new=255, s2p_old=1, s2s1=0, s2s1_new=255, s2s1_old=1, s2s2=0, s2s2_new=255, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L471] COND FALSE !(! (! ((int )side1_written == 0))) VAL [active_side_History_0=0, active_side_History_1=254, 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=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=1, s1s1=0, s1s1_new=255, s1s1_old=1, s1s2=0, s1s2_new=255, s1s2_old=1, s2p=0, s2p_new=255, s2p_old=1, s2s1=0, s2s1_new=255, s2s1_old=1, s2s2=0, s2s2_new=255, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L476] COND TRUE ! (! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=254, 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=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=1, s1s1=0, s1s1_new=255, s1s1_old=1, s1s2=0, s1s2_new=255, s1s2_old=1, s2p=0, s2p_new=255, s2p_old=1, s2s1=0, s2s1_new=255, s2s1_old=1, s2s2=0, s2s2_new=255, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L477] COND TRUE ! ((int )side2_written == 0) [L478] return (0); VAL [\result=0, active_side_History_0=0, active_side_History_1=254, 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=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=1, s1s1=0, s1s1_new=255, s1s1_old=1, s1s2=0, s1s2_new=255, s1s2_old=1, s2p=0, s2p_new=255, s2p_old=1, s2s1=0, s2s1_new=255, s2s1_old=1, s2s2=0, s2s2_new=255, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) [L617] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=254, 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=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=1, s1s1=0, s1s1_new=255, s1s1_old=1, s1s2=0, s1s2_new=255, s1s2_old=1, s2p=0, s2p_new=255, s2p_old=1, s2s1=0, s2s1_new=255, s2s1_old=1, s2s2=0, s2s2_new=255, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L619] reach_error() VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=254, 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=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=1, s1s1=0, s1s1_new=255, s1s1_old=1, s1s2=0, s1s2_new=255, s1s2_old=1, s2p=0, s2p_new=255, s2p_old=1, s2s1=0, s2s1_new=255, s2s1_old=1, s2s2=0, s2s2_new=255, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] - UnprovableResult [Line: 619]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 301 locations, 23 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11430 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11430 mSDsluCounter, 22568 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13929 mSDsCounter, 156 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1068 IncrementalHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 156 mSolverCounterUnsat, 8639 mSDtfsCounter, 1068 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=661occurred in iteration=18, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 6059 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1301 NumberOfCodeBlocks, 1301 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1199 ConstructedInterpolants, 0 QuantifiedInterpolants, 2555 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 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 12:40:07,315 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...