/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:10:49,725 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:10:49,727 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:10:49,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:10:49,746 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:10:49,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:10:49,750 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:10:49,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:10:49,765 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:10:49,768 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:10:49,771 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:10:49,772 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:10:49,772 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:10:49,773 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:10:49,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:10:49,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:10:49,780 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:10:49,781 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:10:49,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:10:49,788 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:10:49,792 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:10:49,797 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:10:49,798 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:10:49,798 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:10:49,800 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:10:49,801 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:10:49,801 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:10:49,802 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:10:49,802 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:10:49,803 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:10:49,803 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:10:49,804 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:10:49,805 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:10:49,806 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:10:49,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:10:49,807 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:10:49,807 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:10:49,808 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:10:49,808 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:10:49,809 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:10:49,809 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:10:49,810 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:10:49,845 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:10:49,846 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:10:49,850 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:10:49,850 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:10:49,851 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:10:49,851 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:10:49,851 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:10:49,851 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:10:49,852 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:10:49,852 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:10:49,852 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:10:49,852 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:10:49,853 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:10:49,855 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:10:49,855 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:10:49,855 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:10:49,856 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:10:49,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:10:49,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:10:49,856 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:10:49,856 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:10:49,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:10:49,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:10:49,858 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:10:49,858 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:10:49,859 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:10:49,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:10:49,859 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:10:49,859 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:10:49,859 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:10:50,165 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:10:50,184 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:10:50,187 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:10:50,189 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:10:50,189 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:10:50,190 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_rmo.oepc.i [2019-12-26 23:10:50,254 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20be72f38/c1c8412b23f2448b95f2a2950fea1517/FLAG34cb857dc [2019-12-26 23:10:50,786 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:10:50,787 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_rmo.oepc.i [2019-12-26 23:10:50,813 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20be72f38/c1c8412b23f2448b95f2a2950fea1517/FLAG34cb857dc [2019-12-26 23:10:51,096 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20be72f38/c1c8412b23f2448b95f2a2950fea1517 [2019-12-26 23:10:51,107 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:10:51,109 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:10:51,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:10:51,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:10:51,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:10:51,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:10:51" (1/1) ... [2019-12-26 23:10:51,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85f7a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:51, skipping insertion in model container [2019-12-26 23:10:51,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:10:51" (1/1) ... [2019-12-26 23:10:51,129 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:10:51,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:10:51,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:10:51,754 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:10:51,819 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:10:51,895 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:10:51,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:51 WrapperNode [2019-12-26 23:10:51,896 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:10:51,897 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:10:51,897 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:10:51,897 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:10:51,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:51" (1/1) ... [2019-12-26 23:10:51,939 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:51" (1/1) ... [2019-12-26 23:10:51,968 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:10:51,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:10:51,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:10:51,969 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:10:51,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:51" (1/1) ... [2019-12-26 23:10:51,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:51" (1/1) ... [2019-12-26 23:10:51,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:51" (1/1) ... [2019-12-26 23:10:51,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:51" (1/1) ... [2019-12-26 23:10:51,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:51" (1/1) ... [2019-12-26 23:10:52,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:51" (1/1) ... [2019-12-26 23:10:52,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:51" (1/1) ... [2019-12-26 23:10:52,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:10:52,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:10:52,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:10:52,014 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:10:52,019 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:51" (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-26 23:10:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:10:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:10:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:10:52,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:10:52,070 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:10:52,070 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:10:52,070 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:10:52,070 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:10:52,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:10:52,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:10:52,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:10:52,073 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:10:52,799 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:10:52,799 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:10:52,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:10:52 BoogieIcfgContainer [2019-12-26 23:10:52,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:10:52,802 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:10:52,802 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:10:52,806 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:10:52,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:10:51" (1/3) ... [2019-12-26 23:10:52,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ffdbcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:10:52, skipping insertion in model container [2019-12-26 23:10:52,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:51" (2/3) ... [2019-12-26 23:10:52,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ffdbcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:10:52, skipping insertion in model container [2019-12-26 23:10:52,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:10:52" (3/3) ... [2019-12-26 23:10:52,810 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_rmo.oepc.i [2019-12-26 23:10:52,821 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:10:52,821 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:10:52,829 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:10:52,831 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:10:52,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,871 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,871 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,871 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,872 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,872 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,882 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,882 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,932 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,933 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,933 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,939 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,942 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:52,958 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 23:10:52,979 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:10:52,979 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:10:52,979 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:10:52,980 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:10:52,980 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:10:52,980 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:10:52,980 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:10:52,980 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:10:52,997 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-26 23:10:52,999 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-26 23:10:53,103 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-26 23:10:53,103 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:10:53,121 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 350 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 23:10:53,137 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-26 23:10:53,224 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-26 23:10:53,224 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:10:53,233 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 350 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 23:10:53,252 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-26 23:10:53,253 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:10:57,557 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-26 23:10:57,690 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-26 23:10:58,103 INFO L206 etLargeBlockEncoding]: Checked pairs total: 76598 [2019-12-26 23:10:58,104 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-26 23:10:58,108 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 89 transitions [2019-12-26 23:10:58,575 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-26 23:10:58,577 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-26 23:10:58,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 23:10:58,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:58,585 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 23:10:58,585 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:58,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:58,591 INFO L82 PathProgramCache]: Analyzing trace with hash 791334, now seen corresponding path program 1 times [2019-12-26 23:10:58,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:58,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997438020] [2019-12-26 23:10:58,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:58,846 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-26 23:10:58,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997438020] [2019-12-26 23:10:58,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:58,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:10:58,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819934035] [2019-12-26 23:10:58,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:10:58,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:58,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:10:58,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:10:58,885 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-26 23:10:59,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:59,195 INFO L93 Difference]: Finished difference Result 8506 states and 27908 transitions. [2019-12-26 23:10:59,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:10:59,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 23:10:59,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:59,348 INFO L225 Difference]: With dead ends: 8506 [2019-12-26 23:10:59,348 INFO L226 Difference]: Without dead ends: 7522 [2019-12-26 23:10:59,350 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-26 23:10:59,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7522 states. [2019-12-26 23:10:59,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7522 to 7522. [2019-12-26 23:10:59,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7522 states. [2019-12-26 23:10:59,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7522 states to 7522 states and 24586 transitions. [2019-12-26 23:10:59,901 INFO L78 Accepts]: Start accepts. Automaton has 7522 states and 24586 transitions. Word has length 3 [2019-12-26 23:10:59,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:59,902 INFO L462 AbstractCegarLoop]: Abstraction has 7522 states and 24586 transitions. [2019-12-26 23:10:59,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:10:59,902 INFO L276 IsEmpty]: Start isEmpty. Operand 7522 states and 24586 transitions. [2019-12-26 23:10:59,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:10:59,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:59,906 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:10:59,906 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:59,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:59,906 INFO L82 PathProgramCache]: Analyzing trace with hash -894599256, now seen corresponding path program 1 times [2019-12-26 23:10:59,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:59,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950127503] [2019-12-26 23:10:59,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:59,962 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-26 23:10:59,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950127503] [2019-12-26 23:10:59,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:59,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:10:59,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321242471] [2019-12-26 23:10:59,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:10:59,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:59,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:10:59,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:10:59,966 INFO L87 Difference]: Start difference. First operand 7522 states and 24586 transitions. Second operand 3 states. [2019-12-26 23:11:00,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:00,010 INFO L93 Difference]: Finished difference Result 1232 states and 2827 transitions. [2019-12-26 23:11:00,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:11:00,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-26 23:11:00,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:00,018 INFO L225 Difference]: With dead ends: 1232 [2019-12-26 23:11:00,018 INFO L226 Difference]: Without dead ends: 1232 [2019-12-26 23:11:00,019 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-26 23:11:00,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-26 23:11:00,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-26 23:11:00,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-26 23:11:00,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2827 transitions. [2019-12-26 23:11:00,050 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2827 transitions. Word has length 11 [2019-12-26 23:11:00,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:11:00,050 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2827 transitions. [2019-12-26 23:11:00,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:11:00,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2827 transitions. [2019-12-26 23:11:00,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:11:00,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:00,057 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:11:00,058 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:00,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:00,058 INFO L82 PathProgramCache]: Analyzing trace with hash 253726612, now seen corresponding path program 1 times [2019-12-26 23:11:00,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:00,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347642458] [2019-12-26 23:11:00,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:00,170 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-26 23:11:00,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347642458] [2019-12-26 23:11:00,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:00,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:11:00,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281258496] [2019-12-26 23:11:00,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:11:00,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:00,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:11:00,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:11:00,175 INFO L87 Difference]: Start difference. First operand 1232 states and 2827 transitions. Second operand 3 states. [2019-12-26 23:11:00,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:00,282 INFO L93 Difference]: Finished difference Result 1960 states and 4354 transitions. [2019-12-26 23:11:00,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:11:00,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-26 23:11:00,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:00,298 INFO L225 Difference]: With dead ends: 1960 [2019-12-26 23:11:00,299 INFO L226 Difference]: Without dead ends: 1960 [2019-12-26 23:11:00,299 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-26 23:11:00,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2019-12-26 23:11:00,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1384. [2019-12-26 23:11:00,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1384 states. [2019-12-26 23:11:00,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 3137 transitions. [2019-12-26 23:11:00,367 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 3137 transitions. Word has length 14 [2019-12-26 23:11:00,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:11:00,368 INFO L462 AbstractCegarLoop]: Abstraction has 1384 states and 3137 transitions. [2019-12-26 23:11:00,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:11:00,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 3137 transitions. [2019-12-26 23:11:00,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:11:00,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:00,372 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:11:00,372 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:00,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:00,373 INFO L82 PathProgramCache]: Analyzing trace with hash 164472776, now seen corresponding path program 1 times [2019-12-26 23:11:00,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:00,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516109694] [2019-12-26 23:11:00,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:00,504 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-26 23:11:00,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516109694] [2019-12-26 23:11:00,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:00,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:11:00,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312023250] [2019-12-26 23:11:00,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:11:00,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:00,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:11:00,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:11:00,507 INFO L87 Difference]: Start difference. First operand 1384 states and 3137 transitions. Second operand 4 states. [2019-12-26 23:11:00,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:00,676 INFO L93 Difference]: Finished difference Result 1706 states and 3795 transitions. [2019-12-26 23:11:00,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:11:00,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 23:11:00,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:00,685 INFO L225 Difference]: With dead ends: 1706 [2019-12-26 23:11:00,686 INFO L226 Difference]: Without dead ends: 1706 [2019-12-26 23:11:00,686 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-26 23:11:00,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2019-12-26 23:11:00,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1646. [2019-12-26 23:11:00,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2019-12-26 23:11:00,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 3679 transitions. [2019-12-26 23:11:00,731 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 3679 transitions. Word has length 14 [2019-12-26 23:11:00,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:11:00,731 INFO L462 AbstractCegarLoop]: Abstraction has 1646 states and 3679 transitions. [2019-12-26 23:11:00,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:11:00,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 3679 transitions. [2019-12-26 23:11:00,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:11:00,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:00,732 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:11:00,733 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:00,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:00,733 INFO L82 PathProgramCache]: Analyzing trace with hash 930242268, now seen corresponding path program 1 times [2019-12-26 23:11:00,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:00,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557777166] [2019-12-26 23:11:00,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:00,804 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-26 23:11:00,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557777166] [2019-12-26 23:11:00,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:00,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:11:00,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861933263] [2019-12-26 23:11:00,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:11:00,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:00,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:11:00,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:11:00,808 INFO L87 Difference]: Start difference. First operand 1646 states and 3679 transitions. Second operand 4 states. [2019-12-26 23:11:00,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:00,992 INFO L93 Difference]: Finished difference Result 2032 states and 4499 transitions. [2019-12-26 23:11:00,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:11:00,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 23:11:00,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:01,003 INFO L225 Difference]: With dead ends: 2032 [2019-12-26 23:11:01,004 INFO L226 Difference]: Without dead ends: 2032 [2019-12-26 23:11:01,004 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-26 23:11:01,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2019-12-26 23:11:01,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 1750. [2019-12-26 23:11:01,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2019-12-26 23:11:01,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 3922 transitions. [2019-12-26 23:11:01,049 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 3922 transitions. Word has length 14 [2019-12-26 23:11:01,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:11:01,049 INFO L462 AbstractCegarLoop]: Abstraction has 1750 states and 3922 transitions. [2019-12-26 23:11:01,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:11:01,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 3922 transitions. [2019-12-26 23:11:01,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:11:01,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:01,052 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] [2019-12-26 23:11:01,052 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:01,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:01,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1533455323, now seen corresponding path program 1 times [2019-12-26 23:11:01,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:01,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403099017] [2019-12-26 23:11:01,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:01,112 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-26 23:11:01,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403099017] [2019-12-26 23:11:01,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:01,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:11:01,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84704754] [2019-12-26 23:11:01,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:11:01,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:01,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:11:01,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:11:01,115 INFO L87 Difference]: Start difference. First operand 1750 states and 3922 transitions. Second operand 5 states. [2019-12-26 23:11:01,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:01,421 INFO L93 Difference]: Finished difference Result 2284 states and 4985 transitions. [2019-12-26 23:11:01,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:11:01,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-26 23:11:01,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:01,445 INFO L225 Difference]: With dead ends: 2284 [2019-12-26 23:11:01,446 INFO L226 Difference]: Without dead ends: 2284 [2019-12-26 23:11:01,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:11:01,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2019-12-26 23:11:01,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 2035. [2019-12-26 23:11:01,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2019-12-26 23:11:01,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 4506 transitions. [2019-12-26 23:11:01,515 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 4506 transitions. Word has length 25 [2019-12-26 23:11:01,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:11:01,516 INFO L462 AbstractCegarLoop]: Abstraction has 2035 states and 4506 transitions. [2019-12-26 23:11:01,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:11:01,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 4506 transitions. [2019-12-26 23:11:01,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:11:01,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:01,519 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] [2019-12-26 23:11:01,519 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:01,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:01,520 INFO L82 PathProgramCache]: Analyzing trace with hash -381413792, now seen corresponding path program 1 times [2019-12-26 23:11:01,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:01,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473208109] [2019-12-26 23:11:01,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:01,568 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-26 23:11:01,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473208109] [2019-12-26 23:11:01,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:01,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:11:01,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571793088] [2019-12-26 23:11:01,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:11:01,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:01,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:11:01,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:11:01,570 INFO L87 Difference]: Start difference. First operand 2035 states and 4506 transitions. Second operand 3 states. [2019-12-26 23:11:01,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:01,611 INFO L93 Difference]: Finished difference Result 2578 states and 5509 transitions. [2019-12-26 23:11:01,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:11:01,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-26 23:11:01,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:01,619 INFO L225 Difference]: With dead ends: 2578 [2019-12-26 23:11:01,619 INFO L226 Difference]: Without dead ends: 2578 [2019-12-26 23:11:01,620 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-26 23:11:01,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2019-12-26 23:11:01,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 1993. [2019-12-26 23:11:01,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1993 states. [2019-12-26 23:11:01,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 4274 transitions. [2019-12-26 23:11:01,674 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 4274 transitions. Word has length 25 [2019-12-26 23:11:01,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:11:01,674 INFO L462 AbstractCegarLoop]: Abstraction has 1993 states and 4274 transitions. [2019-12-26 23:11:01,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:11:01,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 4274 transitions. [2019-12-26 23:11:01,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 23:11:01,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:01,677 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] [2019-12-26 23:11:01,677 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:01,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:01,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1221135588, now seen corresponding path program 1 times [2019-12-26 23:11:01,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:01,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418362453] [2019-12-26 23:11:01,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:01,739 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-26 23:11:01,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418362453] [2019-12-26 23:11:01,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:01,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:11:01,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441165628] [2019-12-26 23:11:01,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:11:01,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:01,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:11:01,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:11:01,742 INFO L87 Difference]: Start difference. First operand 1993 states and 4274 transitions. Second operand 3 states. [2019-12-26 23:11:01,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:01,765 INFO L93 Difference]: Finished difference Result 3111 states and 6741 transitions. [2019-12-26 23:11:01,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:11:01,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-26 23:11:01,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:01,769 INFO L225 Difference]: With dead ends: 3111 [2019-12-26 23:11:01,776 INFO L226 Difference]: Without dead ends: 1431 [2019-12-26 23:11:01,777 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-26 23:11:01,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2019-12-26 23:11:01,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1411. [2019-12-26 23:11:01,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-12-26 23:11:01,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2997 transitions. [2019-12-26 23:11:01,817 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 2997 transitions. Word has length 26 [2019-12-26 23:11:01,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:11:01,817 INFO L462 AbstractCegarLoop]: Abstraction has 1411 states and 2997 transitions. [2019-12-26 23:11:01,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:11:01,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 2997 transitions. [2019-12-26 23:11:01,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 23:11:01,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:01,820 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] [2019-12-26 23:11:01,820 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:01,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:01,820 INFO L82 PathProgramCache]: Analyzing trace with hash 501869478, now seen corresponding path program 1 times [2019-12-26 23:11:01,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:01,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325148234] [2019-12-26 23:11:01,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:01,928 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-26 23:11:01,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325148234] [2019-12-26 23:11:01,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:01,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:11:01,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081598371] [2019-12-26 23:11:01,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:11:01,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:01,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:11:01,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:11:01,931 INFO L87 Difference]: Start difference. First operand 1411 states and 2997 transitions. Second operand 5 states. [2019-12-26 23:11:02,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:02,076 INFO L93 Difference]: Finished difference Result 1416 states and 2988 transitions. [2019-12-26 23:11:02,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:11:02,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-26 23:11:02,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:02,083 INFO L225 Difference]: With dead ends: 1416 [2019-12-26 23:11:02,083 INFO L226 Difference]: Without dead ends: 1416 [2019-12-26 23:11:02,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:11:02,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2019-12-26 23:11:02,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1374. [2019-12-26 23:11:02,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2019-12-26 23:11:02,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2924 transitions. [2019-12-26 23:11:02,119 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2924 transitions. Word has length 26 [2019-12-26 23:11:02,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:11:02,121 INFO L462 AbstractCegarLoop]: Abstraction has 1374 states and 2924 transitions. [2019-12-26 23:11:02,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:11:02,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2924 transitions. [2019-12-26 23:11:02,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 23:11:02,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:02,125 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] [2019-12-26 23:11:02,125 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:02,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:02,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1828057274, now seen corresponding path program 1 times [2019-12-26 23:11:02,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:02,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877608867] [2019-12-26 23:11:02,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:02,182 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-26 23:11:02,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877608867] [2019-12-26 23:11:02,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:02,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:11:02,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772752945] [2019-12-26 23:11:02,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:11:02,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:02,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:11:02,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:11:02,185 INFO L87 Difference]: Start difference. First operand 1374 states and 2924 transitions. Second operand 4 states. [2019-12-26 23:11:02,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:02,201 INFO L93 Difference]: Finished difference Result 667 states and 1347 transitions. [2019-12-26 23:11:02,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:11:02,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-26 23:11:02,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:02,204 INFO L225 Difference]: With dead ends: 667 [2019-12-26 23:11:02,204 INFO L226 Difference]: Without dead ends: 559 [2019-12-26 23:11:02,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:11:02,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-12-26 23:11:02,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2019-12-26 23:11:02,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-12-26 23:11:02,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1191 transitions. [2019-12-26 23:11:02,217 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 1191 transitions. Word has length 27 [2019-12-26 23:11:02,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:11:02,217 INFO L462 AbstractCegarLoop]: Abstraction has 559 states and 1191 transitions. [2019-12-26 23:11:02,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:11:02,218 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1191 transitions. [2019-12-26 23:11:02,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 23:11:02,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:02,223 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, 1, 1, 1] [2019-12-26 23:11:02,223 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:02,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:02,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1905841279, now seen corresponding path program 1 times [2019-12-26 23:11:02,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:02,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307642106] [2019-12-26 23:11:02,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:02,343 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-26 23:11:02,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307642106] [2019-12-26 23:11:02,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:02,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:11:02,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847039775] [2019-12-26 23:11:02,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:11:02,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:02,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:11:02,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:11:02,346 INFO L87 Difference]: Start difference. First operand 559 states and 1191 transitions. Second operand 7 states. [2019-12-26 23:11:02,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:02,606 INFO L93 Difference]: Finished difference Result 1142 states and 2361 transitions. [2019-12-26 23:11:02,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:11:02,607 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-26 23:11:02,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:02,609 INFO L225 Difference]: With dead ends: 1142 [2019-12-26 23:11:02,609 INFO L226 Difference]: Without dead ends: 787 [2019-12-26 23:11:02,609 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-26 23:11:02,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-12-26 23:11:02,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 625. [2019-12-26 23:11:02,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-12-26 23:11:02,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 1299 transitions. [2019-12-26 23:11:02,625 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 1299 transitions. Word has length 51 [2019-12-26 23:11:02,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:11:02,625 INFO L462 AbstractCegarLoop]: Abstraction has 625 states and 1299 transitions. [2019-12-26 23:11:02,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:11:02,625 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 1299 transitions. [2019-12-26 23:11:02,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 23:11:02,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:02,628 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, 1, 1, 1] [2019-12-26 23:11:02,628 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:02,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:02,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1903876577, now seen corresponding path program 2 times [2019-12-26 23:11:02,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:02,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524441990] [2019-12-26 23:11:02,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:02,719 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-26 23:11:02,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524441990] [2019-12-26 23:11:02,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:02,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:11:02,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46569023] [2019-12-26 23:11:02,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:11:02,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:02,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:11:02,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:11:02,721 INFO L87 Difference]: Start difference. First operand 625 states and 1299 transitions. Second operand 3 states. [2019-12-26 23:11:02,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:02,765 INFO L93 Difference]: Finished difference Result 758 states and 1575 transitions. [2019-12-26 23:11:02,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:11:02,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-26 23:11:02,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:02,767 INFO L225 Difference]: With dead ends: 758 [2019-12-26 23:11:02,767 INFO L226 Difference]: Without dead ends: 758 [2019-12-26 23:11:02,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:11:02,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2019-12-26 23:11:02,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 670. [2019-12-26 23:11:02,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-12-26 23:11:02,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1399 transitions. [2019-12-26 23:11:02,782 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1399 transitions. Word has length 51 [2019-12-26 23:11:02,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:11:02,782 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 1399 transitions. [2019-12-26 23:11:02,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:11:02,783 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1399 transitions. [2019-12-26 23:11:02,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:11:02,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:02,785 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, 1, 1, 1, 1] [2019-12-26 23:11:02,785 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:02,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:02,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1330853335, now seen corresponding path program 1 times [2019-12-26 23:11:02,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:02,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947074631] [2019-12-26 23:11:02,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:02,850 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-26 23:11:02,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947074631] [2019-12-26 23:11:02,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:02,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:11:02,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146959561] [2019-12-26 23:11:02,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:11:02,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:02,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:11:02,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:11:02,852 INFO L87 Difference]: Start difference. First operand 670 states and 1399 transitions. Second operand 3 states. [2019-12-26 23:11:02,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:02,863 INFO L93 Difference]: Finished difference Result 670 states and 1398 transitions. [2019-12-26 23:11:02,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:11:02,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-26 23:11:02,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:02,865 INFO L225 Difference]: With dead ends: 670 [2019-12-26 23:11:02,865 INFO L226 Difference]: Without dead ends: 670 [2019-12-26 23:11:02,866 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-26 23:11:02,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-12-26 23:11:02,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2019-12-26 23:11:02,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-12-26 23:11:02,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1398 transitions. [2019-12-26 23:11:02,879 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1398 transitions. Word has length 52 [2019-12-26 23:11:02,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:11:02,879 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 1398 transitions. [2019-12-26 23:11:02,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:11:02,879 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1398 transitions. [2019-12-26 23:11:02,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 23:11:02,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:02,881 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, 1, 1, 1, 1, 1] [2019-12-26 23:11:02,881 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:02,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:02,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1920865598, now seen corresponding path program 1 times [2019-12-26 23:11:02,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:02,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481361096] [2019-12-26 23:11:02,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:11:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:11:03,015 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:11:03,015 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:11:03,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd0~0_142 0) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t1609~0.base_31| 1)) (= v_~x$mem_tmp~0_23 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= |v_#NULL.offset_6| 0) (= v_~z~0_22 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~__unbuffered_p1_EBX~0_41 0) (= 0 v_~x$w_buff0_used~0_606) (= v_~y~0_95 0) (= v_~main$tmp_guard1~0_43 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x$w_buff1~0_160) (= v_~x$r_buff1_thd1~0_109 0) (= 0 v_~x$w_buff0~0_251) (= 0 v_~x$r_buff1_thd2~0_196) (= 0 v_~x$read_delayed~0_6) (= 0 |v_#NULL.base_6|) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~x$w_buff1_used~0_306) (= 0 v_~weak$$choice2~0_98) (= 0 v_~weak$$choice0~0_22) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1609~0.base_31| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1609~0.base_31|) |v_ULTIMATE.start_main_~#t1609~0.offset_23| 0))) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1609~0.base_31| 4)) (= |v_ULTIMATE.start_main_~#t1609~0.offset_23| 0) (= 0 v_~x$r_buff0_thd2~0_279) (= 0 v_~x~0_116) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1609~0.base_31|) (= v_~x$flush_delayed~0_30 0) (= v_~x$r_buff0_thd0~0_134 0) (= v_~x$r_buff0_thd1~0_174 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1609~0.base_31|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_10|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_251, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_174, ~x$flush_delayed~0=v_~x$flush_delayed~0_30, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_109, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ~x$mem_tmp~0=v_~x$mem_tmp~0_23, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_371|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_90|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_~#t1610~0.base=|v_ULTIMATE.start_main_~#t1610~0.base_24|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, ULTIMATE.start_main_~#t1610~0.offset=|v_ULTIMATE.start_main_~#t1610~0.offset_15|, #length=|v_#length_19|, ~y~0=v_~y~0_95, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_134, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ULTIMATE.start_main_~#t1609~0.offset=|v_ULTIMATE.start_main_~#t1609~0.offset_23|, ~x$w_buff1~0=v_~x$w_buff1~0_160, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_306, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_196, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_142, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_279, ULTIMATE.start_main_~#t1609~0.base=|v_ULTIMATE.start_main_~#t1609~0.base_31|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_606, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_25|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_22, ~weak$$choice2~0=v_~weak$$choice2~0_98, ~x~0=v_~x~0_116, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1610~0.base, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1610~0.offset, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1609~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1609~0.base, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 23:11:03,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L4-->L740: Formula: (and (= 1 ~x$r_buff0_thd1~0_Out1290578500) (= ~x$r_buff1_thd2~0_Out1290578500 ~x$r_buff0_thd2~0_In1290578500) (= 1 ~y~0_Out1290578500) (= ~x$r_buff1_thd1~0_Out1290578500 ~x$r_buff0_thd1~0_In1290578500) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1290578500)) (= ~x$r_buff1_thd0~0_Out1290578500 ~x$r_buff0_thd0~0_In1290578500)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1290578500, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1290578500, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1290578500, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1290578500} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1290578500, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1290578500, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1290578500, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1290578500, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1290578500, ~y~0=~y~0_Out1290578500, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1290578500, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1290578500} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-26 23:11:03,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L802-1-->L804: Formula: (and (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1610~0.base_11|) 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1610~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t1610~0.base_11| 0)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1610~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t1610~0.offset_10|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1610~0.base_11| 1)) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1610~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1610~0.base_11|) |v_ULTIMATE.start_main_~#t1610~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1610~0.base=|v_ULTIMATE.start_main_~#t1610~0.base_11|, ULTIMATE.start_main_~#t1610~0.offset=|v_ULTIMATE.start_main_~#t1610~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1610~0.base, ULTIMATE.start_main_~#t1610~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-26 23:11:03,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In670619936 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In670619936 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out670619936| ~x$w_buff0_used~0_In670619936) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out670619936| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In670619936, ~x$w_buff0_used~0=~x$w_buff0_used~0_In670619936} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out670619936|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In670619936, ~x$w_buff0_used~0=~x$w_buff0_used~0_In670619936} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:11:03,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1013553198 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1013553198 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1013553198 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-1013553198 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1013553198| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out-1013553198| ~x$w_buff1_used~0_In-1013553198)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1013553198, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1013553198, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1013553198, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1013553198} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1013553198|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1013553198, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1013553198, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1013553198, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1013553198} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:11:03,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1079002639 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1079002639 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd1~0_In-1079002639 ~x$r_buff0_thd1~0_Out-1079002639)) (and (not .cse1) (not .cse0) (= ~x$r_buff0_thd1~0_Out-1079002639 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1079002639, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1079002639} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-1079002639, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1079002639|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1079002639} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-26 23:11:03,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1296177102 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In1296177102 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1296177102 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In1296177102 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1296177102|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out1296177102| ~x$r_buff1_thd1~0_In1296177102)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1296177102, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1296177102, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1296177102, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1296177102} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1296177102, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1296177102|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1296177102, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1296177102, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1296177102} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:11:03,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L744-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_34|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_33|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_63} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-26 23:11:03,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-->L773: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~x$r_buff0_thd2~0_61 v_~x$r_buff0_thd2~0_60)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_25, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-26 23:11:03,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L773-->L773-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In725269849 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite30_Out725269849| ~x$r_buff1_thd2~0_In725269849) (= |P1Thread1of1ForFork1_#t~ite29_In725269849| |P1Thread1of1ForFork1_#t~ite29_Out725269849|)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In725269849 256)))) (or (and .cse1 (= (mod ~x$r_buff1_thd2~0_In725269849 256) 0)) (= (mod ~x$w_buff0_used~0_In725269849 256) 0) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In725269849 256))))) .cse0 (= |P1Thread1of1ForFork1_#t~ite30_Out725269849| |P1Thread1of1ForFork1_#t~ite29_Out725269849|) (= ~x$r_buff1_thd2~0_In725269849 |P1Thread1of1ForFork1_#t~ite29_Out725269849|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In725269849|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In725269849, ~x$w_buff1_used~0=~x$w_buff1_used~0_In725269849, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In725269849, ~weak$$choice2~0=~weak$$choice2~0_In725269849, ~x$w_buff0_used~0=~x$w_buff0_used~0_In725269849} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out725269849|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out725269849|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In725269849, ~x$w_buff1_used~0=~x$w_buff1_used~0_In725269849, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In725269849, ~weak$$choice2~0=~weak$$choice2~0_In725269849, ~x$w_buff0_used~0=~x$w_buff0_used~0_In725269849} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-26 23:11:03,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L775-->L779: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_6 v_~x~0_27) (not (= (mod v_~x$flush_delayed~0_9 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_27} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-26 23:11:03,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1563990958 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1563990958 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out-1563990958| ~x~0_In-1563990958) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In-1563990958 |P1Thread1of1ForFork1_#t~ite32_Out-1563990958|) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1563990958, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1563990958, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1563990958, ~x~0=~x~0_In-1563990958} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1563990958, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1563990958, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1563990958, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1563990958|, ~x~0=~x~0_In-1563990958} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-26 23:11:03,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L779-4-->L780: Formula: (= v_~x~0_39 |v_P1Thread1of1ForFork1_#t~ite32_10|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_9|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_13|, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-26 23:11:03,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1353825401 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1353825401 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1353825401 |P1Thread1of1ForFork1_#t~ite34_Out-1353825401|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1353825401|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1353825401, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1353825401} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1353825401|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1353825401, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1353825401} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 23:11:03,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-724431735 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-724431735 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-724431735 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-724431735 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-724431735|)) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-724431735 |P1Thread1of1ForFork1_#t~ite35_Out-724431735|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-724431735, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-724431735, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-724431735, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-724431735} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-724431735, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-724431735, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-724431735|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-724431735, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-724431735} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 23:11:03,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-2061795028 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-2061795028 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-2061795028| ~x$r_buff0_thd2~0_In-2061795028)) (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-2061795028|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2061795028, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2061795028} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2061795028, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-2061795028|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2061795028} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-26 23:11:03,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2009560143 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-2009560143 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-2009560143 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-2009560143 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-2009560143|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$r_buff1_thd2~0_In-2009560143 |P1Thread1of1ForFork1_#t~ite37_Out-2009560143|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2009560143, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2009560143, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2009560143, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2009560143} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2009560143, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2009560143, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2009560143, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-2009560143|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2009560143} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 23:11:03,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_91 |v_P1Thread1of1ForFork1_#t~ite37_24|) (= v_~__unbuffered_cnt~0_28 (+ v_~__unbuffered_cnt~0_29 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_24|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_91, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_23|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 23:11:03,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L804-1-->L810: Formula: (and (= 2 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-26 23:11:03,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite41_Out-1233204956| |ULTIMATE.start_main_#t~ite40_Out-1233204956|)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1233204956 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1233204956 256)))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-1233204956 |ULTIMATE.start_main_#t~ite40_Out-1233204956|) .cse2) (and (= |ULTIMATE.start_main_#t~ite40_Out-1233204956| ~x~0_In-1233204956) .cse2 (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1233204956, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1233204956, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1233204956, ~x~0=~x~0_In-1233204956} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1233204956|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1233204956|, ~x$w_buff1~0=~x$w_buff1~0_In-1233204956, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1233204956, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1233204956, ~x~0=~x~0_In-1233204956} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-26 23:11:03,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1773213805 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1773213805 256) 0))) (or (and (= ~x$w_buff0_used~0_In-1773213805 |ULTIMATE.start_main_#t~ite42_Out-1773213805|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-1773213805|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1773213805, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1773213805} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1773213805, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1773213805|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1773213805} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 23:11:03,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In534410883 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In534410883 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In534410883 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In534410883 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In534410883 |ULTIMATE.start_main_#t~ite43_Out534410883|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite43_Out534410883| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In534410883, ~x$w_buff1_used~0=~x$w_buff1_used~0_In534410883, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In534410883, ~x$w_buff0_used~0=~x$w_buff0_used~0_In534410883} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In534410883, ~x$w_buff1_used~0=~x$w_buff1_used~0_In534410883, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out534410883|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In534410883, ~x$w_buff0_used~0=~x$w_buff0_used~0_In534410883} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 23:11:03,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2093267938 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-2093267938 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-2093267938| ~x$r_buff0_thd0~0_In-2093267938)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-2093267938| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2093267938, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2093267938} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2093267938, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-2093267938|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2093267938} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 23:11:03,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In1490444397 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1490444397 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1490444397 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1490444397 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1490444397| ~x$r_buff1_thd0~0_In1490444397) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite45_Out1490444397|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1490444397, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1490444397, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1490444397, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1490444397} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1490444397, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1490444397, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1490444397, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1490444397|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1490444397} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 23:11:03,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_24) (= v_~x$r_buff1_thd0~0_96 |v_ULTIMATE.start_main_#t~ite45_53|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~y~0_57 2) (= v_~__unbuffered_p1_EBX~0_23 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_20 256))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~y~0=v_~y~0_57, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_53|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_57, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_96, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_52|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:11:03,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:11:03 BasicIcfg [2019-12-26 23:11:03,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:11:03,122 INFO L168 Benchmark]: Toolchain (without parser) took 12013.44 ms. Allocated memory was 148.9 MB in the beginning and 414.7 MB in the end (delta: 265.8 MB). Free memory was 105.1 MB in the beginning and 220.8 MB in the end (delta: -115.6 MB). Peak memory consumption was 150.2 MB. Max. memory is 7.1 GB. [2019-12-26 23:11:03,122 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 148.9 MB. Free memory was 125.2 MB in the beginning and 125.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-26 23:11:03,123 INFO L168 Benchmark]: CACSL2BoogieTranslator took 784.49 ms. Allocated memory was 148.9 MB in the beginning and 205.0 MB in the end (delta: 56.1 MB). Free memory was 104.9 MB in the beginning and 159.4 MB in the end (delta: -54.4 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:11:03,124 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.73 ms. Allocated memory is still 205.0 MB. Free memory was 159.4 MB in the beginning and 156.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:11:03,125 INFO L168 Benchmark]: Boogie Preprocessor took 44.87 ms. Allocated memory is still 205.0 MB. Free memory was 156.9 MB in the beginning and 154.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:11:03,125 INFO L168 Benchmark]: RCFGBuilder took 787.47 ms. Allocated memory is still 205.0 MB. Free memory was 154.4 MB in the beginning and 110.0 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-12-26 23:11:03,129 INFO L168 Benchmark]: TraceAbstraction took 10317.65 ms. Allocated memory was 205.0 MB in the beginning and 414.7 MB in the end (delta: 209.7 MB). Free memory was 110.0 MB in the beginning and 220.8 MB in the end (delta: -110.7 MB). Peak memory consumption was 99.0 MB. Max. memory is 7.1 GB. [2019-12-26 23:11:03,136 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.23 ms. Allocated memory is still 148.9 MB. Free memory was 125.2 MB in the beginning and 125.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 784.49 ms. Allocated memory was 148.9 MB in the beginning and 205.0 MB in the end (delta: 56.1 MB). Free memory was 104.9 MB in the beginning and 159.4 MB in the end (delta: -54.4 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.73 ms. Allocated memory is still 205.0 MB. Free memory was 159.4 MB in the beginning and 156.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.87 ms. Allocated memory is still 205.0 MB. Free memory was 156.9 MB in the beginning and 154.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 787.47 ms. Allocated memory is still 205.0 MB. Free memory was 154.4 MB in the beginning and 110.0 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10317.65 ms. Allocated memory was 205.0 MB in the beginning and 414.7 MB in the end (delta: 209.7 MB). Free memory was 110.0 MB in the beginning and 220.8 MB in the end (delta: -110.7 MB). Peak memory consumption was 99.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 148 ProgramPointsBefore, 77 ProgramPointsAfterwards, 182 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 30 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 25 ChoiceCompositions, 4597 VarBasedMoverChecksPositive, 304 VarBasedMoverChecksNegative, 234 SemBasedMoverChecksPositive, 186 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 76598 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1609, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L726] 1 x$w_buff1 = x$w_buff0 [L727] 1 x$w_buff0 = 1 [L728] 1 x$w_buff1_used = x$w_buff0_used [L729] 1 x$w_buff0_used = (_Bool)1 [L804] FCALL, FORK 0 pthread_create(&t1610, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L754] 2 y = 2 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 x$flush_delayed = weak$$choice2 [L766] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L767] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L767] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L768] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L768] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L769] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L769] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L770] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L770] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L771] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L779] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L811] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L812] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L813] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.0s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1416 SDtfs, 857 SDslu, 2053 SDs, 0 SdLazy, 809 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 2064 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 326 ConstructedInterpolants, 0 QuantifiedInterpolants, 29806 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...