/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi009_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 16:58:51,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 16:58:51,784 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 16:58:51,826 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 16:58:51,826 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 16:58:51,828 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 16:58:51,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 16:58:51,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 16:58:51,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 16:58:51,835 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 16:58:51,836 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 16:58:51,837 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 16:58:51,838 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 16:58:51,839 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 16:58:51,840 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 16:58:51,842 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 16:58:51,843 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 16:58:51,844 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 16:58:51,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 16:58:51,848 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 16:58:51,850 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 16:58:51,854 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 16:58:51,856 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 16:58:51,857 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 16:58:51,860 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 16:58:51,861 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 16:58:51,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 16:58:51,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 16:58:51,862 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 16:58:51,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 16:58:51,864 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 16:58:51,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 16:58:51,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 16:58:51,866 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 16:58:51,868 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 16:58:51,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 16:58:51,869 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 16:58:51,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 16:58:51,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 16:58:51,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 16:58:51,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 16:58:51,872 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf [2020-11-09 16:58:51,903 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 16:58:51,903 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 16:58:51,905 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 16:58:51,907 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 16:58:51,907 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 16:58:51,908 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 16:58:51,908 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 16:58:51,908 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 16:58:51,908 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 16:58:51,908 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 16:58:51,909 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 16:58:51,909 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 16:58:51,910 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 16:58:51,910 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 16:58:51,910 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 16:58:51,910 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 16:58:51,910 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 16:58:51,911 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 16:58:51,911 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 16:58:51,911 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 16:58:51,911 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 16:58:51,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 16:58:51,912 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 16:58:51,912 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 16:58:51,912 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 16:58:51,912 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 16:58:51,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 16:58:51,912 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 16:58:51,913 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 16:58:51,913 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 16:58:51,913 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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 [2020-11-09 16:58:52,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 16:58:52,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 16:58:52,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 16:58:52,356 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 16:58:52,357 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 16:58:52,358 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi009_rmo.opt.i [2020-11-09 16:58:52,436 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e509203b3/c1b5c3c5a36a42e68e1e6fe316adf62e/FLAG8e8376997 [2020-11-09 16:58:53,112 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 16:58:53,112 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi009_rmo.opt.i [2020-11-09 16:58:53,131 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e509203b3/c1b5c3c5a36a42e68e1e6fe316adf62e/FLAG8e8376997 [2020-11-09 16:58:53,424 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e509203b3/c1b5c3c5a36a42e68e1e6fe316adf62e [2020-11-09 16:58:53,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 16:58:53,437 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 16:58:53,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 16:58:53,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 16:58:53,443 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 16:58:53,444 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:58:53" (1/1) ... [2020-11-09 16:58:53,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c6afa49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:58:53, skipping insertion in model container [2020-11-09 16:58:53,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:58:53" (1/1) ... [2020-11-09 16:58:53,457 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 16:58:53,540 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 16:58:53,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 16:58:53,966 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 16:58:54,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 16:58:54,220 INFO L208 MainTranslator]: Completed translation [2020-11-09 16:58:54,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:58:54 WrapperNode [2020-11-09 16:58:54,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 16:58:54,223 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 16:58:54,223 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 16:58:54,224 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 16:58:54,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:58:54" (1/1) ... [2020-11-09 16:58:54,256 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:58:54" (1/1) ... [2020-11-09 16:58:54,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 16:58:54,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 16:58:54,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 16:58:54,300 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 16:58:54,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:58:54" (1/1) ... [2020-11-09 16:58:54,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:58:54" (1/1) ... [2020-11-09 16:58:54,321 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:58:54" (1/1) ... [2020-11-09 16:58:54,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:58:54" (1/1) ... [2020-11-09 16:58:54,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:58:54" (1/1) ... [2020-11-09 16:58:54,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:58:54" (1/1) ... [2020-11-09 16:58:54,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:58:54" (1/1) ... [2020-11-09 16:58:54,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 16:58:54,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 16:58:54,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 16:58:54,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 16:58:54,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:58:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 16:58:54,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 16:58:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 16:58:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 16:58:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 16:58:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 16:58:54,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 16:58:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 16:58:54,443 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 16:58:54,443 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 16:58:54,443 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 16:58:54,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 16:58:54,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 16:58:54,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 16:58:54,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 16:58:54,445 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 16:58:57,035 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 16:58:57,036 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 16:58:57,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:58:57 BoogieIcfgContainer [2020-11-09 16:58:57,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 16:58:57,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 16:58:57,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 16:58:57,043 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 16:58:57,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:58:53" (1/3) ... [2020-11-09 16:58:57,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca07013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:58:57, skipping insertion in model container [2020-11-09 16:58:57,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:58:54" (2/3) ... [2020-11-09 16:58:57,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca07013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:58:57, skipping insertion in model container [2020-11-09 16:58:57,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:58:57" (3/3) ... [2020-11-09 16:58:57,047 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi009_rmo.opt.i [2020-11-09 16:58:57,063 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 16:58:57,063 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 16:58:57,067 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 16:58:57,068 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 16:58:57,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,114 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,114 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,115 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,115 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,115 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,115 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,119 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,119 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,119 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,119 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,119 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,119 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,133 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,133 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,134 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,134 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,134 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,135 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,136 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,137 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,145 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,145 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,157 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,157 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,157 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,158 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,164 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,166 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,174 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,174 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,174 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,174 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,175 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,175 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,175 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,175 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,175 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,175 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,176 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,178 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,181 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,182 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,182 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,182 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,182 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,182 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,182 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:58:57,184 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 16:58:57,196 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-09 16:58:57,218 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 16:58:57,219 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 16:58:57,219 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 16:58:57,219 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 16:58:57,219 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 16:58:57,219 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 16:58:57,219 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 16:58:57,219 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 16:58:57,231 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 16:58:57,232 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 102 transitions, 219 flow [2020-11-09 16:58:57,235 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 102 transitions, 219 flow [2020-11-09 16:58:57,237 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 109 places, 102 transitions, 219 flow [2020-11-09 16:58:57,285 INFO L129 PetriNetUnfolder]: 3/99 cut-off events. [2020-11-09 16:58:57,285 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 16:58:57,290 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 99 events. 3/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2020-11-09 16:58:57,293 INFO L116 LiptonReduction]: Number of co-enabled transitions 1758 [2020-11-09 16:58:58,791 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-11-09 16:58:58,971 WARN L194 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-11-09 16:59:00,078 WARN L194 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-09 16:59:00,211 WARN L194 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 16:59:00,888 WARN L194 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2020-11-09 16:59:00,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 16:59:00,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:59:01,363 WARN L194 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2020-11-09 16:59:03,536 WARN L194 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2020-11-09 16:59:03,797 WARN L194 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2020-11-09 16:59:04,304 WARN L194 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-11-09 16:59:04,859 WARN L194 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2020-11-09 16:59:05,104 WARN L194 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-11-09 16:59:05,705 WARN L194 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2020-11-09 16:59:05,967 WARN L194 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-11-09 16:59:05,974 INFO L131 LiptonReduction]: Checked pairs total: 4389 [2020-11-09 16:59:05,975 INFO L133 LiptonReduction]: Total number of compositions: 89 [2020-11-09 16:59:05,983 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-11-09 16:59:06,028 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 626 states. [2020-11-09 16:59:06,031 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states. [2020-11-09 16:59:06,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-09 16:59:06,039 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:59:06,040 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-09 16:59:06,040 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:59:06,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:59:06,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1270223308, now seen corresponding path program 1 times [2020-11-09 16:59:06,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:59:06,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394747521] [2020-11-09 16:59:06,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:59:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:59:06,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:59:06,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394747521] [2020-11-09 16:59:06,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:59:06,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 16:59:06,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1288116013] [2020-11-09 16:59:06,347 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:59:06,350 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:59:06,363 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-11-09 16:59:06,364 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:59:06,369 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:59:06,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:59:06,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:59:06,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:59:06,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:59:06,391 INFO L87 Difference]: Start difference. First operand 626 states. Second operand 3 states. [2020-11-09 16:59:06,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:59:06,524 INFO L93 Difference]: Finished difference Result 538 states and 1644 transitions. [2020-11-09 16:59:06,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:59:06,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-11-09 16:59:06,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:59:06,564 INFO L225 Difference]: With dead ends: 538 [2020-11-09 16:59:06,565 INFO L226 Difference]: Without dead ends: 442 [2020-11-09 16:59:06,566 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:59:06,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-11-09 16:59:06,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2020-11-09 16:59:06,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-11-09 16:59:06,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1324 transitions. [2020-11-09 16:59:06,708 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1324 transitions. Word has length 5 [2020-11-09 16:59:06,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:59:06,709 INFO L481 AbstractCegarLoop]: Abstraction has 442 states and 1324 transitions. [2020-11-09 16:59:06,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:59:06,709 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1324 transitions. [2020-11-09 16:59:06,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 16:59:06,711 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:59:06,711 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:59:06,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 16:59:06,712 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:59:06,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:59:06,716 INFO L82 PathProgramCache]: Analyzing trace with hash 2120538893, now seen corresponding path program 1 times [2020-11-09 16:59:06,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:59:06,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035719787] [2020-11-09 16:59:06,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:59:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:59:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:59:06,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035719787] [2020-11-09 16:59:06,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:59:06,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 16:59:06,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [40751241] [2020-11-09 16:59:06,855 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:59:06,856 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:59:06,858 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-11-09 16:59:06,858 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:59:06,859 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:59:06,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:59:06,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:59:06,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:59:06,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:59:06,861 INFO L87 Difference]: Start difference. First operand 442 states and 1324 transitions. Second operand 3 states. [2020-11-09 16:59:06,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:59:06,872 INFO L93 Difference]: Finished difference Result 418 states and 1238 transitions. [2020-11-09 16:59:06,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:59:06,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-09 16:59:06,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:59:06,876 INFO L225 Difference]: With dead ends: 418 [2020-11-09 16:59:06,877 INFO L226 Difference]: Without dead ends: 418 [2020-11-09 16:59:06,877 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:59:06,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2020-11-09 16:59:06,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2020-11-09 16:59:06,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-11-09 16:59:06,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1238 transitions. [2020-11-09 16:59:06,894 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 1238 transitions. Word has length 9 [2020-11-09 16:59:06,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:59:06,895 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 1238 transitions. [2020-11-09 16:59:06,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:59:06,896 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 1238 transitions. [2020-11-09 16:59:06,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 16:59:06,897 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:59:06,898 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:59:06,898 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 16:59:06,898 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:59:06,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:59:06,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1992956334, now seen corresponding path program 1 times [2020-11-09 16:59:06,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:59:06,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185887602] [2020-11-09 16:59:06,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:59:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:59:06,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:59:06,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185887602] [2020-11-09 16:59:06,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:59:06,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 16:59:06,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1782159530] [2020-11-09 16:59:06,968 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:59:06,970 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:59:06,972 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2020-11-09 16:59:06,972 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:59:07,090 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:59:07,090 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:59:07,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:59:07,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:59:07,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:59:07,092 INFO L87 Difference]: Start difference. First operand 418 states and 1238 transitions. Second operand 4 states. [2020-11-09 16:59:07,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:59:07,134 INFO L93 Difference]: Finished difference Result 562 states and 1634 transitions. [2020-11-09 16:59:07,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 16:59:07,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-09 16:59:07,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:59:07,140 INFO L225 Difference]: With dead ends: 562 [2020-11-09 16:59:07,141 INFO L226 Difference]: Without dead ends: 304 [2020-11-09 16:59:07,141 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:59:07,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-11-09 16:59:07,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2020-11-09 16:59:07,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-11-09 16:59:07,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 872 transitions. [2020-11-09 16:59:07,154 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 872 transitions. Word has length 10 [2020-11-09 16:59:07,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:59:07,154 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 872 transitions. [2020-11-09 16:59:07,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:59:07,155 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 872 transitions. [2020-11-09 16:59:07,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 16:59:07,156 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:59:07,156 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:59:07,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 16:59:07,157 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:59:07,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:59:07,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2011264394, now seen corresponding path program 1 times [2020-11-09 16:59:07,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:59:07,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520221748] [2020-11-09 16:59:07,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:59:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:59:07,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:59:07,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520221748] [2020-11-09 16:59:07,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:59:07,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 16:59:07,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1568383533] [2020-11-09 16:59:07,232 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:59:07,235 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:59:07,238 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 19 transitions. [2020-11-09 16:59:07,238 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:59:07,390 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:59:07,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:59:07,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:59:07,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:59:07,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:59:07,392 INFO L87 Difference]: Start difference. First operand 304 states and 872 transitions. Second operand 3 states. [2020-11-09 16:59:07,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:59:07,408 INFO L93 Difference]: Finished difference Result 286 states and 812 transitions. [2020-11-09 16:59:07,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:59:07,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-09 16:59:07,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:59:07,411 INFO L225 Difference]: With dead ends: 286 [2020-11-09 16:59:07,411 INFO L226 Difference]: Without dead ends: 286 [2020-11-09 16:59:07,412 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:59:07,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2020-11-09 16:59:07,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2020-11-09 16:59:07,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2020-11-09 16:59:07,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 812 transitions. [2020-11-09 16:59:07,423 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 812 transitions. Word has length 11 [2020-11-09 16:59:07,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:59:07,424 INFO L481 AbstractCegarLoop]: Abstraction has 286 states and 812 transitions. [2020-11-09 16:59:07,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:59:07,424 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 812 transitions. [2020-11-09 16:59:07,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 16:59:07,426 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:59:07,426 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:59:07,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 16:59:07,427 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:59:07,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:59:07,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1581779438, now seen corresponding path program 1 times [2020-11-09 16:59:07,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:59:07,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988703822] [2020-11-09 16:59:07,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:59:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:59:07,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:59:07,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988703822] [2020-11-09 16:59:07,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:59:07,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:59:07,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [101555282] [2020-11-09 16:59:07,609 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:59:07,612 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:59:07,622 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 53 transitions. [2020-11-09 16:59:07,623 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:59:07,735 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:59:07,735 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:07,737 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:07,737 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:07,738 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:59:07,738 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:07,740 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:07,740 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:07,741 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:07,741 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:07,743 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:07,743 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:07,777 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:59:07,778 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:07,779 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:07,780 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:07,781 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:07,781 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:07,908 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:59:07,909 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:07,909 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:07,910 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:07,910 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:59:07,911 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:07,917 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:07,918 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:07,919 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:07,922 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:07,923 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:07,923 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:07,926 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:59:07,926 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:07,929 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:07,929 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:07,932 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:07,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,038 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:59:08,039 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,039 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,040 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,041 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,041 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,043 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,044 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,045 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,045 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,046 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,046 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,048 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:59:08,048 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,049 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,050 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,051 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,052 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:59:08,146 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:59:08,178 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:59:08,178 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,179 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,179 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,180 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,180 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,183 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,183 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,185 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,185 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,186 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,186 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,187 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:59:08,187 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,188 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,189 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,190 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,190 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,273 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:59:08,274 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,275 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,275 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,275 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,276 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,277 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,277 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,279 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,279 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,280 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,280 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,286 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:59:08,286 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,287 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,287 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,294 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,294 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,379 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:59:08,380 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,380 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,381 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,381 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,382 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,383 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,383 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,384 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,384 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,385 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,385 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,387 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:59:08,387 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,389 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,389 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,390 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,390 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,464 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:59:08,465 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,465 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,466 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,466 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,467 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,468 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,468 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,469 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,469 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,470 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,470 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,471 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:59:08,471 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,472 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,472 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,473 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,473 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,478 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:59:08,537 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:59:08,566 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:59:08,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:59:08,609 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:59:08,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:59:08,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:59:08,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:59:08,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:59:08,610 INFO L87 Difference]: Start difference. First operand 286 states and 812 transitions. Second operand 4 states. [2020-11-09 16:59:08,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:59:08,663 INFO L93 Difference]: Finished difference Result 282 states and 702 transitions. [2020-11-09 16:59:08,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 16:59:08,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-09 16:59:08,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:59:08,665 INFO L225 Difference]: With dead ends: 282 [2020-11-09 16:59:08,665 INFO L226 Difference]: Without dead ends: 204 [2020-11-09 16:59:08,666 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 8 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:59:08,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-11-09 16:59:08,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2020-11-09 16:59:08,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-11-09 16:59:08,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 494 transitions. [2020-11-09 16:59:08,673 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 494 transitions. Word has length 13 [2020-11-09 16:59:08,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:59:08,674 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 494 transitions. [2020-11-09 16:59:08,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:59:08,674 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 494 transitions. [2020-11-09 16:59:08,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 16:59:08,675 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:59:08,675 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:59:08,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 16:59:08,676 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:59:08,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:59:08,676 INFO L82 PathProgramCache]: Analyzing trace with hash -195659153, now seen corresponding path program 1 times [2020-11-09 16:59:08,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:59:08,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399355197] [2020-11-09 16:59:08,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:59:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:59:08,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:59:08,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399355197] [2020-11-09 16:59:08,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:59:08,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 16:59:08,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [7433470] [2020-11-09 16:59:08,817 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:59:08,849 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:59:08,866 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 39 transitions. [2020-11-09 16:59:08,866 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:59:08,875 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:59:08,875 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,876 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:59:08,876 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,877 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:59:08,877 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,919 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:59:08,919 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,920 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,920 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,920 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,921 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,922 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,922 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,923 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,923 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,924 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,925 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:59:08,925 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,926 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,926 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,927 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,927 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,998 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:59:08,998 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:08,999 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:08,999 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,000 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,000 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,001 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,001 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,002 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,002 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,003 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,003 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,004 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:59:09,004 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,005 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,005 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,006 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,007 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,079 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:59:09,080 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,080 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,080 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,081 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,081 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,082 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,082 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,083 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,083 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,084 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,084 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,085 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:59:09,085 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,086 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,087 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,087 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,088 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,146 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:59:09,146 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,147 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,147 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,148 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,148 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,149 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,149 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,150 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,150 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,151 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,151 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,152 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:59:09,152 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,153 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,153 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,154 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,154 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,226 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:59:09,234 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:59:09,234 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 16:59:09,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:59:09,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 16:59:09,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:59:09,235 INFO L87 Difference]: Start difference. First operand 204 states and 494 transitions. Second operand 5 states. [2020-11-09 16:59:09,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:59:09,287 INFO L93 Difference]: Finished difference Result 167 states and 361 transitions. [2020-11-09 16:59:09,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 16:59:09,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-09 16:59:09,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:59:09,289 INFO L225 Difference]: With dead ends: 167 [2020-11-09 16:59:09,289 INFO L226 Difference]: Without dead ends: 124 [2020-11-09 16:59:09,290 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 16:59:09,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-11-09 16:59:09,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2020-11-09 16:59:09,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-11-09 16:59:09,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 256 transitions. [2020-11-09 16:59:09,294 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 256 transitions. Word has length 15 [2020-11-09 16:59:09,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:59:09,294 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 256 transitions. [2020-11-09 16:59:09,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 16:59:09,295 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 256 transitions. [2020-11-09 16:59:09,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-09 16:59:09,295 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:59:09,296 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:59:09,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 16:59:09,296 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:59:09,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:59:09,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1447751137, now seen corresponding path program 1 times [2020-11-09 16:59:09,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:59:09,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422550340] [2020-11-09 16:59:09,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:59:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:59:09,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:59:09,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422550340] [2020-11-09 16:59:09,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:59:09,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 16:59:09,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1887035372] [2020-11-09 16:59:09,459 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:59:09,465 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:59:09,478 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 35 transitions. [2020-11-09 16:59:09,478 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:59:09,485 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:59:09,485 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,486 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:59:09,486 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,488 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:59:09,488 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,533 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:59:09,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,534 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,534 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,535 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,535 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,536 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,536 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,537 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,538 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,539 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,539 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,540 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:59:09,540 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,541 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,541 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,542 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,542 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,590 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:59:09,591 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,591 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,592 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,592 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,592 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,593 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,594 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,594 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,594 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,595 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,595 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,596 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:59:09,597 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,598 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,598 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,599 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,726 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:59:09,727 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,727 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,728 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,729 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,729 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,731 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,731 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,732 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,733 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,733 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,734 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,735 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:59:09,736 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,737 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,737 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,739 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,740 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,822 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:59:09,822 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,823 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,823 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,824 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,824 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,826 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,826 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,827 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,827 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,831 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,832 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,833 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:59:09,833 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,834 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,834 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,835 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:09,835 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:09,881 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:59:09,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 16:59:09,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:59:09,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 16:59:09,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 16:59:09,882 INFO L87 Difference]: Start difference. First operand 124 states and 256 transitions. Second operand 6 states. [2020-11-09 16:59:09,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:59:09,950 INFO L93 Difference]: Finished difference Result 108 states and 222 transitions. [2020-11-09 16:59:09,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 16:59:09,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-11-09 16:59:09,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:59:09,952 INFO L225 Difference]: With dead ends: 108 [2020-11-09 16:59:09,952 INFO L226 Difference]: Without dead ends: 97 [2020-11-09 16:59:09,952 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-09 16:59:09,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-11-09 16:59:09,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-11-09 16:59:09,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-11-09 16:59:09,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 202 transitions. [2020-11-09 16:59:09,957 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 202 transitions. Word has length 17 [2020-11-09 16:59:09,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:59:09,957 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 202 transitions. [2020-11-09 16:59:09,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 16:59:09,958 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 202 transitions. [2020-11-09 16:59:09,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-09 16:59:09,958 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:59:09,959 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:59:09,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 16:59:09,959 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:59:09,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:59:09,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1806335792, now seen corresponding path program 1 times [2020-11-09 16:59:09,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:59:09,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106967113] [2020-11-09 16:59:09,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:59:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:59:10,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:59:10,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106967113] [2020-11-09 16:59:10,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:59:10,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:59:10,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [306638865] [2020-11-09 16:59:10,087 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:59:10,094 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:59:10,115 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 55 transitions. [2020-11-09 16:59:10,115 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:59:10,126 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:59:10,127 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,127 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:59:10,128 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,128 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:59:10,129 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,155 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:59:10,155 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,156 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:59:10,156 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,157 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:59:10,157 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,211 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:59:10,212 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,213 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:10,213 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,213 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:59:10,213 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,214 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:10,214 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,215 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:10,215 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,216 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:10,216 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,217 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:59:10,217 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,218 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:10,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,219 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:10,219 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,251 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:59:10,251 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,252 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:59:10,252 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,253 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:59:10,253 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,272 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:59:10,272 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,273 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:59:10,273 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,274 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:59:10,274 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,312 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:59:10,312 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,313 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:10,313 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,313 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:59:10,313 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,314 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:10,315 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,315 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:10,315 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,316 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:10,316 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,317 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:59:10,317 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,318 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:10,319 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,319 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:10,319 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,371 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:59:10,372 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,372 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:10,373 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,373 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:59:10,373 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,374 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:10,374 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,375 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:10,375 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,376 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:10,376 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,377 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:59:10,377 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,378 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:10,378 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,378 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:59:10,379 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,443 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:59:10,443 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,444 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:59:10,444 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,445 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:59:10,445 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:10,461 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:59:10,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:59:10,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:59:10,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:59:10,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:59:10,463 INFO L87 Difference]: Start difference. First operand 97 states and 202 transitions. Second operand 4 states. [2020-11-09 16:59:10,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:59:10,484 INFO L93 Difference]: Finished difference Result 135 states and 279 transitions. [2020-11-09 16:59:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 16:59:10,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-11-09 16:59:10,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:59:10,486 INFO L225 Difference]: With dead ends: 135 [2020-11-09 16:59:10,486 INFO L226 Difference]: Without dead ends: 61 [2020-11-09 16:59:10,486 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:59:10,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-11-09 16:59:10,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-11-09 16:59:10,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-11-09 16:59:10,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 112 transitions. [2020-11-09 16:59:10,489 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 112 transitions. Word has length 20 [2020-11-09 16:59:10,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:59:10,489 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 112 transitions. [2020-11-09 16:59:10,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:59:10,489 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 112 transitions. [2020-11-09 16:59:10,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-09 16:59:10,489 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:59:10,490 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:59:10,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 16:59:10,490 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:59:10,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:59:10,490 INFO L82 PathProgramCache]: Analyzing trace with hash -2068662674, now seen corresponding path program 2 times [2020-11-09 16:59:10,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:59:10,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961478434] [2020-11-09 16:59:10,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:59:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:59:10,948 WARN L194 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 31 [2020-11-09 16:59:11,073 WARN L194 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 27 [2020-11-09 16:59:11,197 WARN L194 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 27 [2020-11-09 16:59:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:59:11,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961478434] [2020-11-09 16:59:11,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:59:11,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 16:59:11,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [473347131] [2020-11-09 16:59:11,239 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:59:11,245 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:59:11,261 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 42 transitions. [2020-11-09 16:59:11,261 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:59:11,276 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:59:11,276 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:11,277 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 3, 2, 1] term [2020-11-09 16:59:11,278 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:11,278 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:59:11,278 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:11,280 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:59:11,280 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:59:11,281 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 3, 3, 2, 1] term [2020-11-09 16:59:11,281 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:11,282 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 3, 3, 3, 3, 2, 2, 1] term [2020-11-09 16:59:11,282 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:59:11,284 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 2, 3, 3, 3, 3, 2, 2, 1] term [2020-11-09 16:59:11,285 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:59:14,660 WARN L194 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 170 DAG size of output: 60 [2020-11-09 16:59:14,708 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:59:14,709 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:14,710 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 3, 3, 2, 1] term [2020-11-09 16:59:14,710 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:14,711 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 3, 2, 2, 1] term [2020-11-09 16:59:14,711 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:14,713 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:59:14,713 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:59:14,714 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:59:14,715 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:14,715 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 4, 3, 4, 3, 3, 2, 2, 1] term [2020-11-09 16:59:14,715 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:59:14,717 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 3, 4, 3, 3, 2, 2, 1] term [2020-11-09 16:59:14,717 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:59:16,435 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:59:16,436 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:16,437 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 23, 6, 2, 3, 2, 1] term [2020-11-09 16:59:16,438 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:16,439 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 23, 6, 2, 1] term [2020-11-09 16:59:16,439 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:16,442 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 21, 6, 23, 6, 1] term [2020-11-09 16:59:16,443 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:59:16,445 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 23, 6, 2, 3, 2, 1] term [2020-11-09 16:59:16,445 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:16,486 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 5588 disjunctions. This might take some time... [2020-11-09 16:59:19,325 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 5588 disjunctions. [2020-11-09 16:59:21,513 WARN L194 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 168 DAG size of output: 62 [2020-11-09 16:59:21,533 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:59:21,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:21,535 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 3, 3, 2, 1] term [2020-11-09 16:59:21,535 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:21,536 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 3, 2, 2, 1] term [2020-11-09 16:59:21,536 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:21,537 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:59:21,537 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:59:21,538 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:59:21,538 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:21,539 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 4, 3, 4, 3, 3, 2, 2, 1] term [2020-11-09 16:59:21,539 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:59:21,541 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 3, 4, 3, 3, 2, 2, 1] term [2020-11-09 16:59:21,541 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:59:24,932 WARN L194 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 186 DAG size of output: 59 [2020-11-09 16:59:24,974 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:59:24,974 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:24,976 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 3, 3, 2, 1] term [2020-11-09 16:59:24,976 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:24,977 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 3, 2, 2, 1] term [2020-11-09 16:59:24,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:24,978 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:59:24,979 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:59:24,980 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:59:24,980 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:24,980 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 3, 4, 3, 3, 2, 2, 1] term [2020-11-09 16:59:24,981 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:59:24,982 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 4, 3, 4, 3, 3, 2, 2, 1] term [2020-11-09 16:59:24,982 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:59:26,771 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:59:26,771 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:26,772 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 4, 4, 3, 2, 1] term [2020-11-09 16:59:26,772 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:26,772 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 4, 1] term [2020-11-09 16:59:26,773 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:26,775 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 6, 4, 6, 3, 6, 3, 4, 1] term [2020-11-09 16:59:26,775 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:59:26,777 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 6, 4, 6, 3, 6, 3, 4, 1] term [2020-11-09 16:59:26,777 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:59:26,778 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 6, 4, 6, 3, 6, 3, 4, 1] term [2020-11-09 16:59:26,778 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:59:26,781 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 3, 4, 1] term [2020-11-09 16:59:26,781 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:26,783 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 3, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 3, 4, 1] term [2020-11-09 16:59:26,783 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:26,784 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 3, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 3, 4, 1] term [2020-11-09 16:59:26,784 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:26,787 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 3, 3, 4, 5, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 3, 4, 1] term [2020-11-09 16:59:26,788 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:26,790 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 3, 3, 4, 5, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 3, 4, 1] term [2020-11-09 16:59:26,791 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:26,793 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 3, 3, 4, 5, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 3, 4, 1] term [2020-11-09 16:59:26,793 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:26,796 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[8, 6, 5, 4, 5, 3, 3, 2, 1] term [2020-11-09 16:59:26,796 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:26,801 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 5, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 3, 5, 3, 4, 1] term [2020-11-09 16:59:26,801 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:26,804 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 5, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 3, 5, 3, 4, 1] term [2020-11-09 16:59:26,804 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:28,618 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:59:28,618 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:28,619 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 4, 4, 3, 2, 1] term [2020-11-09 16:59:28,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:28,619 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 4, 1] term [2020-11-09 16:59:28,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:28,622 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 6, 4, 6, 3, 6, 3, 4, 1] term [2020-11-09 16:59:28,622 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:59:28,623 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 6, 4, 6, 3, 6, 3, 4, 1] term [2020-11-09 16:59:28,623 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:59:28,624 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 6, 4, 6, 3, 6, 3, 4, 1] term [2020-11-09 16:59:28,624 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:59:28,627 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 3, 4, 1] term [2020-11-09 16:59:28,627 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:28,629 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 3, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 3, 4, 1] term [2020-11-09 16:59:28,629 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:28,630 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 3, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 3, 4, 1] term [2020-11-09 16:59:28,631 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:28,634 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 3, 3, 4, 5, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 3, 4, 1] term [2020-11-09 16:59:28,634 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:28,638 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 3, 3, 4, 5, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 3, 4, 1] term [2020-11-09 16:59:28,639 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:28,640 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 3, 3, 4, 5, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 3, 4, 1] term [2020-11-09 16:59:28,641 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:28,644 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[8, 6, 5, 4, 5, 3, 3, 2, 1] term [2020-11-09 16:59:28,644 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:28,649 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 5, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 3, 5, 3, 4, 1] term [2020-11-09 16:59:28,649 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:28,651 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 5, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 3, 5, 3, 4, 1] term [2020-11-09 16:59:28,652 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:59:30,992 WARN L194 SmtUtils]: Spent 714.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 37 [2020-11-09 16:59:31,062 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [7782#(and (or (not (= (mod ~y$r_buff1_thd3~0 256) 0)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= (mod ~y$w_buff0_used~0 256) 0) (= 0 (mod ~y$r_buff0_thd3~0 256)) (= ~__unbuffered_p1_EAX~0 ~y$w_buff0~0)) (or (not (= (mod ~y$r_buff1_thd3~0 256) 0)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= (mod ~y$w_buff0_used~0 256) 0) (= 0 (mod ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd1~0 0)) (or (= ~y~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0)) (= ~y$r_buff1_thd1~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1))) (or (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y~0 ~__unbuffered_p1_EAX~0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 1) (< 0 (+ (div ~y$w_buff1_used~0 256) 1))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= 0 (mod ~y$r_buff0_thd3~0 256)) (not (= (mod ~y$w_buff1_used~0 256) 0)) (= ~__unbuffered_p1_EAX~0 ~y$w_buff0~0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1))) (or (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (= ~y~0 ~__unbuffered_p1_EAX~0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1))) (or (= ~y~0 ~y$w_buff0~0) (= ~y~0 ~__unbuffered_p1_EAX~0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (= (mod ~y$r_buff1_thd3~0 256) 0) (not (= (mod ~y$w_buff0_used~0 256) 0)) (= (mod ~y$w_buff1_used~0 256) 0)) (or (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (= ~y~0 ~__unbuffered_p1_EAX~0)) (or (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (= ~y~0 0) (= ~y$r_buff1_thd1~0 0)) (or (= ~y~0 0) (= ~y$w_buff0~0 1) (not (= (mod ~y$w_buff0_used~0 256) 0)) (< 0 (+ (div ~y$w_buff1_used~0 256) 1))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= 0 (mod ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (not (= (mod ~y$w_buff1_used~0 256) 0)) (= ~y$w_buff0~0 1) (< 0 (+ (div ~y$w_buff1_used~0 256) 1))) (or (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 1)) (or (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 1) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0)) (= ~y$r_buff1_thd1~0 0)) (or (= (mod ~y$w_buff0_used~0 256) 0) (= 0 (mod ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (not (= (mod ~y$w_buff1_used~0 256) 0)) (= ~y$r_buff1_thd1~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1))) (or (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (= ~y~0 ~y$w_buff0~0) (= ~y~0 ~__unbuffered_p1_EAX~0)) (or (= ~y$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 ~y$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0)) (or (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (= (mod ~y$r_buff1_thd3~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0)) (or (= ~y~0 ~__unbuffered_p1_EAX~0) (not (= (mod ~y$w_buff0_used~0 256) 0)) (< 0 (+ (div ~y$w_buff1_used~0 256) 1))) (or (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (= ~y~0 0) (= ~y$r_buff1_thd1~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1))) (or (not (= (mod ~y$r_buff1_thd3~0 256) 0)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= (mod ~y$w_buff0_used~0 256) 0) (= 0 (mod ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$w_buff0~0 1))), 7783#(and (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd1~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y$w_buff0~0 0) (= ~y$w_buff0~0 1) (< 0 (+ (div ~y$w_buff1_used~0 256) 1))) (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (= (mod ~y$w_buff1_used~0 256) 0)) (or (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (= ~y~0 0) (= ~y$r_buff1_thd1~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1))) (or (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (= ~y~0 0) (= ~y$w_buff0~0 1) (< 0 (+ (div ~y$w_buff1_used~0 256) 1))) (or (= ~y~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0)) (= ~y$r_buff1_thd1~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd2~0 256) 0) (= ~__unbuffered_p1_EAX~0 ~y$w_buff0~0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1))) (or (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (= ~y~0 ~y$w_buff0~0) (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (= ~y~0 ~__unbuffered_p1_EAX~0)) (or (= (mod ~y$w_buff0_used~0 256) 0) (= 0 (mod ~y$r_buff0_thd3~0 256)) (not (= (mod ~y$w_buff1_used~0 256) 0)) (= ~__unbuffered_p1_EAX~0 ~y$w_buff0~0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1))) (or (= ~y~0 ~y$w_buff0~0) (= ~y~0 ~__unbuffered_p1_EAX~0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (= ~y~0 ~__unbuffered_p1_EAX~0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1))) (or (= ~y~0 0) (= ~y$w_buff0~0 1) (not (= (mod ~y$w_buff0_used~0 256) 0)) (< 0 (+ (div ~y$w_buff1_used~0 256) 1))) (or (not (= (mod ~y$r_buff1_thd3~0 256) 0)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0) (= ~y$w_buff0~0 1)) (or (= (mod ~y$w_buff0_used~0 256) 0) (= 0 (mod ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (not (= (mod ~y$w_buff1_used~0 256) 0)) (= ~y$w_buff0~0 1) (< 0 (+ (div ~y$w_buff1_used~0 256) 1))) (or (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (= (mod ~y$w_buff1_used~0 256) 0)) (or (= (mod ~y$w_buff0_used~0 256) 0) (= 0 (mod ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (not (= (mod ~y$w_buff1_used~0 256) 0)) (= ~y$r_buff1_thd1~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1))) (or (not (= (mod ~y$r_buff1_thd3~0 256) 0)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~__unbuffered_p1_EAX~0 ~y$w_buff0~0)) (or (not (= (mod ~y$r_buff1_thd3~0 256) 0)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd1~0 0)) (or (= ~y$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 ~y$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0)) (or (= (mod ~y$r_buff1_thd3~0 256) 0) (= (mod ~y$r_buff0_thd2~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0)) (or (= ~y~0 ~__unbuffered_p1_EAX~0) (not (= (mod ~y$w_buff0_used~0 256) 0)) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)))), 7784#(and (or (<= 0 ~y$w_buff1_used~0) (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (= ~y~0 0) (= ~y$w_buff0~0 1)) (or (<= ~y$w_buff1_used~0 0) (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (= ~y~0 0) (= ~y$w_buff0~0 1)) (or (= (mod ~y$w_buff0_used~0 256) 0) (<= 0 ~y$w_buff1_used~0) (= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y$w_buff0~0 0) (= ~y$w_buff0~0 1)) (or (= (mod ~y$w_buff0_used~0 256) 0) (<= ~y$w_buff1_used~0 0) (= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd1~0 0)) (= ~y$r_buff0_thd3~0 0) (or (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (= (mod ~y$w_buff1_used~0 256) 0)) (or (<= 0 ~y$w_buff1_used~0) (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (= ~y~0 ~__unbuffered_p1_EAX~0)) (or (<= ~y$w_buff1_used~0 0) (= ~y~0 ~__unbuffered_p1_EAX~0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (<= ~y$w_buff1_used~0 0) (= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y$w_buff0~0 0) (= ~y$w_buff0~0 1)) (= ~y$r_buff1_thd3~0 0) (or (= (mod ~y$w_buff0_used~0 256) 0) (<= 0 ~y$w_buff1_used~0) (= (mod ~y$r_buff0_thd2~0 256) 0) (= ~__unbuffered_p1_EAX~0 ~y$w_buff0~0)) (or (<= ~y$w_buff1_used~0 0) (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (= ~y~0 0) (= ~y$r_buff1_thd1~0 0)) (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (= (mod ~y$w_buff1_used~0 256) 0)) (or (= ~y~0 ~y$w_buff0~0) (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (= ~y~0 ~__unbuffered_p1_EAX~0)) (or (<= 0 ~y$w_buff1_used~0) (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (= ~y~0 0) (= ~y$r_buff1_thd1~0 0)) (or (= ~y~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0)) (= ~y$r_buff1_thd1~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1))) (or (= (mod ~y$w_buff0_used~0 256) 0) (<= 0 ~y$w_buff1_used~0) (= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd1~0 0)) (or (= ~y~0 ~y$w_buff0~0) (= ~y~0 ~__unbuffered_p1_EAX~0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (<= ~y$w_buff1_used~0 0) (= (mod ~y$r_buff0_thd2~0 256) 0) (= ~__unbuffered_p1_EAX~0 ~y$w_buff0~0)) (or (<= ~y$w_buff1_used~0 0) (= ~y~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0)) (= ~y$r_buff1_thd1~0 0)) (or (<= ~y$w_buff1_used~0 0) (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (= ~y~0 ~__unbuffered_p1_EAX~0)) (or (<= 0 ~y$w_buff1_used~0) (= ~y~0 0) (= ~y$w_buff0~0 1) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (<= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 1) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (= ~y$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 ~y$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0)) (or (<= 0 ~y$w_buff1_used~0) (= ~y~0 ~__unbuffered_p1_EAX~0) (not (= (mod ~y$w_buff0_used~0 256) 0)))), 7785#(and (or (= ~y~0 ~y$w_buff0~0) (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd2~0 256) 0) (<= 1 ~y$w_buff0_used~0)) (or (= ~y~0 ~y$w_buff0~0) (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y$r_buff0_thd2~0 1)) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y$w_buff0~0 0) (= ~y$w_buff0~0 1)) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd1~0 0)) (or (= ~y~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y$r_buff1_thd1~0 0)) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (or (= ~y~0 ~y$w_buff0~0) (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y~0 0)) (or (= ~y~0 0) (= ~y$w_buff0~0 1)) (or (= ~y~0 ~y$w_buff0~0) (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd2~0 256) 0) (<= (div ~y$w_buff0_used~0 256) 0)) (or (= ~y~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff1_thd1~0 0))), 7786#(and (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (= ~y$r_buff0_thd3~0 0)) (or (= ~y$w_buff0_used~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (= ~y$r_buff0_thd1~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (= ~y~0 1) (= ~y~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))))] [2020-11-09 16:59:31,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-09 16:59:31,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:59:31,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-09 16:59:31,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-11-09 16:59:31,065 INFO L87 Difference]: Start difference. First operand 61 states and 112 transitions. Second operand 13 states. [2020-11-09 16:59:31,190 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 16 [2020-11-09 16:59:31,644 WARN L194 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2020-11-09 16:59:32,090 WARN L194 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 41 [2020-11-09 16:59:32,542 WARN L194 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2020-11-09 16:59:32,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:59:32,624 INFO L93 Difference]: Finished difference Result 75 states and 134 transitions. [2020-11-09 16:59:32,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 16:59:32,625 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2020-11-09 16:59:32,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:59:32,626 INFO L225 Difference]: With dead ends: 75 [2020-11-09 16:59:32,626 INFO L226 Difference]: Without dead ends: 43 [2020-11-09 16:59:32,627 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2020-11-09 16:59:32,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-11-09 16:59:32,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-11-09 16:59:32,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-11-09 16:59:32,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 68 transitions. [2020-11-09 16:59:32,630 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 68 transitions. Word has length 20 [2020-11-09 16:59:32,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:59:32,630 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 68 transitions. [2020-11-09 16:59:32,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-09 16:59:32,630 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 68 transitions. [2020-11-09 16:59:32,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-09 16:59:32,631 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:59:32,631 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:59:32,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 16:59:32,631 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:59:32,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:59:32,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1770878326, now seen corresponding path program 3 times [2020-11-09 16:59:32,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:59:32,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815108562] [2020-11-09 16:59:32,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:59:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 16:59:32,739 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 16:59:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 16:59:32,802 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 16:59:32,844 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 16:59:32,844 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 16:59:32,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 16:59:32,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 04:59:32 BasicIcfg [2020-11-09 16:59:32,973 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 16:59:32,975 INFO L168 Benchmark]: Toolchain (without parser) took 39542.70 ms. Allocated memory was 158.3 MB in the beginning and 733.0 MB in the end (delta: 574.6 MB). Free memory was 132.6 MB in the beginning and 551.0 MB in the end (delta: -418.4 MB). Peak memory consumption was 156.6 MB. Max. memory is 8.0 GB. [2020-11-09 16:59:32,975 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 125.8 MB. Free memory was 103.6 MB in the beginning and 103.5 MB in the end (delta: 131.1 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 16:59:32,976 INFO L168 Benchmark]: CACSL2BoogieTranslator took 782.37 ms. Allocated memory is still 158.3 MB. Free memory was 132.2 MB in the beginning and 126.3 MB in the end (delta: 5.9 MB). Peak memory consumption was 27.8 MB. Max. memory is 8.0 GB. [2020-11-09 16:59:32,977 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.95 ms. Allocated memory is still 158.3 MB. Free memory was 126.3 MB in the beginning and 123.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 16:59:32,977 INFO L168 Benchmark]: Boogie Preprocessor took 51.06 ms. Allocated memory is still 158.3 MB. Free memory was 123.2 MB in the beginning and 121.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 16:59:32,978 INFO L168 Benchmark]: RCFGBuilder took 2686.64 ms. Allocated memory was 158.3 MB in the beginning and 190.8 MB in the end (delta: 32.5 MB). Free memory was 121.0 MB in the beginning and 115.4 MB in the end (delta: 5.5 MB). Peak memory consumption was 88.9 MB. Max. memory is 8.0 GB. [2020-11-09 16:59:32,979 INFO L168 Benchmark]: TraceAbstraction took 35933.54 ms. Allocated memory was 190.8 MB in the beginning and 733.0 MB in the end (delta: 542.1 MB). Free memory was 114.9 MB in the beginning and 551.0 MB in the end (delta: -436.1 MB). Peak memory consumption was 106.0 MB. Max. memory is 8.0 GB. [2020-11-09 16:59:32,983 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.22 ms. Allocated memory is still 125.8 MB. Free memory was 103.6 MB in the beginning and 103.5 MB in the end (delta: 131.1 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 782.37 ms. Allocated memory is still 158.3 MB. Free memory was 132.2 MB in the beginning and 126.3 MB in the end (delta: 5.9 MB). Peak memory consumption was 27.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 75.95 ms. Allocated memory is still 158.3 MB. Free memory was 126.3 MB in the beginning and 123.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 51.06 ms. Allocated memory is still 158.3 MB. Free memory was 123.2 MB in the beginning and 121.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2686.64 ms. Allocated memory was 158.3 MB in the beginning and 190.8 MB in the end (delta: 32.5 MB). Free memory was 121.0 MB in the beginning and 115.4 MB in the end (delta: 5.5 MB). Peak memory consumption was 88.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 35933.54 ms. Allocated memory was 190.8 MB in the beginning and 733.0 MB in the end (delta: 542.1 MB). Free memory was 114.9 MB in the beginning and 551.0 MB in the end (delta: -436.1 MB). Peak memory consumption was 106.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 941 VarBasedMoverChecksPositive, 32 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 88 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.7s, 109 PlacesBefore, 35 PlacesAfterwards, 102 TransitionsBefore, 25 TransitionsAfterwards, 1758 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 3 ChoiceCompositions, 89 TotalNumberOfCompositions, 4389 MoverChecksTotal - CounterExampleResult [Line: 18]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p1_EAX = 0; [L718] 0 int __unbuffered_p1_EBX = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff1_thd0; [L732] 0 _Bool y$r_buff1_thd1; [L733] 0 _Bool y$r_buff1_thd2; [L734] 0 _Bool y$r_buff1_thd3; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1752; [L845] FCALL, FORK 0 pthread_create(&t1752, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L846] 0 pthread_t t1753; [L847] FCALL, FORK 0 pthread_create(&t1753, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L848] 0 pthread_t t1754; [L774] 2 y$w_buff1 = y$w_buff0 [L775] 2 y$w_buff0 = 1 [L776] 2 y$w_buff1_used = y$w_buff0_used [L777] 2 y$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L779] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 2 y$flush_delayed = weak$$choice2 [L789] 2 y$mem_tmp = y [L790] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 [L790] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L790] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L791] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L791] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L792] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L792] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L793] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L793] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L794] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L795] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L795] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L796] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L796] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L797] 2 __unbuffered_p1_EAX = y [L798] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L798] 2 y = y$flush_delayed ? y$mem_tmp : y [L799] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1754, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L819] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 y$flush_delayed = weak$$choice2 [L752] 1 y$mem_tmp = y [L753] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L753] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L754] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L754] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L755] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L755] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L756] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L756] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L757] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L758] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L759] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = y [L761] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L761] 1 y = y$flush_delayed ? y$mem_tmp : y [L762] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L805] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L805] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L806] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L806] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L807] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L807] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L808] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L809] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L809] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L812] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L814] 2 return 0; [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L862] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L19] COND TRUE 0 !expression [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "rfi009_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 100 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 35.6s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.8s, HoareTripleCheckerStatistics: 195 SDtfs, 246 SDslu, 340 SDs, 0 SdLazy, 182 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 60 SyntacticMatches, 16 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=626occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 111 ConstructedInterpolants, 0 QuantifiedInterpolants, 13162 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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! Received shutdown request...