/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/mix037_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:24:07,821 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:24:07,823 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:24:07,834 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:24:07,834 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:24:07,835 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:24:07,837 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:24:07,838 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:24:07,840 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:24:07,841 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:24:07,842 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:24:07,843 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:24:07,843 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:24:07,844 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:24:07,845 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:24:07,846 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:24:07,847 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:24:07,848 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:24:07,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:24:07,852 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:24:07,854 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:24:07,855 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:24:07,856 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:24:07,856 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:24:07,859 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:24:07,860 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:24:07,860 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:24:07,861 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:24:07,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:24:07,862 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:24:07,863 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:24:07,863 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:24:07,864 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:24:07,865 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:24:07,866 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:24:07,866 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:24:07,867 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:24:07,867 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:24:07,867 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:24:07,868 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:24:07,869 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:24:07,870 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 13:24:07,884 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:24:07,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:24:07,886 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:24:07,886 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:24:07,886 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:24:07,886 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:24:07,887 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:24:07,887 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:24:07,887 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:24:07,887 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:24:07,887 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:24:07,887 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:24:07,888 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:24:07,888 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:24:07,888 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:24:07,888 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:24:07,888 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:24:07,889 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:24:07,889 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:24:07,889 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:24:07,889 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:24:07,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:24:07,890 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:24:07,890 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:24:07,890 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:24:07,890 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:24:07,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:24:07,891 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:24:07,891 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:24:07,891 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:24:08,173 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:24:08,190 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:24:08,193 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:24:08,195 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:24:08,195 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:24:08,196 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.opt.i [2019-12-18 13:24:08,268 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59b5aeeba/a801d0a5c0ac464590abf4f58cd1a689/FLAGf8c95cce2 [2019-12-18 13:24:08,836 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:24:08,839 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_tso.opt.i [2019-12-18 13:24:08,863 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59b5aeeba/a801d0a5c0ac464590abf4f58cd1a689/FLAGf8c95cce2 [2019-12-18 13:24:09,127 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59b5aeeba/a801d0a5c0ac464590abf4f58cd1a689 [2019-12-18 13:24:09,135 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:24:09,137 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:24:09,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:24:09,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:24:09,144 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:24:09,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:24:09" (1/1) ... [2019-12-18 13:24:09,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@317ba546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:09, skipping insertion in model container [2019-12-18 13:24:09,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:24:09" (1/1) ... [2019-12-18 13:24:09,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:24:09,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:24:09,717 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:24:09,731 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:24:09,815 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:24:09,889 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:24:09,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:09 WrapperNode [2019-12-18 13:24:09,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:24:09,891 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:24:09,891 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:24:09,891 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:24:09,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:09" (1/1) ... [2019-12-18 13:24:09,922 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:09" (1/1) ... [2019-12-18 13:24:09,953 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:24:09,954 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:24:09,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:24:09,954 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:24:09,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:09" (1/1) ... [2019-12-18 13:24:09,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:09" (1/1) ... [2019-12-18 13:24:09,969 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:09" (1/1) ... [2019-12-18 13:24:09,969 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:09" (1/1) ... [2019-12-18 13:24:09,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:09" (1/1) ... [2019-12-18 13:24:09,984 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:09" (1/1) ... [2019-12-18 13:24:09,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:09" (1/1) ... [2019-12-18 13:24:09,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:24:09,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:24:09,993 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:24:09,993 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:24:09,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:09" (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 13:24:10,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:24:10,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:24:10,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:24:10,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:24:10,066 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:24:10,067 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:24:10,067 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:24:10,067 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:24:10,067 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:24:10,067 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:24:10,068 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 13:24:10,068 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 13:24:10,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:24:10,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:24:10,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:24:10,070 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 13:24:10,811 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:24:10,811 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:24:10,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:24:10 BoogieIcfgContainer [2019-12-18 13:24:10,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:24:10,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:24:10,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:24:10,817 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:24:10,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:24:09" (1/3) ... [2019-12-18 13:24:10,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46fe4790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:24:10, skipping insertion in model container [2019-12-18 13:24:10,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:09" (2/3) ... [2019-12-18 13:24:10,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46fe4790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:24:10, skipping insertion in model container [2019-12-18 13:24:10,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:24:10" (3/3) ... [2019-12-18 13:24:10,821 INFO L109 eAbstractionObserver]: Analyzing ICFG mix037_tso.opt.i [2019-12-18 13:24:10,832 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:24:10,832 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:24:10,839 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:24:10,840 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:24:10,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,882 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,883 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,884 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,884 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,887 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,887 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,911 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,912 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,912 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,912 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,912 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,912 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,913 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,913 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,913 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,914 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,914 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,914 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,914 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,915 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,915 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,915 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,916 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,916 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,916 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,916 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,916 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,932 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,933 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,933 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,933 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,933 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,934 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,934 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,934 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,934 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,934 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,935 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,935 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,936 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,941 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,942 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,946 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,948 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,954 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,955 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,955 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,955 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,955 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,956 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,956 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,957 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,958 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,958 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,958 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,958 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,961 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,962 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:10,977 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 13:24:10,998 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:24:10,999 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:24:10,999 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:24:11,000 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:24:11,000 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:24:11,000 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:24:11,000 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:24:11,000 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:24:11,024 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-18 13:24:11,026 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-18 13:24:11,142 INFO L126 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-18 13:24:11,142 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:24:11,164 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 12/163 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-18 13:24:11,188 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-18 13:24:11,263 INFO L126 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-18 13:24:11,263 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:24:11,273 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 12/163 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-18 13:24:11,291 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-18 13:24:11,293 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:24:16,301 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 13:24:16,429 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 13:24:16,918 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-18 13:24:17,053 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-18 13:24:17,071 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44168 [2019-12-18 13:24:17,071 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-18 13:24:17,075 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 78 transitions [2019-12-18 13:24:18,247 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 21398 states. [2019-12-18 13:24:18,248 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states. [2019-12-18 13:24:18,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 13:24:18,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:18,257 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:24:18,257 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:24:18,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:18,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1244651740, now seen corresponding path program 1 times [2019-12-18 13:24:18,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:18,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187373132] [2019-12-18 13:24:18,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:18,541 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 13:24:18,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187373132] [2019-12-18 13:24:18,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:18,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:24:18,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541629721] [2019-12-18 13:24:18,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:24:18,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:18,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:24:18,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:24:18,570 INFO L87 Difference]: Start difference. First operand 21398 states. Second operand 3 states. [2019-12-18 13:24:19,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:24:19,070 INFO L93 Difference]: Finished difference Result 20958 states and 90416 transitions. [2019-12-18 13:24:19,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:24:19,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 13:24:19,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:24:19,284 INFO L225 Difference]: With dead ends: 20958 [2019-12-18 13:24:19,284 INFO L226 Difference]: Without dead ends: 19662 [2019-12-18 13:24:19,286 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 13:24:20,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2019-12-18 13:24:20,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 19662. [2019-12-18 13:24:20,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19662 states. [2019-12-18 13:24:21,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19662 states to 19662 states and 84692 transitions. [2019-12-18 13:24:21,070 INFO L78 Accepts]: Start accepts. Automaton has 19662 states and 84692 transitions. Word has length 9 [2019-12-18 13:24:21,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:24:21,071 INFO L462 AbstractCegarLoop]: Abstraction has 19662 states and 84692 transitions. [2019-12-18 13:24:21,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:24:21,071 INFO L276 IsEmpty]: Start isEmpty. Operand 19662 states and 84692 transitions. [2019-12-18 13:24:21,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:24:21,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:21,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:24:21,084 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:24:21,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:21,084 INFO L82 PathProgramCache]: Analyzing trace with hash -6792795, now seen corresponding path program 1 times [2019-12-18 13:24:21,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:21,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810546031] [2019-12-18 13:24:21,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:21,239 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 13:24:21,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810546031] [2019-12-18 13:24:21,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:21,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:24:21,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662617131] [2019-12-18 13:24:21,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:24:21,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:21,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:24:21,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:24:21,242 INFO L87 Difference]: Start difference. First operand 19662 states and 84692 transitions. Second operand 4 states. [2019-12-18 13:24:21,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:24:21,694 INFO L93 Difference]: Finished difference Result 30494 states and 126452 transitions. [2019-12-18 13:24:21,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:24:21,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 13:24:21,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:24:21,856 INFO L225 Difference]: With dead ends: 30494 [2019-12-18 13:24:21,856 INFO L226 Difference]: Without dead ends: 30438 [2019-12-18 13:24:21,857 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 13:24:23,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30438 states. [2019-12-18 13:24:24,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30438 to 27742. [2019-12-18 13:24:24,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-12-18 13:24:24,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 116300 transitions. [2019-12-18 13:24:24,211 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 116300 transitions. Word has length 15 [2019-12-18 13:24:24,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:24:24,211 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 116300 transitions. [2019-12-18 13:24:24,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:24:24,212 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 116300 transitions. [2019-12-18 13:24:24,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 13:24:24,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:24,223 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:24:24,224 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:24:24,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:24,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1479332799, now seen corresponding path program 1 times [2019-12-18 13:24:24,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:24,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472875413] [2019-12-18 13:24:24,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:24,340 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 13:24:24,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472875413] [2019-12-18 13:24:24,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:24,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:24:24,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609494566] [2019-12-18 13:24:24,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:24:24,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:24,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:24:24,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:24:24,348 INFO L87 Difference]: Start difference. First operand 27742 states and 116300 transitions. Second operand 4 states. [2019-12-18 13:24:24,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:24:24,697 INFO L93 Difference]: Finished difference Result 35230 states and 146308 transitions. [2019-12-18 13:24:24,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:24:24,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 13:24:24,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:24:24,859 INFO L225 Difference]: With dead ends: 35230 [2019-12-18 13:24:24,859 INFO L226 Difference]: Without dead ends: 35182 [2019-12-18 13:24:24,859 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 13:24:26,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35182 states. [2019-12-18 13:24:27,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35182 to 30378. [2019-12-18 13:24:27,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30378 states. [2019-12-18 13:24:27,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30378 states to 30378 states and 127172 transitions. [2019-12-18 13:24:27,622 INFO L78 Accepts]: Start accepts. Automaton has 30378 states and 127172 transitions. Word has length 18 [2019-12-18 13:24:27,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:24:27,622 INFO L462 AbstractCegarLoop]: Abstraction has 30378 states and 127172 transitions. [2019-12-18 13:24:27,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:24:27,622 INFO L276 IsEmpty]: Start isEmpty. Operand 30378 states and 127172 transitions. [2019-12-18 13:24:27,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 13:24:27,632 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:27,632 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:24:27,632 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:24:27,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:27,633 INFO L82 PathProgramCache]: Analyzing trace with hash -45820751, now seen corresponding path program 1 times [2019-12-18 13:24:27,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:27,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581051916] [2019-12-18 13:24:27,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:27,745 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 13:24:27,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581051916] [2019-12-18 13:24:27,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:27,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:24:27,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760504768] [2019-12-18 13:24:27,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:24:27,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:27,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:24:27,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:24:27,747 INFO L87 Difference]: Start difference. First operand 30378 states and 127172 transitions. Second operand 3 states. [2019-12-18 13:24:27,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:24:27,911 INFO L93 Difference]: Finished difference Result 29747 states and 123892 transitions. [2019-12-18 13:24:27,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:24:27,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-18 13:24:27,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:24:28,015 INFO L225 Difference]: With dead ends: 29747 [2019-12-18 13:24:28,015 INFO L226 Difference]: Without dead ends: 29747 [2019-12-18 13:24:28,016 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 13:24:28,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29747 states. [2019-12-18 13:24:29,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29747 to 29747. [2019-12-18 13:24:29,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29747 states. [2019-12-18 13:24:29,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29747 states to 29747 states and 123892 transitions. [2019-12-18 13:24:29,169 INFO L78 Accepts]: Start accepts. Automaton has 29747 states and 123892 transitions. Word has length 20 [2019-12-18 13:24:29,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:24:29,169 INFO L462 AbstractCegarLoop]: Abstraction has 29747 states and 123892 transitions. [2019-12-18 13:24:29,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:24:29,169 INFO L276 IsEmpty]: Start isEmpty. Operand 29747 states and 123892 transitions. [2019-12-18 13:24:29,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 13:24:29,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:29,184 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:24:29,184 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:24:29,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:29,184 INFO L82 PathProgramCache]: Analyzing trace with hash -129088173, now seen corresponding path program 1 times [2019-12-18 13:24:29,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:29,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854542784] [2019-12-18 13:24:29,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:29,258 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 13:24:29,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854542784] [2019-12-18 13:24:29,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:29,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:24:29,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472936932] [2019-12-18 13:24:29,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:24:29,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:29,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:24:29,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:24:29,260 INFO L87 Difference]: Start difference. First operand 29747 states and 123892 transitions. Second operand 3 states. [2019-12-18 13:24:29,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:24:29,450 INFO L93 Difference]: Finished difference Result 36709 states and 144810 transitions. [2019-12-18 13:24:29,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:24:29,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-18 13:24:29,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:24:29,522 INFO L225 Difference]: With dead ends: 36709 [2019-12-18 13:24:29,522 INFO L226 Difference]: Without dead ends: 30167 [2019-12-18 13:24:29,522 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 13:24:29,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30167 states. [2019-12-18 13:24:31,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30167 to 29499. [2019-12-18 13:24:31,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29499 states. [2019-12-18 13:24:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29499 states to 29499 states and 115623 transitions. [2019-12-18 13:24:31,759 INFO L78 Accepts]: Start accepts. Automaton has 29499 states and 115623 transitions. Word has length 21 [2019-12-18 13:24:31,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:24:31,760 INFO L462 AbstractCegarLoop]: Abstraction has 29499 states and 115623 transitions. [2019-12-18 13:24:31,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:24:31,760 INFO L276 IsEmpty]: Start isEmpty. Operand 29499 states and 115623 transitions. [2019-12-18 13:24:31,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 13:24:31,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:31,771 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:24:31,771 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:24:31,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:31,771 INFO L82 PathProgramCache]: Analyzing trace with hash 484267595, now seen corresponding path program 1 times [2019-12-18 13:24:31,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:31,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457696452] [2019-12-18 13:24:31,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:31,821 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 13:24:31,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457696452] [2019-12-18 13:24:31,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:31,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:24:31,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406437196] [2019-12-18 13:24:31,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:24:31,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:31,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:24:31,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:24:31,824 INFO L87 Difference]: Start difference. First operand 29499 states and 115623 transitions. Second operand 3 states. [2019-12-18 13:24:32,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:24:32,003 INFO L93 Difference]: Finished difference Result 29289 states and 114842 transitions. [2019-12-18 13:24:32,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:24:32,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-18 13:24:32,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:24:32,405 INFO L225 Difference]: With dead ends: 29289 [2019-12-18 13:24:32,405 INFO L226 Difference]: Without dead ends: 29289 [2019-12-18 13:24:32,406 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 13:24:32,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29289 states. [2019-12-18 13:24:32,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29289 to 29205. [2019-12-18 13:24:32,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29205 states. [2019-12-18 13:24:32,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29205 states to 29205 states and 114644 transitions. [2019-12-18 13:24:32,944 INFO L78 Accepts]: Start accepts. Automaton has 29205 states and 114644 transitions. Word has length 21 [2019-12-18 13:24:32,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:24:32,944 INFO L462 AbstractCegarLoop]: Abstraction has 29205 states and 114644 transitions. [2019-12-18 13:24:32,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:24:32,944 INFO L276 IsEmpty]: Start isEmpty. Operand 29205 states and 114644 transitions. [2019-12-18 13:24:32,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:24:32,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:32,955 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:24:32,956 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:24:32,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:32,956 INFO L82 PathProgramCache]: Analyzing trace with hash 291958640, now seen corresponding path program 1 times [2019-12-18 13:24:32,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:32,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633982755] [2019-12-18 13:24:32,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:33,059 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 13:24:33,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633982755] [2019-12-18 13:24:33,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:33,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:24:33,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626940066] [2019-12-18 13:24:33,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:24:33,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:33,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:24:33,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:24:33,061 INFO L87 Difference]: Start difference. First operand 29205 states and 114644 transitions. Second operand 5 states. [2019-12-18 13:24:33,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:24:33,599 INFO L93 Difference]: Finished difference Result 12827 states and 41537 transitions. [2019-12-18 13:24:33,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:24:33,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 13:24:33,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:24:33,625 INFO L225 Difference]: With dead ends: 12827 [2019-12-18 13:24:33,626 INFO L226 Difference]: Without dead ends: 10855 [2019-12-18 13:24:33,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:24:33,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10855 states. [2019-12-18 13:24:33,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10855 to 10855. [2019-12-18 13:24:33,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10855 states. [2019-12-18 13:24:33,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10855 states to 10855 states and 34345 transitions. [2019-12-18 13:24:33,839 INFO L78 Accepts]: Start accepts. Automaton has 10855 states and 34345 transitions. Word has length 22 [2019-12-18 13:24:33,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:24:33,839 INFO L462 AbstractCegarLoop]: Abstraction has 10855 states and 34345 transitions. [2019-12-18 13:24:33,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:24:33,839 INFO L276 IsEmpty]: Start isEmpty. Operand 10855 states and 34345 transitions. [2019-12-18 13:24:33,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 13:24:33,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:33,843 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:24:33,843 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:24:33,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:33,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1876344722, now seen corresponding path program 1 times [2019-12-18 13:24:33,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:33,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724305111] [2019-12-18 13:24:33,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:33,888 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 13:24:33,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724305111] [2019-12-18 13:24:33,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:33,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:24:33,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078931749] [2019-12-18 13:24:33,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:24:33,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:33,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:24:33,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:24:33,890 INFO L87 Difference]: Start difference. First operand 10855 states and 34345 transitions. Second operand 4 states. [2019-12-18 13:24:33,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:24:33,992 INFO L93 Difference]: Finished difference Result 16412 states and 52778 transitions. [2019-12-18 13:24:33,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:24:33,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-18 13:24:33,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:24:34,014 INFO L225 Difference]: With dead ends: 16412 [2019-12-18 13:24:34,014 INFO L226 Difference]: Without dead ends: 8743 [2019-12-18 13:24:34,015 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 13:24:34,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8743 states. [2019-12-18 13:24:34,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8743 to 8444. [2019-12-18 13:24:34,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8444 states. [2019-12-18 13:24:34,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8444 states to 8444 states and 26914 transitions. [2019-12-18 13:24:34,204 INFO L78 Accepts]: Start accepts. Automaton has 8444 states and 26914 transitions. Word has length 23 [2019-12-18 13:24:34,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:24:34,204 INFO L462 AbstractCegarLoop]: Abstraction has 8444 states and 26914 transitions. [2019-12-18 13:24:34,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:24:34,204 INFO L276 IsEmpty]: Start isEmpty. Operand 8444 states and 26914 transitions. [2019-12-18 13:24:34,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 13:24:34,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:34,209 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:24:34,209 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:24:34,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:34,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1799428640, now seen corresponding path program 2 times [2019-12-18 13:24:34,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:34,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975072396] [2019-12-18 13:24:34,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:34,293 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 13:24:34,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975072396] [2019-12-18 13:24:34,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:34,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:24:34,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590800463] [2019-12-18 13:24:34,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:24:34,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:34,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:24:34,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:24:34,295 INFO L87 Difference]: Start difference. First operand 8444 states and 26914 transitions. Second operand 6 states. [2019-12-18 13:24:34,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:24:34,402 INFO L93 Difference]: Finished difference Result 3436 states and 9854 transitions. [2019-12-18 13:24:34,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:24:34,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-12-18 13:24:34,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:24:34,407 INFO L225 Difference]: With dead ends: 3436 [2019-12-18 13:24:34,407 INFO L226 Difference]: Without dead ends: 2817 [2019-12-18 13:24:34,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:24:34,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2019-12-18 13:24:34,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2797. [2019-12-18 13:24:34,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2797 states. [2019-12-18 13:24:34,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 7967 transitions. [2019-12-18 13:24:34,453 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 7967 transitions. Word has length 23 [2019-12-18 13:24:34,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:24:34,453 INFO L462 AbstractCegarLoop]: Abstraction has 2797 states and 7967 transitions. [2019-12-18 13:24:34,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:24:34,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 7967 transitions. [2019-12-18 13:24:34,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 13:24:34,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:34,458 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:24:34,458 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:24:34,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:34,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1619810495, now seen corresponding path program 1 times [2019-12-18 13:24:34,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:34,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595007072] [2019-12-18 13:24:34,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:34,498 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 13:24:34,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595007072] [2019-12-18 13:24:34,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:34,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:24:34,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631369736] [2019-12-18 13:24:34,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:24:34,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:34,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:24:34,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:24:34,500 INFO L87 Difference]: Start difference. First operand 2797 states and 7967 transitions. Second operand 3 states. [2019-12-18 13:24:34,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:24:34,568 INFO L93 Difference]: Finished difference Result 4322 states and 12247 transitions. [2019-12-18 13:24:34,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:24:34,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-18 13:24:34,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:24:34,576 INFO L225 Difference]: With dead ends: 4322 [2019-12-18 13:24:34,576 INFO L226 Difference]: Without dead ends: 4322 [2019-12-18 13:24:34,577 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 13:24:34,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4322 states. [2019-12-18 13:24:34,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4322 to 3273. [2019-12-18 13:24:34,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3273 states. [2019-12-18 13:24:34,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3273 states to 3273 states and 9436 transitions. [2019-12-18 13:24:34,631 INFO L78 Accepts]: Start accepts. Automaton has 3273 states and 9436 transitions. Word has length 32 [2019-12-18 13:24:34,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:24:34,632 INFO L462 AbstractCegarLoop]: Abstraction has 3273 states and 9436 transitions. [2019-12-18 13:24:34,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:24:34,632 INFO L276 IsEmpty]: Start isEmpty. Operand 3273 states and 9436 transitions. [2019-12-18 13:24:34,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 13:24:34,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:34,636 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:24:34,636 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:24:34,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:34,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1082300219, now seen corresponding path program 1 times [2019-12-18 13:24:34,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:34,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045419488] [2019-12-18 13:24:34,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:34,762 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 13:24:34,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045419488] [2019-12-18 13:24:34,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:34,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:24:34,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839504230] [2019-12-18 13:24:34,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:24:34,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:34,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:24:34,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:24:34,766 INFO L87 Difference]: Start difference. First operand 3273 states and 9436 transitions. Second operand 6 states. [2019-12-18 13:24:35,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:24:35,283 INFO L93 Difference]: Finished difference Result 6672 states and 18337 transitions. [2019-12-18 13:24:35,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:24:35,283 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-18 13:24:35,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:24:35,292 INFO L225 Difference]: With dead ends: 6672 [2019-12-18 13:24:35,292 INFO L226 Difference]: Without dead ends: 6534 [2019-12-18 13:24:35,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:24:35,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6534 states. [2019-12-18 13:24:35,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6534 to 3403. [2019-12-18 13:24:35,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3403 states. [2019-12-18 13:24:35,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 3403 states and 9764 transitions. [2019-12-18 13:24:35,506 INFO L78 Accepts]: Start accepts. Automaton has 3403 states and 9764 transitions. Word has length 32 [2019-12-18 13:24:35,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:24:35,506 INFO L462 AbstractCegarLoop]: Abstraction has 3403 states and 9764 transitions. [2019-12-18 13:24:35,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:24:35,507 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 9764 transitions. [2019-12-18 13:24:35,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 13:24:35,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:35,511 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:24:35,511 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:24:35,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:35,511 INFO L82 PathProgramCache]: Analyzing trace with hash 668169174, now seen corresponding path program 1 times [2019-12-18 13:24:35,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:35,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468720299] [2019-12-18 13:24:35,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:35,599 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 13:24:35,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468720299] [2019-12-18 13:24:35,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:35,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:24:35,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504373235] [2019-12-18 13:24:35,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:24:35,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:35,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:24:35,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:24:35,603 INFO L87 Difference]: Start difference. First operand 3403 states and 9764 transitions. Second operand 5 states. [2019-12-18 13:24:35,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:24:35,960 INFO L93 Difference]: Finished difference Result 5197 states and 14640 transitions. [2019-12-18 13:24:35,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:24:35,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-18 13:24:35,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:24:35,968 INFO L225 Difference]: With dead ends: 5197 [2019-12-18 13:24:35,968 INFO L226 Difference]: Without dead ends: 5197 [2019-12-18 13:24:35,969 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 13:24:35,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5197 states. [2019-12-18 13:24:36,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5197 to 4563. [2019-12-18 13:24:36,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4563 states. [2019-12-18 13:24:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4563 states to 4563 states and 13058 transitions. [2019-12-18 13:24:36,026 INFO L78 Accepts]: Start accepts. Automaton has 4563 states and 13058 transitions. Word has length 32 [2019-12-18 13:24:36,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:24:36,026 INFO L462 AbstractCegarLoop]: Abstraction has 4563 states and 13058 transitions. [2019-12-18 13:24:36,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:24:36,026 INFO L276 IsEmpty]: Start isEmpty. Operand 4563 states and 13058 transitions. [2019-12-18 13:24:36,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:24:36,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:36,032 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:24:36,032 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:24:36,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:36,032 INFO L82 PathProgramCache]: Analyzing trace with hash -345264620, now seen corresponding path program 1 times [2019-12-18 13:24:36,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:36,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096247223] [2019-12-18 13:24:36,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:36,123 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 13:24:36,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096247223] [2019-12-18 13:24:36,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:36,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:24:36,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727408179] [2019-12-18 13:24:36,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:24:36,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:36,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:24:36,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:24:36,126 INFO L87 Difference]: Start difference. First operand 4563 states and 13058 transitions. Second operand 6 states. [2019-12-18 13:24:36,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:24:36,552 INFO L93 Difference]: Finished difference Result 8693 states and 23894 transitions. [2019-12-18 13:24:36,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:24:36,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 13:24:36,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:24:36,564 INFO L225 Difference]: With dead ends: 8693 [2019-12-18 13:24:36,564 INFO L226 Difference]: Without dead ends: 8549 [2019-12-18 13:24:36,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:24:36,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8549 states. [2019-12-18 13:24:36,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8549 to 4625. [2019-12-18 13:24:36,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4625 states. [2019-12-18 13:24:36,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4625 states to 4625 states and 13321 transitions. [2019-12-18 13:24:36,641 INFO L78 Accepts]: Start accepts. Automaton has 4625 states and 13321 transitions. Word has length 33 [2019-12-18 13:24:36,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:24:36,641 INFO L462 AbstractCegarLoop]: Abstraction has 4625 states and 13321 transitions. [2019-12-18 13:24:36,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:24:36,641 INFO L276 IsEmpty]: Start isEmpty. Operand 4625 states and 13321 transitions. [2019-12-18 13:24:36,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:24:36,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:36,647 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:24:36,647 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:24:36,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:36,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1231616427, now seen corresponding path program 1 times [2019-12-18 13:24:36,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:36,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041824958] [2019-12-18 13:24:36,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:36,744 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 13:24:36,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041824958] [2019-12-18 13:24:36,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:36,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:24:36,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836874050] [2019-12-18 13:24:36,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:24:36,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:36,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:24:36,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:24:36,746 INFO L87 Difference]: Start difference. First operand 4625 states and 13321 transitions. Second operand 7 states. [2019-12-18 13:24:36,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:24:36,881 INFO L93 Difference]: Finished difference Result 3800 states and 11197 transitions. [2019-12-18 13:24:36,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:24:36,881 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 13:24:36,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:24:36,888 INFO L225 Difference]: With dead ends: 3800 [2019-12-18 13:24:36,889 INFO L226 Difference]: Without dead ends: 2791 [2019-12-18 13:24:36,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:24:36,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2791 states. [2019-12-18 13:24:36,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2791 to 2401. [2019-12-18 13:24:36,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2401 states. [2019-12-18 13:24:36,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 6865 transitions. [2019-12-18 13:24:36,943 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 6865 transitions. Word has length 33 [2019-12-18 13:24:36,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:24:36,943 INFO L462 AbstractCegarLoop]: Abstraction has 2401 states and 6865 transitions. [2019-12-18 13:24:36,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:24:36,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 6865 transitions. [2019-12-18 13:24:36,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 13:24:36,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:36,949 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] [2019-12-18 13:24:36,949 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:24:36,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:36,949 INFO L82 PathProgramCache]: Analyzing trace with hash 537782324, now seen corresponding path program 1 times [2019-12-18 13:24:36,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:36,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846105942] [2019-12-18 13:24:36,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:37,028 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 13:24:37,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846105942] [2019-12-18 13:24:37,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:37,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:24:37,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042138882] [2019-12-18 13:24:37,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:24:37,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:37,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:24:37,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:24:37,031 INFO L87 Difference]: Start difference. First operand 2401 states and 6865 transitions. Second operand 6 states. [2019-12-18 13:24:37,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:24:37,222 INFO L93 Difference]: Finished difference Result 6419 states and 18107 transitions. [2019-12-18 13:24:37,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:24:37,223 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-18 13:24:37,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:24:37,230 INFO L225 Difference]: With dead ends: 6419 [2019-12-18 13:24:37,230 INFO L226 Difference]: Without dead ends: 4118 [2019-12-18 13:24:37,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:24:37,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4118 states. [2019-12-18 13:24:37,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4118 to 2585. [2019-12-18 13:24:37,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2585 states. [2019-12-18 13:24:37,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2585 states and 7335 transitions. [2019-12-18 13:24:37,288 INFO L78 Accepts]: Start accepts. Automaton has 2585 states and 7335 transitions. Word has length 47 [2019-12-18 13:24:37,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:24:37,289 INFO L462 AbstractCegarLoop]: Abstraction has 2585 states and 7335 transitions. [2019-12-18 13:24:37,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:24:37,289 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 7335 transitions. [2019-12-18 13:24:37,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 13:24:37,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:37,294 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] [2019-12-18 13:24:37,295 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:24:37,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:37,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1324143500, now seen corresponding path program 2 times [2019-12-18 13:24:37,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:37,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184186262] [2019-12-18 13:24:37,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:37,372 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 13:24:37,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184186262] [2019-12-18 13:24:37,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:37,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:24:37,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155648495] [2019-12-18 13:24:37,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:24:37,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:37,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:24:37,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:24:37,376 INFO L87 Difference]: Start difference. First operand 2585 states and 7335 transitions. Second operand 4 states. [2019-12-18 13:24:37,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:24:37,400 INFO L93 Difference]: Finished difference Result 3315 states and 8929 transitions. [2019-12-18 13:24:37,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:24:37,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-18 13:24:37,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:24:37,402 INFO L225 Difference]: With dead ends: 3315 [2019-12-18 13:24:37,402 INFO L226 Difference]: Without dead ends: 802 [2019-12-18 13:24:37,402 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 13:24:37,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-12-18 13:24:37,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 802. [2019-12-18 13:24:37,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2019-12-18 13:24:37,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1724 transitions. [2019-12-18 13:24:37,413 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1724 transitions. Word has length 47 [2019-12-18 13:24:37,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:24:37,413 INFO L462 AbstractCegarLoop]: Abstraction has 802 states and 1724 transitions. [2019-12-18 13:24:37,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:24:37,413 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1724 transitions. [2019-12-18 13:24:37,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 13:24:37,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:37,415 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] [2019-12-18 13:24:37,415 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:24:37,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:37,416 INFO L82 PathProgramCache]: Analyzing trace with hash 288167740, now seen corresponding path program 3 times [2019-12-18 13:24:37,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:37,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157185041] [2019-12-18 13:24:37,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:37,663 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 13:24:37,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157185041] [2019-12-18 13:24:37,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:37,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:24:37,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153416621] [2019-12-18 13:24:37,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:24:37,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:37,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:24:37,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:24:37,666 INFO L87 Difference]: Start difference. First operand 802 states and 1724 transitions. Second operand 7 states. [2019-12-18 13:24:37,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:24:37,858 INFO L93 Difference]: Finished difference Result 1252 states and 2651 transitions. [2019-12-18 13:24:37,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:24:37,859 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-18 13:24:37,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:24:37,861 INFO L225 Difference]: With dead ends: 1252 [2019-12-18 13:24:37,861 INFO L226 Difference]: Without dead ends: 820 [2019-12-18 13:24:37,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:24:37,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-12-18 13:24:37,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 778. [2019-12-18 13:24:37,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2019-12-18 13:24:37,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1674 transitions. [2019-12-18 13:24:37,873 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1674 transitions. Word has length 47 [2019-12-18 13:24:37,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:24:37,873 INFO L462 AbstractCegarLoop]: Abstraction has 778 states and 1674 transitions. [2019-12-18 13:24:37,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:24:37,873 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1674 transitions. [2019-12-18 13:24:37,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 13:24:37,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:37,875 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] [2019-12-18 13:24:37,875 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:24:37,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:37,875 INFO L82 PathProgramCache]: Analyzing trace with hash -261128468, now seen corresponding path program 4 times [2019-12-18 13:24:37,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:37,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716235582] [2019-12-18 13:24:37,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:37,957 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 13:24:37,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716235582] [2019-12-18 13:24:37,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:37,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:24:37,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693868823] [2019-12-18 13:24:37,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:24:37,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:37,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:24:37,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:24:37,959 INFO L87 Difference]: Start difference. First operand 778 states and 1674 transitions. Second operand 3 states. [2019-12-18 13:24:37,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:24:37,975 INFO L93 Difference]: Finished difference Result 778 states and 1672 transitions. [2019-12-18 13:24:37,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:24:37,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-18 13:24:37,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:24:37,977 INFO L225 Difference]: With dead ends: 778 [2019-12-18 13:24:37,977 INFO L226 Difference]: Without dead ends: 778 [2019-12-18 13:24:37,978 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 13:24:37,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-12-18 13:24:37,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 704. [2019-12-18 13:24:37,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-12-18 13:24:37,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1526 transitions. [2019-12-18 13:24:37,988 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1526 transitions. Word has length 47 [2019-12-18 13:24:37,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:24:37,988 INFO L462 AbstractCegarLoop]: Abstraction has 704 states and 1526 transitions. [2019-12-18 13:24:37,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:24:37,989 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1526 transitions. [2019-12-18 13:24:37,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 13:24:37,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:37,990 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:24:37,990 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:24:37,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:37,991 INFO L82 PathProgramCache]: Analyzing trace with hash 24927743, now seen corresponding path program 1 times [2019-12-18 13:24:37,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:37,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498050810] [2019-12-18 13:24:37,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:24:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:24:38,115 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:24:38,115 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:24:38,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_107| 0 0))) (and (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t997~0.base_59|) (= v_~x~0_71 0) (= 0 v_~weak$$choice0~0_10) (= v_~z$w_buff0_used~0_514 0) (= 0 v_~z$r_buff1_thd3~0_207) (= v_~main$tmp_guard0~0_30 0) (= v_~main$tmp_guard1~0_44 0) (= |v_#memory_int_27| (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t997~0.base_59| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t997~0.base_59|) |v_ULTIMATE.start_main_~#t997~0.offset_37| 0))) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t997~0.base_59|) 0) (= 0 v_~z$flush_delayed~0_37) (= v_~z$mem_tmp~0_16 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (= v_~y~0_19 0) (= v_~z$w_buff0~0_183 0) (= 0 v_~z$r_buff1_thd1~0_59) (= 0 v_~z$r_buff0_thd4~0_166) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p3_EAX~0_87) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (= v_~z$r_buff0_thd2~0_57 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd0~0_132 0) (= |v_#NULL.offset_5| 0) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t997~0.base_59| 4) |v_#length_31|) (= 0 |v_ULTIMATE.start_main_~#t997~0.offset_37|) (= v_~z~0_116 0) (= 0 v_~__unbuffered_p2_EAX~0_54) (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~z$r_buff0_thd3~0_266) (= 0 v_~__unbuffered_p3_EBX~0_88) (= 0 v_~weak$$choice2~0_95) (= v_~z$w_buff1_used~0_298 0) (= |v_#valid_105| (store .cse0 |v_ULTIMATE.start_main_~#t997~0.base_59| 1)) (= 0 |v_#NULL.base_5|) (= v_~z$w_buff1~0_123 0) (= v_~b~0_79 0) (= v_~__unbuffered_cnt~0_126 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_107|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t997~0.offset=|v_ULTIMATE.start_main_~#t997~0.offset_37|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ULTIMATE.start_main_~#t999~0.base=|v_ULTIMATE.start_main_~#t999~0.base_32|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_87, ULTIMATE.start_main_~#t1000~0.offset=|v_ULTIMATE.start_main_~#t1000~0.offset_22|, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_81|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_298, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_72|, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_59, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_266, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_71, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_110, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_18|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_~#t997~0.base=|v_ULTIMATE.start_main_~#t997~0.base_59|, ~z$w_buff1~0=v_~z$w_buff1~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_132, ULTIMATE.start_main_~#t1000~0.base=|v_ULTIMATE.start_main_~#t1000~0.base_32|, ~y~0=v_~y~0_19, ULTIMATE.start_main_~#t998~0.offset=|v_ULTIMATE.start_main_~#t998~0.offset_35|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_514, ~z$w_buff0~0=v_~z$w_buff0~0_183, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_207, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_45|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_141|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_88, ULTIMATE.start_main_~#t999~0.offset=|v_ULTIMATE.start_main_~#t999~0.offset_23|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_91|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_38|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_116, ~weak$$choice2~0=v_~weak$$choice2~0_95, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58, ULTIMATE.start_main_~#t998~0.base=|v_ULTIMATE.start_main_~#t998~0.base_56|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t997~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t999~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, ULTIMATE.start_main_~#t1000~0.offset, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ULTIMATE.start_main_~#t997~0.base, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1000~0.base, ~y~0, ULTIMATE.start_main_~#t998~0.offset, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t999~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t998~0.base] because there is no mapped edge [2019-12-18 13:24:38,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t998~0.base_11|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t998~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t998~0.base_11|) |v_ULTIMATE.start_main_~#t998~0.offset_10| 1)) |v_#memory_int_19|) (not (= 0 |v_ULTIMATE.start_main_~#t998~0.base_11|)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t998~0.base_11| 4) |v_#length_23|) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t998~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t998~0.offset_10| 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t998~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|, ULTIMATE.start_main_~#t998~0.base=|v_ULTIMATE.start_main_~#t998~0.base_11|, ULTIMATE.start_main_~#t998~0.offset=|v_ULTIMATE.start_main_~#t998~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t998~0.base, ULTIMATE.start_main_~#t998~0.offset] because there is no mapped edge [2019-12-18 13:24:38,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t999~0.base_12|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t999~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t999~0.base_12| 0)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t999~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t999~0.base_12|) |v_ULTIMATE.start_main_~#t999~0.offset_11| 2)) |v_#memory_int_17|) (= |v_ULTIMATE.start_main_~#t999~0.offset_11| 0) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t999~0.base_12| 1) |v_#valid_46|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t999~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t999~0.base=|v_ULTIMATE.start_main_~#t999~0.base_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|, ULTIMATE.start_main_~#t999~0.offset=|v_ULTIMATE.start_main_~#t999~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t999~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t999~0.offset] because there is no mapped edge [2019-12-18 13:24:38,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1000~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1000~0.base_12|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1000~0.base_12| 4)) (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1000~0.base_12|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1000~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1000~0.base_12|) |v_ULTIMATE.start_main_~#t1000~0.offset_10| 3)) |v_#memory_int_15|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1000~0.base_12| 1)) (not (= |v_ULTIMATE.start_main_~#t1000~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1000~0.base=|v_ULTIMATE.start_main_~#t1000~0.base_12|, ULTIMATE.start_main_~#t1000~0.offset=|v_ULTIMATE.start_main_~#t1000~0.offset_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1000~0.base, ULTIMATE.start_main_~#t1000~0.offset, #length] because there is no mapped edge [2019-12-18 13:24:38,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= 1 ~z$r_buff0_thd4~0_Out415883704) (= ~z$r_buff0_thd3~0_In415883704 ~z$r_buff1_thd3~0_Out415883704) (not (= P3Thread1of1ForFork2___VERIFIER_assert_~expression_In415883704 0)) (= ~z$r_buff1_thd2~0_Out415883704 ~z$r_buff0_thd2~0_In415883704) (= ~a~0_Out415883704 1) (= ~z$r_buff1_thd0~0_Out415883704 ~z$r_buff0_thd0~0_In415883704) (= ~z$r_buff1_thd4~0_Out415883704 ~z$r_buff0_thd4~0_In415883704) (= ~__unbuffered_p3_EAX~0_Out415883704 ~a~0_Out415883704) (= ~z$r_buff1_thd1~0_Out415883704 ~z$r_buff0_thd1~0_In415883704) (= ~__unbuffered_p3_EBX~0_Out415883704 ~b~0_In415883704)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In415883704, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In415883704, ~b~0=~b~0_In415883704, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In415883704, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In415883704, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In415883704, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In415883704} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In415883704, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out415883704, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out415883704, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out415883704, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out415883704, ~a~0=~a~0_Out415883704, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In415883704, ~b~0=~b~0_In415883704, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out415883704, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out415883704, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out415883704, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out415883704, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In415883704, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In415883704, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In415883704} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-18 13:24:38,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_~x~0_36 1) (= v_P0Thread1of1ForFork3_~arg.base_22 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_22) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= v_~b~0_48 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|} OutVars{~b~0=v_~b~0_48, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_22, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_22, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_36} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-18 13:24:38,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_7|) (= v_~y~0_15 v_~__unbuffered_p1_EAX~0_14) (= v_P1Thread1of1ForFork0_~arg.base_11 |v_P1Thread1of1ForFork0_#in~arg.base_11|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x~0_23 2) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_11) (= 0 |v_P1Thread1of1ForFork0_#res.offset_7|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~y~0=v_~y~0_15} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_11, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, ~y~0=v_~y~0_15, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-18 13:24:38,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In191630557 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite8_Out191630557| ~z$w_buff0~0_In191630557) (= |P2Thread1of1ForFork1_#t~ite9_Out191630557| |P2Thread1of1ForFork1_#t~ite8_Out191630557|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In191630557 256)))) (or (and (= (mod ~z$w_buff1_used~0_In191630557 256) 0) .cse0) (and .cse0 (= (mod ~z$r_buff1_thd3~0_In191630557 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In191630557 256)))) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite9_Out191630557| ~z$w_buff0~0_In191630557) (= |P2Thread1of1ForFork1_#t~ite8_In191630557| |P2Thread1of1ForFork1_#t~ite8_Out191630557|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In191630557, ~z$w_buff0_used~0=~z$w_buff0_used~0_In191630557, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In191630557, ~z$w_buff1_used~0=~z$w_buff1_used~0_In191630557, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In191630557, ~weak$$choice2~0=~weak$$choice2~0_In191630557, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In191630557|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In191630557, ~z$w_buff0_used~0=~z$w_buff0_used~0_In191630557, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In191630557, ~z$w_buff1_used~0=~z$w_buff1_used~0_In191630557, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In191630557, ~weak$$choice2~0=~weak$$choice2~0_In191630557, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out191630557|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out191630557|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 13:24:38,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-183191643 256) 0))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-183191643 256) 0))) (or (= (mod ~z$w_buff0_used~0_In-183191643 256) 0) (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-183191643 256))) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-183191643 256))))) (= |P2Thread1of1ForFork1_#t~ite11_Out-183191643| |P2Thread1of1ForFork1_#t~ite12_Out-183191643|) (= |P2Thread1of1ForFork1_#t~ite11_Out-183191643| ~z$w_buff1~0_In-183191643) .cse1) (and (= |P2Thread1of1ForFork1_#t~ite11_In-183191643| |P2Thread1of1ForFork1_#t~ite11_Out-183191643|) (= |P2Thread1of1ForFork1_#t~ite12_Out-183191643| ~z$w_buff1~0_In-183191643) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-183191643, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-183191643, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In-183191643|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-183191643, ~z$w_buff1~0=~z$w_buff1~0_In-183191643, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-183191643, ~weak$$choice2~0=~weak$$choice2~0_In-183191643} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-183191643, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-183191643|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-183191643, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-183191643|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-183191643, ~z$w_buff1~0=~z$w_buff1~0_In-183191643, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-183191643, ~weak$$choice2~0=~weak$$choice2~0_In-183191643} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 13:24:38,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-448367647 256)))) (or (and (not .cse0) (= ~z$w_buff0_used~0_In-448367647 |P2Thread1of1ForFork1_#t~ite15_Out-448367647|) (= |P2Thread1of1ForFork1_#t~ite14_In-448367647| |P2Thread1of1ForFork1_#t~ite14_Out-448367647|)) (and (= |P2Thread1of1ForFork1_#t~ite14_Out-448367647| ~z$w_buff0_used~0_In-448367647) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-448367647 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-448367647 256)) .cse1) (= (mod ~z$w_buff0_used~0_In-448367647 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In-448367647 256)) .cse1))) (= |P2Thread1of1ForFork1_#t~ite14_Out-448367647| |P2Thread1of1ForFork1_#t~ite15_Out-448367647|) .cse0))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In-448367647|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-448367647, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-448367647, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-448367647, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-448367647, ~weak$$choice2~0=~weak$$choice2~0_In-448367647} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out-448367647|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out-448367647|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-448367647, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-448367647, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-448367647, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-448367647, ~weak$$choice2~0=~weak$$choice2~0_In-448367647} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-18 13:24:38,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_90 v_~z$r_buff0_thd3~0_89) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_11|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_89, ~weak$$choice2~0=v_~weak$$choice2~0_22, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-18 13:24:38,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-186269440 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-186269440 256)))) (or (= (mod ~z$w_buff0_used~0_In-186269440 256) 0) (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-186269440 256))) (and (= 0 (mod ~z$w_buff1_used~0_In-186269440 256)) .cse0))) (= |P2Thread1of1ForFork1_#t~ite23_Out-186269440| |P2Thread1of1ForFork1_#t~ite24_Out-186269440|) .cse1 (= ~z$r_buff1_thd3~0_In-186269440 |P2Thread1of1ForFork1_#t~ite23_Out-186269440|)) (and (= |P2Thread1of1ForFork1_#t~ite23_In-186269440| |P2Thread1of1ForFork1_#t~ite23_Out-186269440|) (not .cse1) (= ~z$r_buff1_thd3~0_In-186269440 |P2Thread1of1ForFork1_#t~ite24_Out-186269440|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-186269440, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-186269440, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In-186269440|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-186269440, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-186269440, ~weak$$choice2~0=~weak$$choice2~0_In-186269440} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out-186269440|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-186269440, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-186269440, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out-186269440|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-186269440, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-186269440, ~weak$$choice2~0=~weak$$choice2~0_In-186269440} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-18 13:24:38,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_8) (= v_~z~0_22 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 13:24:38,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-934055449 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-934055449 256)))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out-934055449| 0)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-934055449 |P3Thread1of1ForFork2_#t~ite28_Out-934055449|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-934055449, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-934055449} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-934055449|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-934055449, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-934055449} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-18 13:24:38,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In710616409 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In710616409 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In710616409 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In710616409 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite29_Out710616409|)) (and (= ~z$w_buff1_used~0_In710616409 |P3Thread1of1ForFork2_#t~ite29_Out710616409|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In710616409, ~z$w_buff0_used~0=~z$w_buff0_used~0_In710616409, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In710616409, ~z$w_buff1_used~0=~z$w_buff1_used~0_In710616409} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out710616409|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In710616409, ~z$w_buff0_used~0=~z$w_buff0_used~0_In710616409, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In710616409, ~z$w_buff1_used~0=~z$w_buff1_used~0_In710616409} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 13:24:38,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-416479989 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-416479989 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out-416479989 ~z$r_buff0_thd4~0_In-416479989)) (and (not .cse1) (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out-416479989)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-416479989, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-416479989} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-416479989, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-416479989, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out-416479989|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-18 13:24:38,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1097360324 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-1097360324 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1097360324 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd4~0_In-1097360324 256) 0))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite31_Out-1097360324|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd4~0_In-1097360324 |P3Thread1of1ForFork2_#t~ite31_Out-1097360324|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1097360324, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1097360324, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1097360324, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1097360324} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1097360324, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1097360324, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1097360324, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1097360324, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out-1097360324|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 13:24:38,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L824-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= |v_P3Thread1of1ForFork2_#t~ite31_44| v_~z$r_buff1_thd4~0_62)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_44|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_62, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_43|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 13:24:38,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_93 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 13:24:38,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-1150731571 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1150731571 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite37_Out-1150731571| |ULTIMATE.start_main_#t~ite36_Out-1150731571|))) (or (and (= ~z~0_In-1150731571 |ULTIMATE.start_main_#t~ite36_Out-1150731571|) (or .cse0 .cse1) .cse2) (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-1150731571 |ULTIMATE.start_main_#t~ite36_Out-1150731571|) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1150731571, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1150731571, ~z$w_buff1~0=~z$w_buff1~0_In-1150731571, ~z~0=~z~0_In-1150731571} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1150731571, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1150731571, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1150731571|, ~z$w_buff1~0=~z$w_buff1~0_In-1150731571, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1150731571|, ~z~0=~z~0_In-1150731571} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 13:24:38,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In900964093 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In900964093 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In900964093 |ULTIMATE.start_main_#t~ite38_Out900964093|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite38_Out900964093|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In900964093, ~z$w_buff0_used~0=~z$w_buff0_used~0_In900964093} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In900964093, ~z$w_buff0_used~0=~z$w_buff0_used~0_In900964093, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out900964093|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 13:24:38,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In1203388240 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1203388240 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1203388240 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1203388240 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out1203388240| ~z$w_buff1_used~0_In1203388240) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite39_Out1203388240| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1203388240, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1203388240, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1203388240, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1203388240} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1203388240, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1203388240|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1203388240, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1203388240, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1203388240} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 13:24:38,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1045722318 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1045722318 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1045722318 |ULTIMATE.start_main_#t~ite40_Out-1045722318|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-1045722318| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1045722318, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1045722318} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1045722318, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1045722318|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1045722318} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 13:24:38,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1414355062 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1414355062 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1414355062 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1414355062 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out1414355062| ~z$r_buff1_thd0~0_In1414355062) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite41_Out1414355062| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1414355062, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1414355062, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1414355062, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1414355062} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1414355062|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1414355062, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1414355062, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1414355062, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1414355062} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 13:24:38,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= |v_ULTIMATE.start_main_#t~ite41_31| v_~z$r_buff1_thd0~0_73) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_13 0) (= v_~x~0_41 2) (= 0 v_~__unbuffered_p2_EAX~0_17)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~x~0=v_~x~0_41} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_73, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~x~0=v_~x~0_41, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:24:38,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:24:38 BasicIcfg [2019-12-18 13:24:38,232 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:24:38,234 INFO L168 Benchmark]: Toolchain (without parser) took 29097.13 ms. Allocated memory was 144.7 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 99.2 MB in the beginning and 982.6 MB in the end (delta: -883.4 MB). Peak memory consumption was 471.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:24:38,235 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 13:24:38,235 INFO L168 Benchmark]: CACSL2BoogieTranslator took 752.14 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 99.0 MB in the beginning and 156.6 MB in the end (delta: -57.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:24:38,236 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.48 ms. Allocated memory is still 202.9 MB. Free memory was 156.6 MB in the beginning and 153.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:24:38,236 INFO L168 Benchmark]: Boogie Preprocessor took 39.07 ms. Allocated memory is still 202.9 MB. Free memory was 153.9 MB in the beginning and 151.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:24:38,237 INFO L168 Benchmark]: RCFGBuilder took 819.66 ms. Allocated memory is still 202.9 MB. Free memory was 151.2 MB in the beginning and 105.3 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:24:38,237 INFO L168 Benchmark]: TraceAbstraction took 27418.36 ms. Allocated memory was 202.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 104.7 MB in the beginning and 982.6 MB in the end (delta: -877.9 MB). Peak memory consumption was 419.2 MB. Max. memory is 7.1 GB. [2019-12-18 13:24:38,241 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 752.14 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 99.0 MB in the beginning and 156.6 MB in the end (delta: -57.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.48 ms. Allocated memory is still 202.9 MB. Free memory was 156.6 MB in the beginning and 153.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.07 ms. Allocated memory is still 202.9 MB. Free memory was 153.9 MB in the beginning and 151.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 819.66 ms. Allocated memory is still 202.9 MB. Free memory was 151.2 MB in the beginning and 105.3 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27418.36 ms. Allocated memory was 202.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 104.7 MB in the beginning and 982.6 MB in the end (delta: -877.9 MB). Peak memory consumption was 419.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 170 ProgramPointsBefore, 74 ProgramPointsAfterwards, 192 TransitionsBefore, 78 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 23 ChoiceCompositions, 5751 VarBasedMoverChecksPositive, 155 VarBasedMoverChecksNegative, 25 SemBasedMoverChecksPositive, 169 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 44168 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t997, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t998, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t999, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1000, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 1 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L820] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 3 z$flush_delayed = weak$$choice2 [L776] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L783] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L821] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L822] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 158 locations, 2 error locations. Result: UNSAFE, OverallTime: 27.1s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2127 SDtfs, 2662 SDslu, 3617 SDs, 0 SdLazy, 1447 SolverSat, 181 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30378occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 19348 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 570 NumberOfCodeBlocks, 570 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 504 ConstructedInterpolants, 0 QuantifiedInterpolants, 44582 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...