/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/safe001_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:20:36,720 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:20:36,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:20:36,737 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:20:36,737 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:20:36,738 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:20:36,740 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:20:36,741 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:20:36,743 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:20:36,744 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:20:36,745 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:20:36,746 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:20:36,746 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:20:36,747 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:20:36,748 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:20:36,749 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:20:36,750 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:20:36,750 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:20:36,752 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:20:36,754 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:20:36,756 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:20:36,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:20:36,758 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:20:36,759 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:20:36,763 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:20:36,763 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:20:36,763 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:20:36,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:20:36,764 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:20:36,766 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:20:36,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:20:36,767 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:20:36,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:20:36,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:20:36,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:20:36,771 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:20:36,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:20:36,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:20:36,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:20:36,775 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:20:36,776 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:20:36,777 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-18 14:20:36,801 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:20:36,802 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:20:36,804 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:20:36,804 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:20:36,804 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:20:36,805 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:20:36,805 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:20:36,805 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:20:36,805 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:20:36,805 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:20:36,806 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:20:36,807 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:20:36,807 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:20:36,807 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:20:36,808 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:20:36,808 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:20:36,808 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:20:36,808 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:20:36,808 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:20:36,809 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:20:36,809 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:20:36,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:20:36,810 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:20:36,810 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:20:36,810 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:20:36,810 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:20:36,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:20:36,811 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:20:36,811 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:20:36,811 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:20:37,108 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:20:37,122 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:20:37,126 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:20:37,128 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:20:37,128 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:20:37,129 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_power.opt.i [2019-12-18 14:20:37,200 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99515b1e8/5d493c74fc704776969d23f42d7fba0b/FLAG8040f2fd0 [2019-12-18 14:20:37,813 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:20:37,814 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_power.opt.i [2019-12-18 14:20:37,840 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99515b1e8/5d493c74fc704776969d23f42d7fba0b/FLAG8040f2fd0 [2019-12-18 14:20:38,079 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99515b1e8/5d493c74fc704776969d23f42d7fba0b [2019-12-18 14:20:38,088 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:20:38,090 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:20:38,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:20:38,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:20:38,095 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:20:38,096 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:20:38" (1/1) ... [2019-12-18 14:20:38,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d6d8139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:20:38, skipping insertion in model container [2019-12-18 14:20:38,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:20:38" (1/1) ... [2019-12-18 14:20:38,108 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:20:38,174 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:20:38,681 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:20:38,693 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:20:38,774 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:20:38,843 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:20:38,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:20:38 WrapperNode [2019-12-18 14:20:38,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:20:38,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:20:38,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:20:38,845 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:20:38,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:20:38" (1/1) ... [2019-12-18 14:20:38,880 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:20:38" (1/1) ... [2019-12-18 14:20:38,913 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:20:38,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:20:38,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:20:38,914 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:20:38,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:20:38" (1/1) ... [2019-12-18 14:20:38,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:20:38" (1/1) ... [2019-12-18 14:20:38,930 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:20:38" (1/1) ... [2019-12-18 14:20:38,930 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:20:38" (1/1) ... [2019-12-18 14:20:38,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:20:38" (1/1) ... [2019-12-18 14:20:38,945 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:20:38" (1/1) ... [2019-12-18 14:20:38,949 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:20:38" (1/1) ... [2019-12-18 14:20:38,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:20:38,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:20:38,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:20:38,955 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:20:38,956 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:20:38" (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-18 14:20:39,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:20:39,026 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:20:39,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:20:39,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:20:39,027 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:20:39,027 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:20:39,027 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:20:39,027 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:20:39,027 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:20:39,028 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:20:39,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:20:39,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:20:39,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:20:39,030 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 14:20:39,846 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:20:39,846 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:20:39,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:20:39 BoogieIcfgContainer [2019-12-18 14:20:39,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:20:39,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:20:39,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:20:39,853 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:20:39,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:20:38" (1/3) ... [2019-12-18 14:20:39,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77970822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:20:39, skipping insertion in model container [2019-12-18 14:20:39,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:20:38" (2/3) ... [2019-12-18 14:20:39,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77970822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:20:39, skipping insertion in model container [2019-12-18 14:20:39,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:20:39" (3/3) ... [2019-12-18 14:20:39,857 INFO L109 eAbstractionObserver]: Analyzing ICFG safe001_power.opt.i [2019-12-18 14:20:39,867 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:20:39,868 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:20:39,878 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:20:39,879 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:20:39,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,934 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,934 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,941 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,942 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,942 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,942 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,942 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,949 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,949 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,960 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,960 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,963 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,964 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,964 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,968 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,969 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:39,985 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 14:20:40,006 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:20:40,006 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:20:40,006 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:20:40,007 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:20:40,007 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:20:40,007 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:20:40,007 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:20:40,007 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:20:40,024 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-18 14:20:40,026 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 14:20:40,114 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 14:20:40,114 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:20:40,136 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 14:20:40,166 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 14:20:40,214 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 14:20:40,214 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:20:40,223 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 14:20:40,241 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-18 14:20:40,242 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:20:45,018 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-18 14:20:45,366 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 14:20:45,488 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 14:20:45,520 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78277 [2019-12-18 14:20:45,520 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 14:20:45,524 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 106 transitions [2019-12-18 14:21:02,143 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 107408 states. [2019-12-18 14:21:02,145 INFO L276 IsEmpty]: Start isEmpty. Operand 107408 states. [2019-12-18 14:21:02,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:21:02,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:21:02,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:21:02,152 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:21:02,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:21:02,157 INFO L82 PathProgramCache]: Analyzing trace with hash 809703812, now seen corresponding path program 1 times [2019-12-18 14:21:02,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:21:02,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588620486] [2019-12-18 14:21:02,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:21:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:21:02,411 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-18 14:21:02,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588620486] [2019-12-18 14:21:02,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:21:02,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:21:02,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858370685] [2019-12-18 14:21:02,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:21:02,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:21:02,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:21:02,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:21:02,438 INFO L87 Difference]: Start difference. First operand 107408 states. Second operand 3 states. [2019-12-18 14:21:06,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:21:06,172 INFO L93 Difference]: Finished difference Result 107108 states and 460900 transitions. [2019-12-18 14:21:06,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:21:06,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:21:06,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:21:06,933 INFO L225 Difference]: With dead ends: 107108 [2019-12-18 14:21:06,933 INFO L226 Difference]: Without dead ends: 104924 [2019-12-18 14:21:06,934 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-18 14:21:10,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104924 states. [2019-12-18 14:21:13,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104924 to 104924. [2019-12-18 14:21:13,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104924 states. [2019-12-18 14:21:14,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104924 states to 104924 states and 451982 transitions. [2019-12-18 14:21:14,133 INFO L78 Accepts]: Start accepts. Automaton has 104924 states and 451982 transitions. Word has length 5 [2019-12-18 14:21:14,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:21:14,133 INFO L462 AbstractCegarLoop]: Abstraction has 104924 states and 451982 transitions. [2019-12-18 14:21:14,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:21:14,133 INFO L276 IsEmpty]: Start isEmpty. Operand 104924 states and 451982 transitions. [2019-12-18 14:21:14,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:21:14,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:21:14,140 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:21:14,140 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:21:14,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:21:14,140 INFO L82 PathProgramCache]: Analyzing trace with hash 2105056515, now seen corresponding path program 1 times [2019-12-18 14:21:14,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:21:14,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687430878] [2019-12-18 14:21:14,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:21:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:21:14,282 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-18 14:21:14,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687430878] [2019-12-18 14:21:14,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:21:14,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:21:14,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700752128] [2019-12-18 14:21:14,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:21:14,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:21:14,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:21:14,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:21:14,286 INFO L87 Difference]: Start difference. First operand 104924 states and 451982 transitions. Second operand 4 states. [2019-12-18 14:21:19,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:21:19,178 INFO L93 Difference]: Finished difference Result 168606 states and 697152 transitions. [2019-12-18 14:21:19,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:21:19,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:21:19,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:21:20,522 INFO L225 Difference]: With dead ends: 168606 [2019-12-18 14:21:20,523 INFO L226 Difference]: Without dead ends: 168557 [2019-12-18 14:21:20,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:21:27,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168557 states. [2019-12-18 14:21:30,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168557 to 152629. [2019-12-18 14:21:30,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152629 states. [2019-12-18 14:21:37,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152629 states to 152629 states and 638547 transitions. [2019-12-18 14:21:37,483 INFO L78 Accepts]: Start accepts. Automaton has 152629 states and 638547 transitions. Word has length 11 [2019-12-18 14:21:37,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:21:37,483 INFO L462 AbstractCegarLoop]: Abstraction has 152629 states and 638547 transitions. [2019-12-18 14:21:37,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:21:37,483 INFO L276 IsEmpty]: Start isEmpty. Operand 152629 states and 638547 transitions. [2019-12-18 14:21:37,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:21:37,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:21:37,490 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:21:37,490 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:21:37,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:21:37,491 INFO L82 PathProgramCache]: Analyzing trace with hash 2027270657, now seen corresponding path program 1 times [2019-12-18 14:21:37,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:21:37,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312170171] [2019-12-18 14:21:37,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:21:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:21:37,596 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-18 14:21:37,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312170171] [2019-12-18 14:21:37,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:21:37,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:21:37,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339423149] [2019-12-18 14:21:37,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:21:37,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:21:37,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:21:37,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:21:37,602 INFO L87 Difference]: Start difference. First operand 152629 states and 638547 transitions. Second operand 4 states. [2019-12-18 14:21:40,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:21:40,115 INFO L93 Difference]: Finished difference Result 217678 states and 889823 transitions. [2019-12-18 14:21:40,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:21:40,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:21:40,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:21:40,774 INFO L225 Difference]: With dead ends: 217678 [2019-12-18 14:21:40,774 INFO L226 Difference]: Without dead ends: 217615 [2019-12-18 14:21:40,775 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-18 14:21:51,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217615 states. [2019-12-18 14:21:54,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217615 to 183279. [2019-12-18 14:21:54,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183279 states. [2019-12-18 14:21:56,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183279 states to 183279 states and 761454 transitions. [2019-12-18 14:21:56,472 INFO L78 Accepts]: Start accepts. Automaton has 183279 states and 761454 transitions. Word has length 13 [2019-12-18 14:21:56,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:21:56,473 INFO L462 AbstractCegarLoop]: Abstraction has 183279 states and 761454 transitions. [2019-12-18 14:21:56,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:21:56,473 INFO L276 IsEmpty]: Start isEmpty. Operand 183279 states and 761454 transitions. [2019-12-18 14:21:56,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:21:56,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:21:56,477 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:21:56,477 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:21:56,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:21:56,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1789207667, now seen corresponding path program 1 times [2019-12-18 14:21:56,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:21:56,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522274518] [2019-12-18 14:21:56,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:21:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:21:56,552 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-18 14:21:56,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522274518] [2019-12-18 14:21:56,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:21:56,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:21:56,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017319282] [2019-12-18 14:21:56,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:21:56,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:21:56,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:21:56,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:21:56,557 INFO L87 Difference]: Start difference. First operand 183279 states and 761454 transitions. Second operand 3 states. [2019-12-18 14:21:56,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:21:56,683 INFO L93 Difference]: Finished difference Result 36985 states and 120640 transitions. [2019-12-18 14:21:56,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:21:56,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 14:21:56,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:21:56,740 INFO L225 Difference]: With dead ends: 36985 [2019-12-18 14:21:56,741 INFO L226 Difference]: Without dead ends: 36985 [2019-12-18 14:21:56,741 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-18 14:21:56,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36985 states. [2019-12-18 14:21:57,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36985 to 36985. [2019-12-18 14:21:57,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36985 states. [2019-12-18 14:21:57,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36985 states to 36985 states and 120640 transitions. [2019-12-18 14:21:57,446 INFO L78 Accepts]: Start accepts. Automaton has 36985 states and 120640 transitions. Word has length 13 [2019-12-18 14:21:57,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:21:57,447 INFO L462 AbstractCegarLoop]: Abstraction has 36985 states and 120640 transitions. [2019-12-18 14:21:57,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:21:57,447 INFO L276 IsEmpty]: Start isEmpty. Operand 36985 states and 120640 transitions. [2019-12-18 14:21:57,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 14:21:57,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:21:57,452 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:21:57,452 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:21:57,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:21:57,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1405830784, now seen corresponding path program 1 times [2019-12-18 14:21:57,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:21:57,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787441970] [2019-12-18 14:21:57,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:21:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:21:57,553 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-18 14:21:57,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787441970] [2019-12-18 14:21:57,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:21:57,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:21:57,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423166354] [2019-12-18 14:21:57,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:21:57,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:21:57,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:21:57,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:21:57,555 INFO L87 Difference]: Start difference. First operand 36985 states and 120640 transitions. Second operand 5 states. [2019-12-18 14:21:59,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:21:59,604 INFO L93 Difference]: Finished difference Result 50257 states and 160609 transitions. [2019-12-18 14:21:59,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:21:59,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 14:21:59,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:21:59,686 INFO L225 Difference]: With dead ends: 50257 [2019-12-18 14:21:59,686 INFO L226 Difference]: Without dead ends: 50244 [2019-12-18 14:21:59,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:21:59,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50244 states. [2019-12-18 14:22:00,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50244 to 37328. [2019-12-18 14:22:00,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37328 states. [2019-12-18 14:22:00,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37328 states to 37328 states and 121606 transitions. [2019-12-18 14:22:00,406 INFO L78 Accepts]: Start accepts. Automaton has 37328 states and 121606 transitions. Word has length 19 [2019-12-18 14:22:00,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:22:00,406 INFO L462 AbstractCegarLoop]: Abstraction has 37328 states and 121606 transitions. [2019-12-18 14:22:00,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:22:00,406 INFO L276 IsEmpty]: Start isEmpty. Operand 37328 states and 121606 transitions. [2019-12-18 14:22:00,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:22:00,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:22:00,418 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-18 14:22:00,418 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:22:00,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:22:00,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1721998258, now seen corresponding path program 1 times [2019-12-18 14:22:00,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:22:00,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36871727] [2019-12-18 14:22:00,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:22:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:22:00,491 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-18 14:22:00,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36871727] [2019-12-18 14:22:00,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:22:00,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:22:00,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737168328] [2019-12-18 14:22:00,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:22:00,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:22:00,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:22:00,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:22:00,499 INFO L87 Difference]: Start difference. First operand 37328 states and 121606 transitions. Second operand 4 states. [2019-12-18 14:22:00,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:22:00,545 INFO L93 Difference]: Finished difference Result 7104 states and 19431 transitions. [2019-12-18 14:22:00,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:22:00,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 14:22:00,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:22:00,561 INFO L225 Difference]: With dead ends: 7104 [2019-12-18 14:22:00,561 INFO L226 Difference]: Without dead ends: 7104 [2019-12-18 14:22:00,561 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-18 14:22:00,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7104 states. [2019-12-18 14:22:00,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7104 to 6992. [2019-12-18 14:22:00,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6992 states. [2019-12-18 14:22:00,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6992 states to 6992 states and 19111 transitions. [2019-12-18 14:22:00,646 INFO L78 Accepts]: Start accepts. Automaton has 6992 states and 19111 transitions. Word has length 25 [2019-12-18 14:22:00,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:22:00,646 INFO L462 AbstractCegarLoop]: Abstraction has 6992 states and 19111 transitions. [2019-12-18 14:22:00,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:22:00,647 INFO L276 IsEmpty]: Start isEmpty. Operand 6992 states and 19111 transitions. [2019-12-18 14:22:00,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 14:22:00,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:22:00,657 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] [2019-12-18 14:22:00,658 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:22:00,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:22:00,658 INFO L82 PathProgramCache]: Analyzing trace with hash 2138974623, now seen corresponding path program 1 times [2019-12-18 14:22:00,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:22:00,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472915078] [2019-12-18 14:22:00,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:22:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:22:00,749 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-18 14:22:00,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472915078] [2019-12-18 14:22:00,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:22:00,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:22:00,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679839030] [2019-12-18 14:22:00,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:22:00,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:22:00,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:22:00,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:22:00,752 INFO L87 Difference]: Start difference. First operand 6992 states and 19111 transitions. Second operand 5 states. [2019-12-18 14:22:02,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:22:02,259 INFO L93 Difference]: Finished difference Result 5024 states and 14421 transitions. [2019-12-18 14:22:02,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:22:02,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 14:22:02,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:22:02,267 INFO L225 Difference]: With dead ends: 5024 [2019-12-18 14:22:02,268 INFO L226 Difference]: Without dead ends: 5024 [2019-12-18 14:22:02,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:22:02,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5024 states. [2019-12-18 14:22:02,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5024 to 4660. [2019-12-18 14:22:02,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2019-12-18 14:22:02,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 13437 transitions. [2019-12-18 14:22:02,341 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 13437 transitions. Word has length 37 [2019-12-18 14:22:02,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:22:02,342 INFO L462 AbstractCegarLoop]: Abstraction has 4660 states and 13437 transitions. [2019-12-18 14:22:02,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:22:02,342 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 13437 transitions. [2019-12-18 14:22:02,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:22:02,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:22:02,349 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:22:02,350 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:22:02,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:22:02,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1030638940, now seen corresponding path program 1 times [2019-12-18 14:22:02,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:22:02,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919209890] [2019-12-18 14:22:02,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:22:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:22:02,425 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-18 14:22:02,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919209890] [2019-12-18 14:22:02,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:22:02,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:22:02,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794134919] [2019-12-18 14:22:02,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:22:02,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:22:02,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:22:02,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:22:02,428 INFO L87 Difference]: Start difference. First operand 4660 states and 13437 transitions. Second operand 3 states. [2019-12-18 14:22:02,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:22:02,482 INFO L93 Difference]: Finished difference Result 4669 states and 13450 transitions. [2019-12-18 14:22:02,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:22:02,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:22:02,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:22:02,491 INFO L225 Difference]: With dead ends: 4669 [2019-12-18 14:22:02,491 INFO L226 Difference]: Without dead ends: 4669 [2019-12-18 14:22:02,491 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-18 14:22:02,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-18 14:22:02,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-18 14:22:02,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-18 14:22:02,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13446 transitions. [2019-12-18 14:22:02,550 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13446 transitions. Word has length 65 [2019-12-18 14:22:02,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:22:02,551 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13446 transitions. [2019-12-18 14:22:02,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:22:02,551 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13446 transitions. [2019-12-18 14:22:02,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:22:02,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:22:02,557 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:22:02,557 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:22:02,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:22:02,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1902070617, now seen corresponding path program 1 times [2019-12-18 14:22:02,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:22:02,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729075230] [2019-12-18 14:22:02,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:22:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:22:02,628 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-18 14:22:02,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729075230] [2019-12-18 14:22:02,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:22:02,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:22:02,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877098960] [2019-12-18 14:22:02,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:22:02,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:22:02,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:22:02,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:22:02,630 INFO L87 Difference]: Start difference. First operand 4665 states and 13446 transitions. Second operand 3 states. [2019-12-18 14:22:02,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:22:02,682 INFO L93 Difference]: Finished difference Result 4669 states and 13441 transitions. [2019-12-18 14:22:02,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:22:02,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:22:02,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:22:02,690 INFO L225 Difference]: With dead ends: 4669 [2019-12-18 14:22:02,690 INFO L226 Difference]: Without dead ends: 4669 [2019-12-18 14:22:02,691 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-18 14:22:02,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-18 14:22:02,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-18 14:22:02,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-18 14:22:02,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13437 transitions. [2019-12-18 14:22:02,776 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13437 transitions. Word has length 65 [2019-12-18 14:22:02,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:22:02,776 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13437 transitions. [2019-12-18 14:22:02,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:22:02,777 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13437 transitions. [2019-12-18 14:22:02,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:22:02,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:22:02,786 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:22:02,787 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:22:02,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:22:02,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1892358751, now seen corresponding path program 1 times [2019-12-18 14:22:02,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:22:02,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499018741] [2019-12-18 14:22:02,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:22:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:22:02,899 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-18 14:22:02,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499018741] [2019-12-18 14:22:02,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:22:02,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:22:02,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60307447] [2019-12-18 14:22:02,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:22:02,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:22:02,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:22:02,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:22:02,902 INFO L87 Difference]: Start difference. First operand 4665 states and 13437 transitions. Second operand 3 states. [2019-12-18 14:22:02,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:22:02,932 INFO L93 Difference]: Finished difference Result 4413 states and 12532 transitions. [2019-12-18 14:22:02,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:22:02,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:22:02,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:22:02,938 INFO L225 Difference]: With dead ends: 4413 [2019-12-18 14:22:02,939 INFO L226 Difference]: Without dead ends: 4413 [2019-12-18 14:22:02,939 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-18 14:22:02,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4413 states. [2019-12-18 14:22:03,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4413 to 4413. [2019-12-18 14:22:03,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4413 states. [2019-12-18 14:22:03,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4413 states to 4413 states and 12532 transitions. [2019-12-18 14:22:03,016 INFO L78 Accepts]: Start accepts. Automaton has 4413 states and 12532 transitions. Word has length 65 [2019-12-18 14:22:03,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:22:03,017 INFO L462 AbstractCegarLoop]: Abstraction has 4413 states and 12532 transitions. [2019-12-18 14:22:03,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:22:03,017 INFO L276 IsEmpty]: Start isEmpty. Operand 4413 states and 12532 transitions. [2019-12-18 14:22:03,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:22:03,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:22:03,025 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:22:03,025 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:22:03,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:22:03,026 INFO L82 PathProgramCache]: Analyzing trace with hash 981685475, now seen corresponding path program 1 times [2019-12-18 14:22:03,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:22:03,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477871090] [2019-12-18 14:22:03,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:22:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:22:03,167 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-18 14:22:03,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477871090] [2019-12-18 14:22:03,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:22:03,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:22:03,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378323841] [2019-12-18 14:22:03,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:22:03,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:22:03,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:22:03,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:22:03,169 INFO L87 Difference]: Start difference. First operand 4413 states and 12532 transitions. Second operand 3 states. [2019-12-18 14:22:03,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:22:03,194 INFO L93 Difference]: Finished difference Result 4413 states and 12340 transitions. [2019-12-18 14:22:03,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:22:03,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 14:22:03,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:22:03,200 INFO L225 Difference]: With dead ends: 4413 [2019-12-18 14:22:03,201 INFO L226 Difference]: Without dead ends: 4413 [2019-12-18 14:22:03,201 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-18 14:22:03,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4413 states. [2019-12-18 14:22:03,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4413 to 4413. [2019-12-18 14:22:03,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4413 states. [2019-12-18 14:22:03,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4413 states to 4413 states and 12340 transitions. [2019-12-18 14:22:03,269 INFO L78 Accepts]: Start accepts. Automaton has 4413 states and 12340 transitions. Word has length 66 [2019-12-18 14:22:03,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:22:03,269 INFO L462 AbstractCegarLoop]: Abstraction has 4413 states and 12340 transitions. [2019-12-18 14:22:03,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:22:03,270 INFO L276 IsEmpty]: Start isEmpty. Operand 4413 states and 12340 transitions. [2019-12-18 14:22:03,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:22:03,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:22:03,275 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:22:03,276 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:22:03,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:22:03,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1724172683, now seen corresponding path program 1 times [2019-12-18 14:22:03,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:22:03,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797209634] [2019-12-18 14:22:03,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:22:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:22:03,362 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-18 14:22:03,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797209634] [2019-12-18 14:22:03,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:22:03,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:22:03,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095630800] [2019-12-18 14:22:03,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:22:03,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:22:03,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:22:03,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:22:03,364 INFO L87 Difference]: Start difference. First operand 4413 states and 12340 transitions. Second operand 5 states. [2019-12-18 14:22:03,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:22:03,638 INFO L93 Difference]: Finished difference Result 6679 states and 18593 transitions. [2019-12-18 14:22:03,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:22:03,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-18 14:22:03,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:22:03,648 INFO L225 Difference]: With dead ends: 6679 [2019-12-18 14:22:03,648 INFO L226 Difference]: Without dead ends: 6679 [2019-12-18 14:22:03,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:22:03,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6679 states. [2019-12-18 14:22:03,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6679 to 5169. [2019-12-18 14:22:03,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5169 states. [2019-12-18 14:22:03,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5169 states to 5169 states and 14506 transitions. [2019-12-18 14:22:03,722 INFO L78 Accepts]: Start accepts. Automaton has 5169 states and 14506 transitions. Word has length 67 [2019-12-18 14:22:03,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:22:03,723 INFO L462 AbstractCegarLoop]: Abstraction has 5169 states and 14506 transitions. [2019-12-18 14:22:03,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:22:03,723 INFO L276 IsEmpty]: Start isEmpty. Operand 5169 states and 14506 transitions. [2019-12-18 14:22:03,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:22:03,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:22:03,730 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:22:03,731 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:22:03,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:22:03,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1093155317, now seen corresponding path program 2 times [2019-12-18 14:22:03,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:22:03,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747795470] [2019-12-18 14:22:03,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:22:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:22:04,069 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-18 14:22:04,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747795470] [2019-12-18 14:22:04,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:22:04,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:22:04,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580895404] [2019-12-18 14:22:04,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:22:04,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:22:04,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:22:04,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:22:04,076 INFO L87 Difference]: Start difference. First operand 5169 states and 14506 transitions. Second operand 9 states. [2019-12-18 14:22:04,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:22:04,835 INFO L93 Difference]: Finished difference Result 7114 states and 19697 transitions. [2019-12-18 14:22:04,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 14:22:04,835 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 14:22:04,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:22:04,848 INFO L225 Difference]: With dead ends: 7114 [2019-12-18 14:22:04,848 INFO L226 Difference]: Without dead ends: 7114 [2019-12-18 14:22:04,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:22:04,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7114 states. [2019-12-18 14:22:04,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7114 to 5330. [2019-12-18 14:22:04,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5330 states. [2019-12-18 14:22:04,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5330 states to 5330 states and 14959 transitions. [2019-12-18 14:22:04,981 INFO L78 Accepts]: Start accepts. Automaton has 5330 states and 14959 transitions. Word has length 67 [2019-12-18 14:22:04,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:22:04,982 INFO L462 AbstractCegarLoop]: Abstraction has 5330 states and 14959 transitions. [2019-12-18 14:22:04,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:22:04,982 INFO L276 IsEmpty]: Start isEmpty. Operand 5330 states and 14959 transitions. [2019-12-18 14:22:04,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:22:04,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:22:04,992 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:22:04,993 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:22:04,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:22:04,993 INFO L82 PathProgramCache]: Analyzing trace with hash -346409133, now seen corresponding path program 3 times [2019-12-18 14:22:04,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:22:04,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046601158] [2019-12-18 14:22:04,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:22:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:22:05,202 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-18 14:22:05,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046601158] [2019-12-18 14:22:05,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:22:05,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:22:05,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526363794] [2019-12-18 14:22:05,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 14:22:05,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:22:05,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 14:22:05,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:22:05,204 INFO L87 Difference]: Start difference. First operand 5330 states and 14959 transitions. Second operand 8 states. [2019-12-18 14:22:06,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:22:06,238 INFO L93 Difference]: Finished difference Result 10812 states and 29771 transitions. [2019-12-18 14:22:06,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 14:22:06,239 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-12-18 14:22:06,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:22:06,254 INFO L225 Difference]: With dead ends: 10812 [2019-12-18 14:22:06,254 INFO L226 Difference]: Without dead ends: 10812 [2019-12-18 14:22:06,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-12-18 14:22:06,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10812 states. [2019-12-18 14:22:06,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10812 to 5596. [2019-12-18 14:22:06,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5596 states. [2019-12-18 14:22:06,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5596 states to 5596 states and 15704 transitions. [2019-12-18 14:22:06,398 INFO L78 Accepts]: Start accepts. Automaton has 5596 states and 15704 transitions. Word has length 67 [2019-12-18 14:22:06,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:22:06,399 INFO L462 AbstractCegarLoop]: Abstraction has 5596 states and 15704 transitions. [2019-12-18 14:22:06,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 14:22:06,399 INFO L276 IsEmpty]: Start isEmpty. Operand 5596 states and 15704 transitions. [2019-12-18 14:22:06,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:22:06,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:22:06,406 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:22:06,406 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:22:06,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:22:06,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1430541189, now seen corresponding path program 4 times [2019-12-18 14:22:06,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:22:06,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238422586] [2019-12-18 14:22:06,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:22:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:22:06,477 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-18 14:22:06,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238422586] [2019-12-18 14:22:06,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:22:06,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:22:06,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443879459] [2019-12-18 14:22:06,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:22:06,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:22:06,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:22:06,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:22:06,479 INFO L87 Difference]: Start difference. First operand 5596 states and 15704 transitions. Second operand 3 states. [2019-12-18 14:22:06,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:22:06,523 INFO L93 Difference]: Finished difference Result 5596 states and 15703 transitions. [2019-12-18 14:22:06,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:22:06,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 14:22:06,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:22:06,531 INFO L225 Difference]: With dead ends: 5596 [2019-12-18 14:22:06,532 INFO L226 Difference]: Without dead ends: 5596 [2019-12-18 14:22:06,534 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-18 14:22:06,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5596 states. [2019-12-18 14:22:06,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5596 to 3262. [2019-12-18 14:22:06,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3262 states. [2019-12-18 14:22:06,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 9150 transitions. [2019-12-18 14:22:06,603 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 9150 transitions. Word has length 67 [2019-12-18 14:22:06,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:22:06,603 INFO L462 AbstractCegarLoop]: Abstraction has 3262 states and 9150 transitions. [2019-12-18 14:22:06,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:22:06,604 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 9150 transitions. [2019-12-18 14:22:06,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:22:06,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:22:06,608 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:22:06,608 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:22:06,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:22:06,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1652885238, now seen corresponding path program 1 times [2019-12-18 14:22:06,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:22:06,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486188708] [2019-12-18 14:22:06,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:22:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:22:06,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-18 14:22:06,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486188708] [2019-12-18 14:22:06,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:22:06,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:22:06,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337686125] [2019-12-18 14:22:06,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:22:06,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:22:06,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:22:06,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:22:06,742 INFO L87 Difference]: Start difference. First operand 3262 states and 9150 transitions. Second operand 7 states. [2019-12-18 14:22:06,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:22:06,848 INFO L93 Difference]: Finished difference Result 5511 states and 15445 transitions. [2019-12-18 14:22:06,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:22:06,849 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-18 14:22:06,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:22:06,853 INFO L225 Difference]: With dead ends: 5511 [2019-12-18 14:22:06,854 INFO L226 Difference]: Without dead ends: 2857 [2019-12-18 14:22:06,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:22:06,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2019-12-18 14:22:06,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 2476. [2019-12-18 14:22:06,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2476 states. [2019-12-18 14:22:06,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 6880 transitions. [2019-12-18 14:22:06,907 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 6880 transitions. Word has length 68 [2019-12-18 14:22:06,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:22:06,907 INFO L462 AbstractCegarLoop]: Abstraction has 2476 states and 6880 transitions. [2019-12-18 14:22:06,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:22:06,907 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 6880 transitions. [2019-12-18 14:22:06,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:22:06,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:22:06,912 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:22:06,913 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:22:06,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:22:06,913 INFO L82 PathProgramCache]: Analyzing trace with hash 942277324, now seen corresponding path program 2 times [2019-12-18 14:22:06,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:22:06,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137318361] [2019-12-18 14:22:06,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:22:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:22:07,164 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-18 14:22:07,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137318361] [2019-12-18 14:22:07,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:22:07,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:22:07,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058932618] [2019-12-18 14:22:07,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 14:22:07,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:22:07,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 14:22:07,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:22:07,166 INFO L87 Difference]: Start difference. First operand 2476 states and 6880 transitions. Second operand 13 states. [2019-12-18 14:22:07,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:22:07,628 INFO L93 Difference]: Finished difference Result 6542 states and 18173 transitions. [2019-12-18 14:22:07,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:22:07,629 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-18 14:22:07,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:22:07,634 INFO L225 Difference]: With dead ends: 6542 [2019-12-18 14:22:07,634 INFO L226 Difference]: Without dead ends: 2795 [2019-12-18 14:22:07,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-12-18 14:22:07,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2795 states. [2019-12-18 14:22:07,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2795 to 2188. [2019-12-18 14:22:07,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2188 states. [2019-12-18 14:22:07,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 2188 states and 6098 transitions. [2019-12-18 14:22:07,667 INFO L78 Accepts]: Start accepts. Automaton has 2188 states and 6098 transitions. Word has length 68 [2019-12-18 14:22:07,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:22:07,667 INFO L462 AbstractCegarLoop]: Abstraction has 2188 states and 6098 transitions. [2019-12-18 14:22:07,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 14:22:07,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2188 states and 6098 transitions. [2019-12-18 14:22:07,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:22:07,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:22:07,670 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:22:07,670 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:22:07,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:22:07,671 INFO L82 PathProgramCache]: Analyzing trace with hash -282457248, now seen corresponding path program 3 times [2019-12-18 14:22:07,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:22:07,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474764168] [2019-12-18 14:22:07,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:22:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:22:07,798 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-18 14:22:07,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474764168] [2019-12-18 14:22:07,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:22:07,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:22:07,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572176235] [2019-12-18 14:22:07,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:22:07,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:22:07,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:22:07,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:22:07,802 INFO L87 Difference]: Start difference. First operand 2188 states and 6098 transitions. Second operand 7 states. [2019-12-18 14:22:07,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:22:07,906 INFO L93 Difference]: Finished difference Result 4625 states and 12935 transitions. [2019-12-18 14:22:07,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:22:07,906 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-18 14:22:07,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:22:07,910 INFO L225 Difference]: With dead ends: 4625 [2019-12-18 14:22:07,910 INFO L226 Difference]: Without dead ends: 2605 [2019-12-18 14:22:07,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:22:07,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2605 states. [2019-12-18 14:22:07,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2605 to 2152. [2019-12-18 14:22:07,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2019-12-18 14:22:07,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 6002 transitions. [2019-12-18 14:22:07,952 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 6002 transitions. Word has length 68 [2019-12-18 14:22:07,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:22:07,952 INFO L462 AbstractCegarLoop]: Abstraction has 2152 states and 6002 transitions. [2019-12-18 14:22:07,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:22:07,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 6002 transitions. [2019-12-18 14:22:07,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:22:07,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:22:07,960 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:22:07,960 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:22:07,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:22:07,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1259160564, now seen corresponding path program 4 times [2019-12-18 14:22:07,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:22:07,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378655232] [2019-12-18 14:22:07,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:22:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:22:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:22:08,130 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:22:08,130 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:22:08,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t1804~0.base_20| 1)) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1804~0.base_20|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1804~0.base_20| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1804~0.base_20|) |v_ULTIMATE.start_main_~#t1804~0.offset_17| 0)) |v_#memory_int_21|) (= 0 v_~x~0_194) (= 0 v_~x$r_buff0_thd2~0_213) (= 0 v_~weak$$choice0~0_14) (= v_~x$mem_tmp~0_19 0) (= 0 v_~x$w_buff0~0_268) (= 0 v_~x$r_buff1_thd2~0_212) (= v_~x$r_buff1_thd0~0_297 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd1~0_187 0) (= v_~x$r_buff0_thd0~0_372 0) (= v_~y~0_143 0) (= 0 v_~x$read_delayed~0_6) (= v_~__unbuffered_cnt~0_155 0) (= 0 v_~x$w_buff1~0_230) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p0_EAX~0_24) (= 0 v_~x$r_buff1_thd3~0_195) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1804~0.base_20|)) (= 0 v_~x$r_buff0_thd3~0_123) (= |v_#NULL.offset_4| 0) (= 0 v_~x$w_buff1_used~0_504) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~x$r_buff0_thd1~0_120 0) (= 0 v_~__unbuffered_p2_EAX~0_22) (= |v_ULTIMATE.start_main_~#t1804~0.offset_17| 0) (= v_~x$flush_delayed~0_34 0) (= v_~main$tmp_guard0~0_24 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1804~0.base_20| 4)) (= v_~weak$$choice2~0_110 0) (= 0 v_~x$w_buff0_used~0_807) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ~x$w_buff0~0=v_~x$w_buff0~0_268, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ~x$flush_delayed~0=v_~x$flush_delayed~0_34, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_39|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_45|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_187, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_123, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_50|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_32|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ULTIMATE.start_main_~#t1805~0.offset=|v_ULTIMATE.start_main_~#t1805~0.offset_17|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_372, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_37|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_42|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_504, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_212, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_48|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_111|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t1805~0.base=|v_ULTIMATE.start_main_~#t1805~0.base_21|, ULTIMATE.start_main_~#t1806~0.offset=|v_ULTIMATE.start_main_~#t1806~0.offset_16|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_32|, ULTIMATE.start_main_~#t1804~0.base=|v_ULTIMATE.start_main_~#t1804~0.base_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~x~0=v_~x~0_194, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_120, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_33|, ULTIMATE.start_main_~#t1804~0.offset=|v_ULTIMATE.start_main_~#t1804~0.offset_17|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_29|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_195, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_125|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_25|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ULTIMATE.start_main_~#t1806~0.base=|v_ULTIMATE.start_main_~#t1806~0.base_20|, ~y~0=v_~y~0_143, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_48|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_297, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_213, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_38|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_807, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_110, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1805~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ULTIMATE.start_main_~#t1805~0.base, ULTIMATE.start_main_~#t1806~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1804~0.base, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1804~0.offset, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1806~0.base, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 14:22:08,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L805-1-->L807: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1805~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1805~0.base_11| 4)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1805~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1805~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1805~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1805~0.base_11|) |v_ULTIMATE.start_main_~#t1805~0.offset_10| 1)) |v_#memory_int_13|) (= |v_ULTIMATE.start_main_~#t1805~0.offset_10| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1805~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1805~0.offset=|v_ULTIMATE.start_main_~#t1805~0.offset_10|, ULTIMATE.start_main_~#t1805~0.base=|v_ULTIMATE.start_main_~#t1805~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1805~0.offset, ULTIMATE.start_main_~#t1805~0.base] because there is no mapped edge [2019-12-18 14:22:08,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1806~0.base_9| 1)) (not (= |v_ULTIMATE.start_main_~#t1806~0.base_9| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1806~0.base_9|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1806~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1806~0.base_9|) |v_ULTIMATE.start_main_~#t1806~0.offset_8| 2)) |v_#memory_int_9|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1806~0.base_9| 4)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1806~0.base_9|) 0) (= |v_ULTIMATE.start_main_~#t1806~0.offset_8| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1806~0.base=|v_ULTIMATE.start_main_~#t1806~0.base_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1806~0.offset=|v_ULTIMATE.start_main_~#t1806~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1806~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1806~0.offset] because there is no mapped edge [2019-12-18 14:22:08,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_11| v_P1Thread1of1ForFork1_~arg.offset_11) (= 1 v_~x$w_buff0_used~0_98) (= 2 v_~x$w_buff0~0_31) (= v_P1Thread1of1ForFork1_~arg.base_11 |v_P1Thread1of1ForFork1_#in~arg.base_11|) (= v_~x$w_buff1_used~0_55 v_~x$w_buff0_used~0_99) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 0 (mod v_~x$w_buff1_used~0_55 256)) (= v_~x$w_buff0~0_32 v_~x$w_buff1~0_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13, ~x$w_buff0~0=v_~x$w_buff0~0_31, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_11, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_11, ~x$w_buff1~0=v_~x$w_buff1~0_21, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 14:22:08,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In-937592390 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-937592390 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out-937592390| ~x$w_buff1~0_In-937592390) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out-937592390| ~x~0_In-937592390) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-937592390, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-937592390, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-937592390, ~x~0=~x~0_In-937592390} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-937592390|, ~x$w_buff1~0=~x$w_buff1~0_In-937592390, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-937592390, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-937592390, ~x~0=~x~0_In-937592390} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 14:22:08,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L782-4-->L783: Formula: (= v_~x~0_20 |v_P2Thread1of1ForFork2_#t~ite15_12|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_12|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_11|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-18 14:22:08,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1692280045 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1692280045 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite17_Out1692280045| ~x$w_buff0_used~0_In1692280045) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out1692280045| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1692280045, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1692280045} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1692280045, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out1692280045|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1692280045} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 14:22:08,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In-636911909 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-636911909 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In-636911909 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-636911909 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite18_Out-636911909| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite18_Out-636911909| ~x$w_buff1_used~0_In-636911909) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-636911909, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-636911909, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-636911909, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-636911909} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-636911909, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-636911909, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-636911909, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-636911909|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-636911909} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 14:22:08,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L733-2-->L733-5: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-1713021355 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1713021355 256))) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out-1713021355| |P0Thread1of1ForFork0_#t~ite3_Out-1713021355|))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out-1713021355| ~x~0_In-1713021355) (or .cse0 .cse1) .cse2) (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-1713021355 |P0Thread1of1ForFork0_#t~ite3_Out-1713021355|) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1713021355, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1713021355, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1713021355, ~x~0=~x~0_In-1713021355} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1713021355|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1713021355|, ~x$w_buff1~0=~x$w_buff1~0_In-1713021355, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1713021355, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1713021355, ~x~0=~x~0_In-1713021355} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 14:22:08,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L734-->L734-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In1985779451 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1985779451 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1985779451| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1985779451| ~x$w_buff0_used~0_In1985779451) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1985779451, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1985779451} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1985779451|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1985779451, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1985779451} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 14:22:08,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L735-->L735-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-2055884663 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-2055884663 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-2055884663 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In-2055884663 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-2055884663| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out-2055884663| ~x$w_buff1_used~0_In-2055884663) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2055884663, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2055884663, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2055884663, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2055884663} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-2055884663|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2055884663, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2055884663, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2055884663, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2055884663} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 14:22:08,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In1170543033 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1170543033 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite19_Out1170543033|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd3~0_In1170543033 |P2Thread1of1ForFork2_#t~ite19_Out1170543033|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1170543033, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1170543033} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1170543033, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out1170543033|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1170543033} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 14:22:08,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L786-->L786-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In832608470 256))) (.cse3 (= (mod ~x$r_buff0_thd3~0_In832608470 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In832608470 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In832608470 256) 0))) (or (and (= ~x$r_buff1_thd3~0_In832608470 |P2Thread1of1ForFork2_#t~ite20_Out832608470|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite20_Out832608470| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In832608470, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In832608470, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In832608470, ~x$w_buff0_used~0=~x$w_buff0_used~0_In832608470} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out832608470|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In832608470, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In832608470, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In832608470, ~x$w_buff0_used~0=~x$w_buff0_used~0_In832608470} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 14:22:08,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= |v_P2Thread1of1ForFork2_#t~ite20_54| v_~x$r_buff1_thd3~0_147)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_54|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_53|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_147, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 14:22:08,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L736-->L736-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1937252112 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1937252112 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite7_Out1937252112| ~x$r_buff0_thd1~0_In1937252112) (or .cse0 .cse1)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out1937252112| 0) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1937252112, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1937252112} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1937252112, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1937252112|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1937252112} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 14:22:08,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L737-->L737-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1108707664 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-1108707664 256))) (.cse1 (= (mod ~x$r_buff1_thd1~0_In-1108707664 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1108707664 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1108707664| ~x$r_buff1_thd1~0_In-1108707664) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1108707664| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1108707664, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1108707664, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1108707664, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1108707664} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1108707664, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1108707664|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1108707664, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1108707664, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1108707664} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 14:22:08,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L737-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_61 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= (+ 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_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, 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_61} 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-18 14:22:08,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In480667018 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In480667018 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out480667018| ~x$w_buff0_used~0_In480667018) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out480667018| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In480667018, ~x$w_buff0_used~0=~x$w_buff0_used~0_In480667018} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out480667018|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In480667018, ~x$w_buff0_used~0=~x$w_buff0_used~0_In480667018} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 14:22:08,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L764-->L764-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-766158781 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-766158781 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-766158781 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-766158781 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-766158781 |P1Thread1of1ForFork1_#t~ite12_Out-766158781|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-766158781|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-766158781, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-766158781, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-766158781, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-766158781} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-766158781, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-766158781, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-766158781|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-766158781, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-766158781} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 14:22:08,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L766: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1207307772 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1207307772 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out-1207307772 ~x$r_buff0_thd2~0_In-1207307772)) (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out-1207307772 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1207307772, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1207307772} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1207307772|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1207307772, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1207307772} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 14:22:08,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L766-->L766-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In-37110493 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-37110493 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-37110493 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-37110493 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out-37110493| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite14_Out-37110493| ~x$r_buff1_thd2~0_In-37110493)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-37110493, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-37110493, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-37110493, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-37110493} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-37110493, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-37110493, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-37110493, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-37110493|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-37110493} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 14:22:08,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_162 |v_P1Thread1of1ForFork1_#t~ite14_42|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_162, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_41|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 14:22:08,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 14:22:08,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L815-2-->L815-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In779711988 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite25_Out779711988| |ULTIMATE.start_main_#t~ite24_Out779711988|)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In779711988 256) 0))) (or (and (= ~x~0_In779711988 |ULTIMATE.start_main_#t~ite24_Out779711988|) .cse0 (or .cse1 .cse2)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite24_Out779711988| ~x$w_buff1~0_In779711988) .cse0 (not .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In779711988, ~x$w_buff1_used~0=~x$w_buff1_used~0_In779711988, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In779711988, ~x~0=~x~0_In779711988} OutVars{~x$w_buff1~0=~x$w_buff1~0_In779711988, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out779711988|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out779711988|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In779711988, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In779711988, ~x~0=~x~0_In779711988} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 14:22:08,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-->L816-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-1659955415 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1659955415 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite26_Out-1659955415| 0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-1659955415 |ULTIMATE.start_main_#t~ite26_Out-1659955415|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1659955415, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1659955415} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1659955415, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1659955415|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1659955415} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 14:22:08,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L817-->L817-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-325910253 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-325910253 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-325910253 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-325910253 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-325910253 |ULTIMATE.start_main_#t~ite27_Out-325910253|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite27_Out-325910253|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-325910253, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-325910253, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-325910253, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-325910253} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-325910253, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-325910253, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-325910253|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-325910253, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-325910253} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 14:22:08,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-463302385 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-463302385 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In-463302385 |ULTIMATE.start_main_#t~ite28_Out-463302385|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite28_Out-463302385|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-463302385, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-463302385} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-463302385, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-463302385|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-463302385} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 14:22:08,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In938505167 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In938505167 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In938505167 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In938505167 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In938505167 |ULTIMATE.start_main_#t~ite29_Out938505167|)) (and (= 0 |ULTIMATE.start_main_#t~ite29_Out938505167|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In938505167, ~x$w_buff1_used~0=~x$w_buff1_used~0_In938505167, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In938505167, ~x$w_buff0_used~0=~x$w_buff0_used~0_In938505167} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In938505167, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out938505167|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In938505167, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In938505167, ~x$w_buff0_used~0=~x$w_buff0_used~0_In938505167} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 14:22:08,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L831-->L832: Formula: (and (= v_~x$r_buff0_thd0~0_112 v_~x$r_buff0_thd0~0_111) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_112, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_111, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 14:22:08,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L834-->L837-1: Formula: (and (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= (mod v_~x$flush_delayed~0_23 256) 0)) (= v_~x$mem_tmp~0_13 v_~x~0_153) (= v_~x$flush_delayed~0_22 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_13} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ~x$flush_delayed~0=v_~x$flush_delayed~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~x~0=v_~x~0_153, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:22:08,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 14:22:08,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:22:08 BasicIcfg [2019-12-18 14:22:08,268 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:22:08,270 INFO L168 Benchmark]: Toolchain (without parser) took 90180.55 ms. Allocated memory was 141.6 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 104.5 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 807.3 MB. Max. memory is 7.1 GB. [2019-12-18 14:22:08,271 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 141.6 MB. Free memory is still 124.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 14:22:08,271 INFO L168 Benchmark]: CACSL2BoogieTranslator took 752.82 ms. Allocated memory was 141.6 MB in the beginning and 203.9 MB in the end (delta: 62.4 MB). Free memory was 104.1 MB in the beginning and 157.1 MB in the end (delta: -53.0 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:22:08,272 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.81 ms. Allocated memory is still 203.9 MB. Free memory was 157.1 MB in the beginning and 154.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:22:08,272 INFO L168 Benchmark]: Boogie Preprocessor took 40.49 ms. Allocated memory is still 203.9 MB. Free memory was 154.5 MB in the beginning and 151.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:22:08,273 INFO L168 Benchmark]: RCFGBuilder took 893.77 ms. Allocated memory is still 203.9 MB. Free memory was 151.8 MB in the beginning and 101.8 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:22:08,274 INFO L168 Benchmark]: TraceAbstraction took 88419.23 ms. Allocated memory was 203.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 101.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 742.2 MB. Max. memory is 7.1 GB. [2019-12-18 14:22:08,277 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.41 ms. Allocated memory is still 141.6 MB. Free memory is still 124.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 752.82 ms. Allocated memory was 141.6 MB in the beginning and 203.9 MB in the end (delta: 62.4 MB). Free memory was 104.1 MB in the beginning and 157.1 MB in the end (delta: -53.0 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.81 ms. Allocated memory is still 203.9 MB. Free memory was 157.1 MB in the beginning and 154.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.49 ms. Allocated memory is still 203.9 MB. Free memory was 154.5 MB in the beginning and 151.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 893.77 ms. Allocated memory is still 203.9 MB. Free memory was 151.8 MB in the beginning and 101.8 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 88419.23 ms. Allocated memory was 203.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 101.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 742.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 174 ProgramPointsBefore, 94 ProgramPointsAfterwards, 211 TransitionsBefore, 106 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 29 ChoiceCompositions, 6159 VarBasedMoverChecksPositive, 253 VarBasedMoverChecksNegative, 78 SemBasedMoverChecksPositive, 250 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 78277 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t1804, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L807] FCALL, FORK 0 pthread_create(&t1805, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L809] FCALL, FORK 0 pthread_create(&t1806, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0: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=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L756] 2 x$r_buff0_thd2 = (_Bool)1 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0: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=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0: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=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L727] 1 __unbuffered_p0_EAX = y [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 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_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L733] 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) [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L784] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L785] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L762] EXPR 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 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 [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L763] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L764] 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 [L815] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L815] 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) [L816] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L817] 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 [L818] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L819] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 x$flush_delayed = weak$$choice2 [L825] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L827] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L828] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L828] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L829] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L830] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L832] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 88.1s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 20.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2498 SDtfs, 2315 SDslu, 5145 SDs, 0 SdLazy, 2730 SolverSat, 140 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 29 SyntacticMatches, 16 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183279occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 42.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 75949 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 924 NumberOfCodeBlocks, 924 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 838 ConstructedInterpolants, 0 QuantifiedInterpolants, 214747 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...