/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix037_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:22:44,767 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:22:44,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:22:44,786 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:22:44,787 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:22:44,788 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:22:44,789 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:22:44,791 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:22:44,793 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:22:44,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:22:44,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:22:44,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:22:44,796 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:22:44,797 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:22:44,797 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:22:44,799 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:22:44,799 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:22:44,800 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:22:44,802 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:22:44,804 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:22:44,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:22:44,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:22:44,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:22:44,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:22:44,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:22:44,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:22:44,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:22:44,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:22:44,812 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:22:44,813 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:22:44,813 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:22:44,813 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:22:44,814 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:22:44,815 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:22:44,816 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:22:44,816 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:22:44,817 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:22:44,817 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:22:44,817 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:22:44,818 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:22:44,819 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:22:44,819 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:22:44,833 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:22:44,834 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:22:44,835 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:22:44,835 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:22:44,835 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:22:44,836 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:22:44,836 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:22:44,836 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:22:44,836 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:22:44,836 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:22:44,836 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:22:44,837 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:22:44,837 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:22:44,837 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:22:44,837 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:22:44,837 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:22:44,838 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:22:44,838 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:22:44,838 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:22:44,838 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:22:44,838 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:22:44,839 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:22:44,839 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:22:44,839 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:22:44,839 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:22:44,839 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:22:44,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:22:44,840 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:22:44,840 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:22:45,103 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:22:45,117 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:22:45,120 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:22:45,122 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:22:45,122 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:22:45,123 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_pso.opt.i [2019-12-27 02:22:45,189 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71c3b874a/379611c4c171472ca4448e684400c0b7/FLAGf2fb5c85d [2019-12-27 02:22:45,696 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:22:45,696 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_pso.opt.i [2019-12-27 02:22:45,726 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71c3b874a/379611c4c171472ca4448e684400c0b7/FLAGf2fb5c85d [2019-12-27 02:22:46,041 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71c3b874a/379611c4c171472ca4448e684400c0b7 [2019-12-27 02:22:46,049 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:22:46,051 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:22:46,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:22:46,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:22:46,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:22:46,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:22:46" (1/1) ... [2019-12-27 02:22:46,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fdaac8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:22:46, skipping insertion in model container [2019-12-27 02:22:46,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:22:46" (1/1) ... [2019-12-27 02:22:46,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:22:46,128 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:22:46,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:22:46,699 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:22:46,756 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:22:46,834 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:22:46,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:22:46 WrapperNode [2019-12-27 02:22:46,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:22:46,835 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:22:46,836 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:22:46,836 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:22:46,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:22:46" (1/1) ... [2019-12-27 02:22:46,872 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:22:46" (1/1) ... [2019-12-27 02:22:46,909 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:22:46,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:22:46,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:22:46,910 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:22:46,920 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:22:46" (1/1) ... [2019-12-27 02:22:46,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:22:46" (1/1) ... [2019-12-27 02:22:46,925 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:22:46" (1/1) ... [2019-12-27 02:22:46,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:22:46" (1/1) ... [2019-12-27 02:22:46,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:22:46" (1/1) ... [2019-12-27 02:22:46,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:22:46" (1/1) ... [2019-12-27 02:22:46,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:22:46" (1/1) ... [2019-12-27 02:22:46,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:22:46,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:22:46,949 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:22:46,949 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:22:46,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:22:46" (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 [2019-12-27 02:22:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:22:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:22:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:22:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:22:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:22:47,009 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:22:47,010 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:22:47,010 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:22:47,010 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:22:47,010 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:22:47,010 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 02:22:47,011 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 02:22:47,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:22:47,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:22:47,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:22:47,013 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:22:47,785 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:22:47,786 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:22:47,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:22:47 BoogieIcfgContainer [2019-12-27 02:22:47,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:22:47,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:22:47,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:22:47,795 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:22:47,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:22:46" (1/3) ... [2019-12-27 02:22:47,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e3949d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:22:47, skipping insertion in model container [2019-12-27 02:22:47,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:22:46" (2/3) ... [2019-12-27 02:22:47,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e3949d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:22:47, skipping insertion in model container [2019-12-27 02:22:47,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:22:47" (3/3) ... [2019-12-27 02:22:47,800 INFO L109 eAbstractionObserver]: Analyzing ICFG mix037_pso.opt.i [2019-12-27 02:22:47,808 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:22:47,809 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:22:47,816 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:22:47,817 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:22:47,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,861 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,861 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,864 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,864 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,869 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,869 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,903 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,904 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,904 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,904 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,904 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,905 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,905 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,922 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,922 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,922 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,923 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,923 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,923 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,923 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,923 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,924 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,924 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,924 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,924 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,924 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,925 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,925 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,925 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,925 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,926 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,926 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,926 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,926 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,926 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,927 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,927 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,927 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,927 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,927 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,931 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,931 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,936 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,938 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,942 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,942 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,942 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,943 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,943 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,943 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,943 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,943 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,943 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,944 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,944 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,944 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,946 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,947 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:22:47,962 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 02:22:47,983 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:22:47,983 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:22:47,983 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:22:47,984 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:22:47,984 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:22:47,984 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:22:47,984 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:22:47,984 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:22:48,001 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-27 02:22:48,003 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-27 02:22:48,100 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-27 02:22:48,101 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:22:48,116 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 02:22:48,138 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-27 02:22:48,188 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-27 02:22:48,188 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:22:48,195 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 02:22:48,211 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-27 02:22:48,212 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:22:53,083 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 02:22:53,211 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 02:22:53,829 WARN L192 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-27 02:22:53,987 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-27 02:22:54,005 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44168 [2019-12-27 02:22:54,005 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-27 02:22:54,009 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 78 transitions [2019-12-27 02:22:55,233 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 21398 states. [2019-12-27 02:22:55,235 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states. [2019-12-27 02:22:55,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 02:22:55,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:22:55,244 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:22:55,244 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:22:55,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:22:55,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1244651740, now seen corresponding path program 1 times [2019-12-27 02:22:55,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:22:55,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737992200] [2019-12-27 02:22:55,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:22:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:22:55,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:22:55,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737992200] [2019-12-27 02:22:55,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:22:55,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:22:55,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094148966] [2019-12-27 02:22:55,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:22:55,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:22:55,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:22:55,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:22:55,582 INFO L87 Difference]: Start difference. First operand 21398 states. Second operand 3 states. [2019-12-27 02:22:55,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:22:55,988 INFO L93 Difference]: Finished difference Result 20958 states and 90416 transitions. [2019-12-27 02:22:55,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:22:55,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 02:22:55,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:22:56,188 INFO L225 Difference]: With dead ends: 20958 [2019-12-27 02:22:56,188 INFO L226 Difference]: Without dead ends: 19662 [2019-12-27 02:22:56,190 INFO L631 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 [2019-12-27 02:22:57,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2019-12-27 02:22:57,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 19662. [2019-12-27 02:22:57,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19662 states. [2019-12-27 02:22:58,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19662 states to 19662 states and 84692 transitions. [2019-12-27 02:22:58,088 INFO L78 Accepts]: Start accepts. Automaton has 19662 states and 84692 transitions. Word has length 9 [2019-12-27 02:22:58,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:22:58,089 INFO L462 AbstractCegarLoop]: Abstraction has 19662 states and 84692 transitions. [2019-12-27 02:22:58,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:22:58,090 INFO L276 IsEmpty]: Start isEmpty. Operand 19662 states and 84692 transitions. [2019-12-27 02:22:58,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 02:22:58,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:22:58,108 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:22:58,108 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:22:58,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:22:58,109 INFO L82 PathProgramCache]: Analyzing trace with hash -6792795, now seen corresponding path program 1 times [2019-12-27 02:22:58,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:22:58,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835050590] [2019-12-27 02:22:58,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:22:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:22:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:22:58,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835050590] [2019-12-27 02:22:58,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:22:58,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:22:58,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602191459] [2019-12-27 02:22:58,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:22:58,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:22:58,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:22:58,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:22:58,288 INFO L87 Difference]: Start difference. First operand 19662 states and 84692 transitions. Second operand 4 states. [2019-12-27 02:22:58,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:22:58,734 INFO L93 Difference]: Finished difference Result 30494 states and 126452 transitions. [2019-12-27 02:22:58,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:22:58,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 02:22:58,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:22:58,891 INFO L225 Difference]: With dead ends: 30494 [2019-12-27 02:22:58,891 INFO L226 Difference]: Without dead ends: 30438 [2019-12-27 02:22:58,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:23:00,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30438 states. [2019-12-27 02:23:01,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30438 to 27742. [2019-12-27 02:23:01,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-12-27 02:23:01,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 116300 transitions. [2019-12-27 02:23:01,496 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 116300 transitions. Word has length 15 [2019-12-27 02:23:01,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:01,497 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 116300 transitions. [2019-12-27 02:23:01,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:23:01,497 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 116300 transitions. [2019-12-27 02:23:01,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 02:23:01,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:01,504 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:23:01,505 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:23:01,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:01,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1479332799, now seen corresponding path program 1 times [2019-12-27 02:23:01,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:01,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777104491] [2019-12-27 02:23:01,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:23:01,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777104491] [2019-12-27 02:23:01,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:01,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:23:01,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59658171] [2019-12-27 02:23:01,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:23:01,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:01,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:23:01,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:23:01,652 INFO L87 Difference]: Start difference. First operand 27742 states and 116300 transitions. Second operand 4 states. [2019-12-27 02:23:02,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:02,003 INFO L93 Difference]: Finished difference Result 35230 states and 146308 transitions. [2019-12-27 02:23:02,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:23:02,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 02:23:02,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:02,125 INFO L225 Difference]: With dead ends: 35230 [2019-12-27 02:23:02,125 INFO L226 Difference]: Without dead ends: 35182 [2019-12-27 02:23:02,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:23:02,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35182 states. [2019-12-27 02:23:03,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35182 to 30378. [2019-12-27 02:23:03,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30378 states. [2019-12-27 02:23:03,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30378 states to 30378 states and 127172 transitions. [2019-12-27 02:23:03,510 INFO L78 Accepts]: Start accepts. Automaton has 30378 states and 127172 transitions. Word has length 18 [2019-12-27 02:23:03,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:03,510 INFO L462 AbstractCegarLoop]: Abstraction has 30378 states and 127172 transitions. [2019-12-27 02:23:03,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:23:03,512 INFO L276 IsEmpty]: Start isEmpty. Operand 30378 states and 127172 transitions. [2019-12-27 02:23:03,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 02:23:03,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:03,524 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:23:03,524 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:23:03,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:03,525 INFO L82 PathProgramCache]: Analyzing trace with hash -45820751, now seen corresponding path program 1 times [2019-12-27 02:23:03,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:03,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305021915] [2019-12-27 02:23:03,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:03,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:23:03,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305021915] [2019-12-27 02:23:03,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:03,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:23:03,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162067175] [2019-12-27 02:23:03,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:23:03,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:03,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:23:03,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:23:03,620 INFO L87 Difference]: Start difference. First operand 30378 states and 127172 transitions. Second operand 3 states. [2019-12-27 02:23:04,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:04,805 INFO L93 Difference]: Finished difference Result 29747 states and 123892 transitions. [2019-12-27 02:23:04,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:23:04,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 02:23:04,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:04,891 INFO L225 Difference]: With dead ends: 29747 [2019-12-27 02:23:04,892 INFO L226 Difference]: Without dead ends: 29747 [2019-12-27 02:23:04,892 INFO L631 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 [2019-12-27 02:23:05,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29747 states. [2019-12-27 02:23:05,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29747 to 29747. [2019-12-27 02:23:05,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29747 states. [2019-12-27 02:23:06,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29747 states to 29747 states and 123892 transitions. [2019-12-27 02:23:06,062 INFO L78 Accepts]: Start accepts. Automaton has 29747 states and 123892 transitions. Word has length 20 [2019-12-27 02:23:06,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:06,062 INFO L462 AbstractCegarLoop]: Abstraction has 29747 states and 123892 transitions. [2019-12-27 02:23:06,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:23:06,063 INFO L276 IsEmpty]: Start isEmpty. Operand 29747 states and 123892 transitions. [2019-12-27 02:23:06,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 02:23:06,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:06,074 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:23:06,074 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:23:06,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:06,074 INFO L82 PathProgramCache]: Analyzing trace with hash -129088173, now seen corresponding path program 1 times [2019-12-27 02:23:06,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:06,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297359512] [2019-12-27 02:23:06,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:23:06,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297359512] [2019-12-27 02:23:06,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:06,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:23:06,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018028043] [2019-12-27 02:23:06,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:23:06,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:06,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:23:06,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:23:06,121 INFO L87 Difference]: Start difference. First operand 29747 states and 123892 transitions. Second operand 3 states. [2019-12-27 02:23:06,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:06,290 INFO L93 Difference]: Finished difference Result 36709 states and 144810 transitions. [2019-12-27 02:23:06,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:23:06,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 02:23:06,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:06,361 INFO L225 Difference]: With dead ends: 36709 [2019-12-27 02:23:06,361 INFO L226 Difference]: Without dead ends: 30167 [2019-12-27 02:23:06,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:23:06,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30167 states. [2019-12-27 02:23:07,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30167 to 29499. [2019-12-27 02:23:07,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29499 states. [2019-12-27 02:23:07,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29499 states to 29499 states and 115623 transitions. [2019-12-27 02:23:07,329 INFO L78 Accepts]: Start accepts. Automaton has 29499 states and 115623 transitions. Word has length 21 [2019-12-27 02:23:07,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:07,330 INFO L462 AbstractCegarLoop]: Abstraction has 29499 states and 115623 transitions. [2019-12-27 02:23:07,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:23:07,330 INFO L276 IsEmpty]: Start isEmpty. Operand 29499 states and 115623 transitions. [2019-12-27 02:23:07,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 02:23:07,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:07,342 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:23:07,342 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:23:07,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:07,342 INFO L82 PathProgramCache]: Analyzing trace with hash 484267595, now seen corresponding path program 1 times [2019-12-27 02:23:07,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:07,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195163843] [2019-12-27 02:23:07,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:07,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:23:07,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195163843] [2019-12-27 02:23:07,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:07,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:23:07,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999933163] [2019-12-27 02:23:07,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:23:07,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:07,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:23:07,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:23:07,399 INFO L87 Difference]: Start difference. First operand 29499 states and 115623 transitions. Second operand 3 states. [2019-12-27 02:23:07,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:07,523 INFO L93 Difference]: Finished difference Result 29289 states and 114842 transitions. [2019-12-27 02:23:07,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:23:07,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 02:23:07,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:07,588 INFO L225 Difference]: With dead ends: 29289 [2019-12-27 02:23:07,588 INFO L226 Difference]: Without dead ends: 29289 [2019-12-27 02:23:07,589 INFO L631 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 [2019-12-27 02:23:08,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29289 states. [2019-12-27 02:23:08,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29289 to 29205. [2019-12-27 02:23:08,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29205 states. [2019-12-27 02:23:08,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29205 states to 29205 states and 114644 transitions. [2019-12-27 02:23:08,515 INFO L78 Accepts]: Start accepts. Automaton has 29205 states and 114644 transitions. Word has length 21 [2019-12-27 02:23:08,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:08,516 INFO L462 AbstractCegarLoop]: Abstraction has 29205 states and 114644 transitions. [2019-12-27 02:23:08,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:23:08,516 INFO L276 IsEmpty]: Start isEmpty. Operand 29205 states and 114644 transitions. [2019-12-27 02:23:08,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 02:23:08,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:08,527 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:23:08,527 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:23:08,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:08,527 INFO L82 PathProgramCache]: Analyzing trace with hash 291958640, now seen corresponding path program 1 times [2019-12-27 02:23:08,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:08,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449922081] [2019-12-27 02:23:08,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:08,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:23:08,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449922081] [2019-12-27 02:23:08,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:08,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:23:08,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512919712] [2019-12-27 02:23:08,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:23:08,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:08,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:23:08,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:23:08,578 INFO L87 Difference]: Start difference. First operand 29205 states and 114644 transitions. Second operand 3 states. [2019-12-27 02:23:08,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:08,726 INFO L93 Difference]: Finished difference Result 29205 states and 113300 transitions. [2019-12-27 02:23:08,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:23:08,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-27 02:23:08,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:10,018 INFO L225 Difference]: With dead ends: 29205 [2019-12-27 02:23:10,018 INFO L226 Difference]: Without dead ends: 29205 [2019-12-27 02:23:10,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:23:10,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29205 states. [2019-12-27 02:23:10,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29205 to 28805. [2019-12-27 02:23:10,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28805 states. [2019-12-27 02:23:10,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28805 states to 28805 states and 111840 transitions. [2019-12-27 02:23:10,567 INFO L78 Accepts]: Start accepts. Automaton has 28805 states and 111840 transitions. Word has length 22 [2019-12-27 02:23:10,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:10,568 INFO L462 AbstractCegarLoop]: Abstraction has 28805 states and 111840 transitions. [2019-12-27 02:23:10,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:23:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand 28805 states and 111840 transitions. [2019-12-27 02:23:10,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 02:23:10,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:10,579 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:23:10,580 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:23:10,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:10,580 INFO L82 PathProgramCache]: Analyzing trace with hash -9241093, now seen corresponding path program 1 times [2019-12-27 02:23:10,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:10,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517959221] [2019-12-27 02:23:10,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:10,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:23:10,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517959221] [2019-12-27 02:23:10,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:10,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:23:10,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798063356] [2019-12-27 02:23:10,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:23:10,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:10,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:23:10,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:23:10,649 INFO L87 Difference]: Start difference. First operand 28805 states and 111840 transitions. Second operand 5 states. [2019-12-27 02:23:10,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:10,767 INFO L93 Difference]: Finished difference Result 12329 states and 39554 transitions. [2019-12-27 02:23:10,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:23:10,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 02:23:10,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:10,789 INFO L225 Difference]: With dead ends: 12329 [2019-12-27 02:23:10,790 INFO L226 Difference]: Without dead ends: 10557 [2019-12-27 02:23:10,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:23:10,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10557 states. [2019-12-27 02:23:10,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10557 to 10557. [2019-12-27 02:23:10,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10557 states. [2019-12-27 02:23:10,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10557 states to 10557 states and 32994 transitions. [2019-12-27 02:23:10,941 INFO L78 Accepts]: Start accepts. Automaton has 10557 states and 32994 transitions. Word has length 23 [2019-12-27 02:23:10,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:10,942 INFO L462 AbstractCegarLoop]: Abstraction has 10557 states and 32994 transitions. [2019-12-27 02:23:10,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:23:10,942 INFO L276 IsEmpty]: Start isEmpty. Operand 10557 states and 32994 transitions. [2019-12-27 02:23:11,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 02:23:11,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:11,180 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:23:11,181 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:23:11,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:11,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1862087193, now seen corresponding path program 1 times [2019-12-27 02:23:11,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:11,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400369785] [2019-12-27 02:23:11,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:11,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:23:11,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400369785] [2019-12-27 02:23:11,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:11,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:23:11,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270105558] [2019-12-27 02:23:11,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:23:11,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:11,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:23:11,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:23:11,230 INFO L87 Difference]: Start difference. First operand 10557 states and 32994 transitions. Second operand 4 states. [2019-12-27 02:23:11,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:11,322 INFO L93 Difference]: Finished difference Result 15941 states and 50535 transitions. [2019-12-27 02:23:11,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:23:11,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-27 02:23:11,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:11,343 INFO L225 Difference]: With dead ends: 15941 [2019-12-27 02:23:11,344 INFO L226 Difference]: Without dead ends: 8445 [2019-12-27 02:23:11,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:23:11,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8445 states. [2019-12-27 02:23:11,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8445 to 8146. [2019-12-27 02:23:11,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8146 states. [2019-12-27 02:23:11,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8146 states to 8146 states and 25593 transitions. [2019-12-27 02:23:11,543 INFO L78 Accepts]: Start accepts. Automaton has 8146 states and 25593 transitions. Word has length 24 [2019-12-27 02:23:11,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:11,543 INFO L462 AbstractCegarLoop]: Abstraction has 8146 states and 25593 transitions. [2019-12-27 02:23:11,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:23:11,544 INFO L276 IsEmpty]: Start isEmpty. Operand 8146 states and 25593 transitions. [2019-12-27 02:23:11,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 02:23:11,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:11,551 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:23:11,551 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:23:11,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:11,552 INFO L82 PathProgramCache]: Analyzing trace with hash -417737333, now seen corresponding path program 2 times [2019-12-27 02:23:11,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:11,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45282381] [2019-12-27 02:23:11,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:11,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:23:11,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45282381] [2019-12-27 02:23:11,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:11,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:23:11,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278546136] [2019-12-27 02:23:11,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:23:11,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:11,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:23:11,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:23:11,661 INFO L87 Difference]: Start difference. First operand 8146 states and 25593 transitions. Second operand 6 states. [2019-12-27 02:23:11,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:11,762 INFO L93 Difference]: Finished difference Result 3111 states and 8924 transitions. [2019-12-27 02:23:11,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:23:11,763 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 02:23:11,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:11,768 INFO L225 Difference]: With dead ends: 3111 [2019-12-27 02:23:11,768 INFO L226 Difference]: Without dead ends: 2590 [2019-12-27 02:23:11,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:23:11,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2590 states. [2019-12-27 02:23:11,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590 to 2590. [2019-12-27 02:23:11,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2590 states. [2019-12-27 02:23:11,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 7335 transitions. [2019-12-27 02:23:11,815 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 7335 transitions. Word has length 24 [2019-12-27 02:23:11,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:11,816 INFO L462 AbstractCegarLoop]: Abstraction has 2590 states and 7335 transitions. [2019-12-27 02:23:11,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:23:11,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 7335 transitions. [2019-12-27 02:23:11,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 02:23:11,823 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:11,824 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:23:11,824 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:23:11,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:11,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1619810495, now seen corresponding path program 1 times [2019-12-27 02:23:11,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:11,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918803157] [2019-12-27 02:23:11,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:11,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:23:11,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918803157] [2019-12-27 02:23:11,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:11,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:23:11,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511540046] [2019-12-27 02:23:11,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:23:11,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:11,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:23:11,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:23:11,872 INFO L87 Difference]: Start difference. First operand 2590 states and 7335 transitions. Second operand 3 states. [2019-12-27 02:23:11,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:11,925 INFO L93 Difference]: Finished difference Result 3908 states and 10998 transitions. [2019-12-27 02:23:11,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:23:11,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-27 02:23:11,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:11,932 INFO L225 Difference]: With dead ends: 3908 [2019-12-27 02:23:11,933 INFO L226 Difference]: Without dead ends: 3908 [2019-12-27 02:23:11,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:23:11,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3908 states. [2019-12-27 02:23:11,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3908 to 3066. [2019-12-27 02:23:11,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3066 states. [2019-12-27 02:23:11,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3066 states to 3066 states and 8797 transitions. [2019-12-27 02:23:11,979 INFO L78 Accepts]: Start accepts. Automaton has 3066 states and 8797 transitions. Word has length 32 [2019-12-27 02:23:11,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:11,979 INFO L462 AbstractCegarLoop]: Abstraction has 3066 states and 8797 transitions. [2019-12-27 02:23:11,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:23:11,979 INFO L276 IsEmpty]: Start isEmpty. Operand 3066 states and 8797 transitions. [2019-12-27 02:23:11,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 02:23:11,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:11,984 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:23:11,985 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:23:11,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:11,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1082300219, now seen corresponding path program 1 times [2019-12-27 02:23:11,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:11,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344400368] [2019-12-27 02:23:11,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:12,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:23:12,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344400368] [2019-12-27 02:23:12,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:12,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:23:12,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76818244] [2019-12-27 02:23:12,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:23:12,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:12,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:23:12,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:23:12,098 INFO L87 Difference]: Start difference. First operand 3066 states and 8797 transitions. Second operand 6 states. [2019-12-27 02:23:12,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:12,527 INFO L93 Difference]: Finished difference Result 6462 states and 17612 transitions. [2019-12-27 02:23:12,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:23:12,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-27 02:23:12,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:12,535 INFO L225 Difference]: With dead ends: 6462 [2019-12-27 02:23:12,536 INFO L226 Difference]: Without dead ends: 6324 [2019-12-27 02:23:12,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:23:12,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6324 states. [2019-12-27 02:23:12,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6324 to 3196. [2019-12-27 02:23:12,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3196 states. [2019-12-27 02:23:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3196 states to 3196 states and 9125 transitions. [2019-12-27 02:23:12,587 INFO L78 Accepts]: Start accepts. Automaton has 3196 states and 9125 transitions. Word has length 32 [2019-12-27 02:23:12,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:12,587 INFO L462 AbstractCegarLoop]: Abstraction has 3196 states and 9125 transitions. [2019-12-27 02:23:12,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:23:12,587 INFO L276 IsEmpty]: Start isEmpty. Operand 3196 states and 9125 transitions. [2019-12-27 02:23:12,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 02:23:12,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:12,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:23:12,591 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:23:12,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:12,592 INFO L82 PathProgramCache]: Analyzing trace with hash -345264620, now seen corresponding path program 1 times [2019-12-27 02:23:12,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:12,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591203137] [2019-12-27 02:23:12,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:12,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:23:12,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591203137] [2019-12-27 02:23:12,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:12,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:23:12,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037623310] [2019-12-27 02:23:12,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:23:12,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:12,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:23:12,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:23:12,695 INFO L87 Difference]: Start difference. First operand 3196 states and 9125 transitions. Second operand 6 states. [2019-12-27 02:23:13,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:13,132 INFO L93 Difference]: Finished difference Result 6123 states and 16579 transitions. [2019-12-27 02:23:13,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:23:13,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 02:23:13,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:13,141 INFO L225 Difference]: With dead ends: 6123 [2019-12-27 02:23:13,142 INFO L226 Difference]: Without dead ends: 5979 [2019-12-27 02:23:13,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:23:13,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5979 states. [2019-12-27 02:23:13,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5979 to 3000. [2019-12-27 02:23:13,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3000 states. [2019-12-27 02:23:13,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3000 states to 3000 states and 8617 transitions. [2019-12-27 02:23:13,190 INFO L78 Accepts]: Start accepts. Automaton has 3000 states and 8617 transitions. Word has length 33 [2019-12-27 02:23:13,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:13,190 INFO L462 AbstractCegarLoop]: Abstraction has 3000 states and 8617 transitions. [2019-12-27 02:23:13,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:23:13,190 INFO L276 IsEmpty]: Start isEmpty. Operand 3000 states and 8617 transitions. [2019-12-27 02:23:13,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 02:23:13,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:13,194 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:23:13,194 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:23:13,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:13,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1231616427, now seen corresponding path program 1 times [2019-12-27 02:23:13,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:13,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210949773] [2019-12-27 02:23:13,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:13,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:23:13,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210949773] [2019-12-27 02:23:13,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:13,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:23:13,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235467422] [2019-12-27 02:23:13,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:23:13,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:13,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:23:13,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:23:13,300 INFO L87 Difference]: Start difference. First operand 3000 states and 8617 transitions. Second operand 7 states. [2019-12-27 02:23:13,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:13,455 INFO L93 Difference]: Finished difference Result 2263 states and 6813 transitions. [2019-12-27 02:23:13,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:23:13,456 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 02:23:13,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:13,461 INFO L225 Difference]: With dead ends: 2263 [2019-12-27 02:23:13,461 INFO L226 Difference]: Without dead ends: 1607 [2019-12-27 02:23:13,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:23:13,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2019-12-27 02:23:13,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1553. [2019-12-27 02:23:13,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1553 states. [2019-12-27 02:23:13,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 4536 transitions. [2019-12-27 02:23:13,501 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 4536 transitions. Word has length 33 [2019-12-27 02:23:13,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:13,501 INFO L462 AbstractCegarLoop]: Abstraction has 1553 states and 4536 transitions. [2019-12-27 02:23:13,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:23:13,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 4536 transitions. [2019-12-27 02:23:13,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 02:23:13,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:13,507 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:23:13,507 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:23:13,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:13,508 INFO L82 PathProgramCache]: Analyzing trace with hash -978641481, now seen corresponding path program 1 times [2019-12-27 02:23:13,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:13,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791729520] [2019-12-27 02:23:13,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:13,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:23:13,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791729520] [2019-12-27 02:23:13,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:13,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:23:13,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468766696] [2019-12-27 02:23:13,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:23:13,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:13,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:23:13,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:23:13,604 INFO L87 Difference]: Start difference. First operand 1553 states and 4536 transitions. Second operand 6 states. [2019-12-27 02:23:14,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:14,074 INFO L93 Difference]: Finished difference Result 4702 states and 13602 transitions. [2019-12-27 02:23:14,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:23:14,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-12-27 02:23:14,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:14,081 INFO L225 Difference]: With dead ends: 4702 [2019-12-27 02:23:14,081 INFO L226 Difference]: Without dead ends: 3062 [2019-12-27 02:23:14,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:23:14,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2019-12-27 02:23:14,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 1755. [2019-12-27 02:23:14,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1755 states. [2019-12-27 02:23:14,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 5105 transitions. [2019-12-27 02:23:14,122 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 5105 transitions. Word has length 48 [2019-12-27 02:23:14,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:14,123 INFO L462 AbstractCegarLoop]: Abstraction has 1755 states and 5105 transitions. [2019-12-27 02:23:14,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:23:14,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 5105 transitions. [2019-12-27 02:23:14,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 02:23:14,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:14,128 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:23:14,129 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:23:14,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:14,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1923718495, now seen corresponding path program 2 times [2019-12-27 02:23:14,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:14,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715981014] [2019-12-27 02:23:14,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:23:14,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715981014] [2019-12-27 02:23:14,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:14,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:23:14,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514262458] [2019-12-27 02:23:14,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:23:14,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:14,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:23:14,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:23:14,235 INFO L87 Difference]: Start difference. First operand 1755 states and 5105 transitions. Second operand 4 states. [2019-12-27 02:23:14,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:14,268 INFO L93 Difference]: Finished difference Result 2211 states and 6131 transitions. [2019-12-27 02:23:14,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:23:14,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-27 02:23:14,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:14,269 INFO L225 Difference]: With dead ends: 2211 [2019-12-27 02:23:14,270 INFO L226 Difference]: Without dead ends: 504 [2019-12-27 02:23:14,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:23:14,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-12-27 02:23:14,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-12-27 02:23:14,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-12-27 02:23:14,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1111 transitions. [2019-12-27 02:23:14,277 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1111 transitions. Word has length 48 [2019-12-27 02:23:14,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:14,277 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 1111 transitions. [2019-12-27 02:23:14,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:23:14,277 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1111 transitions. [2019-12-27 02:23:14,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 02:23:14,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:14,278 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:23:14,279 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:23:14,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:14,279 INFO L82 PathProgramCache]: Analyzing trace with hash -126758993, now seen corresponding path program 3 times [2019-12-27 02:23:14,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:14,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387026361] [2019-12-27 02:23:14,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:14,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:23:14,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387026361] [2019-12-27 02:23:14,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:14,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:23:14,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993443053] [2019-12-27 02:23:14,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:23:14,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:14,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:23:14,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:23:14,370 INFO L87 Difference]: Start difference. First operand 504 states and 1111 transitions. Second operand 7 states. [2019-12-27 02:23:14,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:14,536 INFO L93 Difference]: Finished difference Result 892 states and 1938 transitions. [2019-12-27 02:23:14,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:23:14,536 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-27 02:23:14,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:14,537 INFO L225 Difference]: With dead ends: 892 [2019-12-27 02:23:14,537 INFO L226 Difference]: Without dead ends: 594 [2019-12-27 02:23:14,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:23:14,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-12-27 02:23:14,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 536. [2019-12-27 02:23:14,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-27 02:23:14,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1171 transitions. [2019-12-27 02:23:14,544 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1171 transitions. Word has length 48 [2019-12-27 02:23:14,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:14,545 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1171 transitions. [2019-12-27 02:23:14,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:23:14,545 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1171 transitions. [2019-12-27 02:23:14,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 02:23:14,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:14,546 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:23:14,547 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:23:14,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:14,547 INFO L82 PathProgramCache]: Analyzing trace with hash 24927743, now seen corresponding path program 4 times [2019-12-27 02:23:14,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:14,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185981355] [2019-12-27 02:23:14,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:23:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:23:14,657 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:23:14,657 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:23:14,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_107| 0 0))) (and (= v_~x~0_71 0) (= 0 v_~weak$$choice0~0_10) (= v_~z$w_buff0_used~0_514 0) (= 0 v_~z$r_buff1_thd3~0_207) (= v_~main$tmp_guard0~0_30 0) (= v_~main$tmp_guard1~0_44 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= 0 v_~z$flush_delayed~0_37) (= v_~z$mem_tmp~0_16 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t981~0.base_59| 4)) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (= (select .cse0 |v_ULTIMATE.start_main_~#t981~0.base_59|) 0) (= v_~y~0_19 0) (= v_~z$w_buff0~0_183 0) (= 0 v_~z$r_buff1_thd1~0_59) (= 0 v_~z$r_buff0_thd4~0_166) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p3_EAX~0_87) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t981~0.base_59|) (= |v_#memory_int_27| (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t981~0.base_59| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t981~0.base_59|) |v_ULTIMATE.start_main_~#t981~0.offset_37| 0))) (= v_~z$r_buff0_thd2~0_57 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd0~0_132 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_116 0) (= 0 v_~__unbuffered_p2_EAX~0_54) (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~z$r_buff0_thd3~0_266) (= 0 v_~__unbuffered_p3_EBX~0_88) (= |v_#valid_105| (store .cse0 |v_ULTIMATE.start_main_~#t981~0.base_59| 1)) (= 0 v_~weak$$choice2~0_95) (= v_~z$w_buff1_used~0_298 0) (= 0 |v_#NULL.base_5|) (= v_~z$w_buff1~0_123 0) (= v_~b~0_79 0) (= |v_ULTIMATE.start_main_~#t981~0.offset_37| 0) (= v_~__unbuffered_cnt~0_126 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_107|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ULTIMATE.start_main_~#t981~0.offset=|v_ULTIMATE.start_main_~#t981~0.offset_37|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, #NULL.offset=|v_#NULL.offset_5|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_87, #length=|v_#length_31|, ULTIMATE.start_main_~#t984~0.offset=|v_ULTIMATE.start_main_~#t984~0.offset_22|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_81|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_298, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_72|, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ULTIMATE.start_main_~#t983~0.base=|v_ULTIMATE.start_main_~#t983~0.base_32|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ULTIMATE.start_main_~#t984~0.base=|v_ULTIMATE.start_main_~#t984~0.base_32|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_59, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_266, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_71, ULTIMATE.start_main_~#t982~0.base=|v_ULTIMATE.start_main_~#t982~0.base_56|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_110, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_18|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_132, ~y~0=v_~y~0_19, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ULTIMATE.start_main_~#t983~0.offset=|v_ULTIMATE.start_main_~#t983~0.offset_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_514, ~z$w_buff0~0=v_~z$w_buff0~0_183, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_207, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_45|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_141|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_88, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t982~0.offset=|v_ULTIMATE.start_main_~#t982~0.offset_35|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_91|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_38|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~#t981~0.base=|v_ULTIMATE.start_main_~#t981~0.base_59|, ~z~0=v_~z~0_116, ~weak$$choice2~0=v_~weak$$choice2~0_95, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t981~0.offset, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t984~0.offset, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t983~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t984~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t982~0.base, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t983~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_~#t982~0.offset, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t981~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:23:14,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t982~0.base_11|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t982~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t982~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t982~0.base_11| 0)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t982~0.base_11|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t982~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t982~0.base_11|) |v_ULTIMATE.start_main_~#t982~0.offset_10| 1)) |v_#memory_int_19|) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t982~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t982~0.base=|v_ULTIMATE.start_main_~#t982~0.base_11|, ULTIMATE.start_main_~#t982~0.offset=|v_ULTIMATE.start_main_~#t982~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t982~0.base, ULTIMATE.start_main_~#t982~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 02:23:14,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t983~0.base_12|)) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t983~0.base_12| 1) |v_#valid_46|) (not (= 0 |v_ULTIMATE.start_main_~#t983~0.base_12|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t983~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t983~0.base_12|) |v_ULTIMATE.start_main_~#t983~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t983~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t983~0.offset_11|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t983~0.base_12| 4) |v_#length_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t983~0.offset=|v_ULTIMATE.start_main_~#t983~0.offset_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|, ULTIMATE.start_main_~#t983~0.base=|v_ULTIMATE.start_main_~#t983~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t983~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t983~0.base] because there is no mapped edge [2019-12-27 02:23:14,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t984~0.base_12|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t984~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t984~0.base_12|) |v_ULTIMATE.start_main_~#t984~0.offset_10| 3)) |v_#memory_int_15|) (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t984~0.base_12|) 0) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t984~0.base_12| 1)) (not (= |v_ULTIMATE.start_main_~#t984~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t984~0.offset_10|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t984~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, ULTIMATE.start_main_~#t984~0.base=|v_ULTIMATE.start_main_~#t984~0.base_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t984~0.offset=|v_ULTIMATE.start_main_~#t984~0.offset_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t984~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t984~0.offset, #length] because there is no mapped edge [2019-12-27 02:23:14,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= ~z$r_buff0_thd4~0_Out1915840239 1) (= ~a~0_Out1915840239 ~__unbuffered_p3_EAX~0_Out1915840239) (= ~z$r_buff1_thd2~0_Out1915840239 ~z$r_buff0_thd2~0_In1915840239) (= ~z$r_buff1_thd3~0_Out1915840239 ~z$r_buff0_thd3~0_In1915840239) (= ~z$r_buff0_thd1~0_In1915840239 ~z$r_buff1_thd1~0_Out1915840239) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1915840239)) (= ~z$r_buff0_thd4~0_In1915840239 ~z$r_buff1_thd4~0_Out1915840239) (= ~a~0_Out1915840239 1) (= ~z$r_buff1_thd0~0_Out1915840239 ~z$r_buff0_thd0~0_In1915840239) (= ~__unbuffered_p3_EBX~0_Out1915840239 ~b~0_In1915840239)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1915840239, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1915840239, ~b~0=~b~0_In1915840239, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1915840239, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1915840239, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1915840239, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1915840239} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1915840239, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out1915840239, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1915840239, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1915840239, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out1915840239, ~a~0=~a~0_Out1915840239, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1915840239, ~b~0=~b~0_In1915840239, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1915840239, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1915840239, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out1915840239, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1915840239, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1915840239, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1915840239, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1915840239} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 02:23:14,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_~x~0_36 1) (= v_P0Thread1of1ForFork3_~arg.base_22 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_22) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= v_~b~0_48 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|} OutVars{~b~0=v_~b~0_48, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_22, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_22, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_36} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-27 02:23:14,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_7|) (= v_~y~0_15 v_~__unbuffered_p1_EAX~0_14) (= v_P1Thread1of1ForFork0_~arg.base_11 |v_P1Thread1of1ForFork0_#in~arg.base_11|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x~0_23 2) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_11) (= 0 |v_P1Thread1of1ForFork0_#res.offset_7|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~y~0=v_~y~0_15} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_11, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, ~y~0=v_~y~0_15, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-27 02:23:14,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-976873608 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite8_In-976873608| |P2Thread1of1ForFork1_#t~ite8_Out-976873608|) (not .cse0) (= ~z$w_buff0~0_In-976873608 |P2Thread1of1ForFork1_#t~ite9_Out-976873608|)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-976873608 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-976873608 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-976873608 256))) (and (= 0 (mod ~z$r_buff1_thd3~0_In-976873608 256)) .cse1))) .cse0 (= |P2Thread1of1ForFork1_#t~ite8_Out-976873608| |P2Thread1of1ForFork1_#t~ite9_Out-976873608|) (= |P2Thread1of1ForFork1_#t~ite8_Out-976873608| ~z$w_buff0~0_In-976873608)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-976873608, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-976873608, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-976873608, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-976873608, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-976873608, ~weak$$choice2~0=~weak$$choice2~0_In-976873608, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In-976873608|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-976873608, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-976873608, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-976873608, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-976873608, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-976873608, ~weak$$choice2~0=~weak$$choice2~0_In-976873608, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out-976873608|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out-976873608|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 02:23:14,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In508327845 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite11_In508327845| |P2Thread1of1ForFork1_#t~ite11_Out508327845|) (= |P2Thread1of1ForFork1_#t~ite12_Out508327845| ~z$w_buff1~0_In508327845) (not .cse0)) (and (= ~z$w_buff1~0_In508327845 |P2Thread1of1ForFork1_#t~ite11_Out508327845|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In508327845 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In508327845 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In508327845 256))) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In508327845 256))))) (= |P2Thread1of1ForFork1_#t~ite12_Out508327845| |P2Thread1of1ForFork1_#t~ite11_Out508327845|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In508327845, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In508327845, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In508327845|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In508327845, ~z$w_buff1~0=~z$w_buff1~0_In508327845, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In508327845, ~weak$$choice2~0=~weak$$choice2~0_In508327845} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In508327845, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out508327845|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In508327845, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out508327845|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In508327845, ~z$w_buff1~0=~z$w_buff1~0_In508327845, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In508327845, ~weak$$choice2~0=~weak$$choice2~0_In508327845} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 02:23:14,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1461970032 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite15_Out-1461970032| ~z$w_buff0_used~0_In-1461970032) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite14_In-1461970032| |P2Thread1of1ForFork1_#t~ite14_Out-1461970032|)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite14_Out-1461970032| ~z$w_buff0_used~0_In-1461970032) (= |P2Thread1of1ForFork1_#t~ite15_Out-1461970032| |P2Thread1of1ForFork1_#t~ite14_Out-1461970032|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1461970032 256)))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In-1461970032 256)) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In-1461970032 256)) .cse1) (= (mod ~z$w_buff0_used~0_In-1461970032 256) 0)))))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In-1461970032|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1461970032, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1461970032, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1461970032, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1461970032, ~weak$$choice2~0=~weak$$choice2~0_In-1461970032} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out-1461970032|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out-1461970032|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1461970032, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1461970032, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1461970032, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1461970032, ~weak$$choice2~0=~weak$$choice2~0_In-1461970032} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-27 02:23:14,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_90 v_~z$r_buff0_thd3~0_89) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_11|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_89, ~weak$$choice2~0=v_~weak$$choice2~0_22, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 02:23:14,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-433338301 256) 0))) (or (and .cse0 (= ~z$r_buff1_thd3~0_In-433338301 |P2Thread1of1ForFork1_#t~ite23_Out-433338301|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-433338301 256)))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In-433338301 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-433338301 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-433338301 256) 0)))) (= |P2Thread1of1ForFork1_#t~ite23_Out-433338301| |P2Thread1of1ForFork1_#t~ite24_Out-433338301|)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite23_In-433338301| |P2Thread1of1ForFork1_#t~ite23_Out-433338301|) (= ~z$r_buff1_thd3~0_In-433338301 |P2Thread1of1ForFork1_#t~ite24_Out-433338301|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-433338301, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-433338301, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In-433338301|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-433338301, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-433338301, ~weak$$choice2~0=~weak$$choice2~0_In-433338301} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out-433338301|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-433338301, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-433338301, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out-433338301|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-433338301, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-433338301, ~weak$$choice2~0=~weak$$choice2~0_In-433338301} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-27 02:23:14,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_8) (= v_~z~0_22 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 02:23:14,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-2060503743 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2060503743 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out-2060503743| ~z$w_buff0_used~0_In-2060503743)) (and (= |P3Thread1of1ForFork2_#t~ite28_Out-2060503743| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2060503743, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2060503743} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-2060503743|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2060503743, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2060503743} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 02:23:14,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-46662535 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-46662535 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-46662535 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-46662535 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-46662535 |P3Thread1of1ForFork2_#t~ite29_Out-46662535|) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite29_Out-46662535|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-46662535, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-46662535, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-46662535, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-46662535} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-46662535|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-46662535, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-46662535, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-46662535, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-46662535} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 02:23:14,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1200886190 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-1200886190 256) 0))) (or (and (= ~z$r_buff0_thd4~0_Out-1200886190 ~z$r_buff0_thd4~0_In-1200886190) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd4~0_Out-1200886190 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1200886190, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1200886190} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1200886190, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1200886190, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out-1200886190|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-27 02:23:14,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In795765816 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In795765816 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In795765816 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In795765816 256) 0))) (or (and (= |P3Thread1of1ForFork2_#t~ite31_Out795765816| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P3Thread1of1ForFork2_#t~ite31_Out795765816| ~z$r_buff1_thd4~0_In795765816) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In795765816, ~z$w_buff0_used~0=~z$w_buff0_used~0_In795765816, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In795765816, ~z$w_buff1_used~0=~z$w_buff1_used~0_In795765816} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In795765816, ~z$w_buff0_used~0=~z$w_buff0_used~0_In795765816, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In795765816, ~z$w_buff1_used~0=~z$w_buff1_used~0_In795765816, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out795765816|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 02:23:14,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L824-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= |v_P3Thread1of1ForFork2_#t~ite31_44| v_~z$r_buff1_thd4~0_62)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_44|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_62, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_43|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 02:23:14,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_93 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 02:23:14,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite37_Out1985503536| |ULTIMATE.start_main_#t~ite36_Out1985503536|)) (.cse1 (= (mod ~z$w_buff1_used~0_In1985503536 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1985503536 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= ~z$w_buff1~0_In1985503536 |ULTIMATE.start_main_#t~ite36_Out1985503536|)) (and .cse0 (= ~z~0_In1985503536 |ULTIMATE.start_main_#t~ite36_Out1985503536|) (or .cse1 .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1985503536, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1985503536, ~z$w_buff1~0=~z$w_buff1~0_In1985503536, ~z~0=~z~0_In1985503536} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1985503536, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1985503536, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1985503536|, ~z$w_buff1~0=~z$w_buff1~0_In1985503536, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1985503536|, ~z~0=~z~0_In1985503536} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 02:23:14,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-704753965 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-704753965 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out-704753965| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out-704753965| ~z$w_buff0_used~0_In-704753965) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-704753965, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-704753965} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-704753965, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-704753965, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-704753965|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 02:23:14,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1143964045 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1143964045 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1143964045 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1143964045 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out1143964045| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite39_Out1143964045| ~z$w_buff1_used~0_In1143964045)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1143964045, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1143964045, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1143964045, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1143964045} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1143964045, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1143964045|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1143964045, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1143964045, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1143964045} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 02:23:14,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1223330947 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1223330947 256)))) (or (and (= ~z$r_buff0_thd0~0_In-1223330947 |ULTIMATE.start_main_#t~ite40_Out-1223330947|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite40_Out-1223330947|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1223330947, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1223330947} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1223330947, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1223330947|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1223330947} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 02:23:14,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1843791854 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1843791854 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1843791854 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1843791854 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out1843791854| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd0~0_In1843791854 |ULTIMATE.start_main_#t~ite41_Out1843791854|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1843791854, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1843791854, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1843791854, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1843791854} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1843791854|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1843791854, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1843791854, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1843791854, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1843791854} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 02:23:14,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= |v_ULTIMATE.start_main_#t~ite41_31| v_~z$r_buff1_thd0~0_73) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_13 0) (= v_~x~0_41 2) (= 0 v_~__unbuffered_p2_EAX~0_17)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~x~0=v_~x~0_41} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_73, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~x~0=v_~x~0_41, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:23:14,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:23:14 BasicIcfg [2019-12-27 02:23:14,783 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:23:14,784 INFO L168 Benchmark]: Toolchain (without parser) took 28733.94 ms. Allocated memory was 145.8 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 100.4 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 378.2 MB. Max. memory is 7.1 GB. [2019-12-27 02:23:14,785 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 02:23:14,791 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.09 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.0 MB in the beginning and 156.7 MB in the end (delta: -56.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 02:23:14,791 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.65 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 154.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:23:14,792 INFO L168 Benchmark]: Boogie Preprocessor took 38.83 ms. Allocated memory is still 203.4 MB. Free memory was 154.1 MB in the beginning and 152.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:23:14,792 INFO L168 Benchmark]: RCFGBuilder took 839.00 ms. Allocated memory is still 203.4 MB. Free memory was 152.1 MB in the beginning and 106.0 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. [2019-12-27 02:23:14,795 INFO L168 Benchmark]: TraceAbstraction took 26994.21 ms. Allocated memory was 203.4 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 105.3 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 325.5 MB. Max. memory is 7.1 GB. [2019-12-27 02:23:14,798 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 783.09 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.0 MB in the beginning and 156.7 MB in the end (delta: -56.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.65 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 154.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.83 ms. Allocated memory is still 203.4 MB. Free memory was 154.1 MB in the beginning and 152.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 839.00 ms. Allocated memory is still 203.4 MB. Free memory was 152.1 MB in the beginning and 106.0 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26994.21 ms. Allocated memory was 203.4 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 105.3 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 325.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 170 ProgramPointsBefore, 74 ProgramPointsAfterwards, 192 TransitionsBefore, 78 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 23 ChoiceCompositions, 5751 VarBasedMoverChecksPositive, 155 VarBasedMoverChecksNegative, 25 SemBasedMoverChecksPositive, 169 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 44168 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t981, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t982, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t983, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t984, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 1 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L820] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 3 z$flush_delayed = weak$$choice2 [L776] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L783] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L821] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L822] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 158 locations, 2 error locations. Result: UNSAFE, OverallTime: 26.6s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1949 SDtfs, 2797 SDslu, 3296 SDs, 0 SdLazy, 1115 SolverSat, 177 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30378occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 17319 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 519 NumberOfCodeBlocks, 519 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 454 ConstructedInterpolants, 0 QuantifiedInterpolants, 38568 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...