/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:06:41,861 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:06:41,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:06:41,884 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:06:41,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:06:41,887 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:06:41,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:06:41,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:06:41,902 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:06:41,903 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:06:41,904 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:06:41,905 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:06:41,905 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:06:41,906 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:06:41,907 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:06:41,908 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:06:41,909 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:06:41,909 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:06:41,911 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:06:41,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:06:41,914 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:06:41,915 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:06:41,916 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:06:41,917 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:06:41,919 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:06:41,920 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:06:41,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:06:41,922 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:06:41,922 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:06:41,923 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:06:41,924 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:06:41,924 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:06:41,925 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:06:41,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:06:41,927 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:06:41,927 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:06:41,928 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:06:41,928 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:06:41,928 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:06:41,929 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:06:41,930 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:06:41,930 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:06:41,948 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:06:41,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:06:41,950 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:06:41,950 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:06:41,950 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:06:41,950 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:06:41,951 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:06:41,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:06:41,951 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:06:41,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:06:41,951 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:06:41,952 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:06:41,953 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:06:41,953 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:06:41,953 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:06:41,953 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:06:41,953 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:06:41,954 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:06:41,954 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:06:41,954 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:06:41,954 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:06:41,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:06:41,955 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:06:41,956 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:06:41,956 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:06:41,956 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:06:41,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:06:41,956 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:06:41,956 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:06:41,957 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:06:41,957 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:06:41,957 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:06:42,226 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:06:42,239 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:06:42,243 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:06:42,244 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:06:42,245 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:06:42,246 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2019-12-27 21:06:42,313 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ca893977/6cc194c958c6408386b9229d89b7ecad/FLAGb8d8ef189 [2019-12-27 21:06:42,873 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:06:42,874 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2019-12-27 21:06:42,889 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ca893977/6cc194c958c6408386b9229d89b7ecad/FLAGb8d8ef189 [2019-12-27 21:06:43,166 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ca893977/6cc194c958c6408386b9229d89b7ecad [2019-12-27 21:06:43,175 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:06:43,176 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:06:43,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:06:43,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:06:43,181 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:06:43,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:06:43" (1/1) ... [2019-12-27 21:06:43,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e400b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:06:43, skipping insertion in model container [2019-12-27 21:06:43,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:06:43" (1/1) ... [2019-12-27 21:06:43,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:06:43,256 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:06:43,803 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:06:43,815 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:06:43,901 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:06:43,993 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:06:43,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:06:43 WrapperNode [2019-12-27 21:06:43,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:06:43,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:06:43,995 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:06:43,996 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:06:44,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:06:43" (1/1) ... [2019-12-27 21:06:44,034 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:06:43" (1/1) ... [2019-12-27 21:06:44,073 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:06:44,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:06:44,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:06:44,074 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:06:44,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:06:43" (1/1) ... [2019-12-27 21:06:44,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:06:43" (1/1) ... [2019-12-27 21:06:44,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:06:43" (1/1) ... [2019-12-27 21:06:44,089 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:06:43" (1/1) ... [2019-12-27 21:06:44,100 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:06:43" (1/1) ... [2019-12-27 21:06:44,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:06:43" (1/1) ... [2019-12-27 21:06:44,107 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:06:43" (1/1) ... [2019-12-27 21:06:44,113 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:06:44,114 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:06:44,114 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:06:44,114 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:06:44,115 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:06:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:06:44,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:06:44,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:06:44,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:06:44,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:06:44,198 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:06:44,199 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:06:44,199 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:06:44,200 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:06:44,200 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:06:44,200 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:06:44,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:06:44,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:06:44,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:06:44,203 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 21:06:45,006 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:06:45,007 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:06:45,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:06:45 BoogieIcfgContainer [2019-12-27 21:06:45,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:06:45,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:06:45,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:06:45,013 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:06:45,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:06:43" (1/3) ... [2019-12-27 21:06:45,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@602aa700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:06:45, skipping insertion in model container [2019-12-27 21:06:45,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:06:43" (2/3) ... [2019-12-27 21:06:45,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@602aa700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:06:45, skipping insertion in model container [2019-12-27 21:06:45,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:06:45" (3/3) ... [2019-12-27 21:06:45,018 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2019-12-27 21:06:45,026 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:06:45,026 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:06:45,034 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:06:45,035 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:06:45,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,073 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,073 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,082 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,082 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,083 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,083 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,084 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,117 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,117 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,137 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,137 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,147 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,148 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,148 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,152 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,152 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:06:45,169 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 21:06:45,190 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:06:45,190 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:06:45,191 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:06:45,191 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:06:45,191 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:06:45,191 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:06:45,191 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:06:45,191 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:06:45,209 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 21:06:45,211 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 21:06:45,315 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 21:06:45,316 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:06:45,332 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 336 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 21:06:45,355 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 21:06:45,408 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 21:06:45,408 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:06:45,416 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 336 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 21:06:45,436 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-27 21:06:45,437 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:06:48,678 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 21:06:48,823 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 21:06:48,857 INFO L206 etLargeBlockEncoding]: Checked pairs total: 84314 [2019-12-27 21:06:48,857 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 21:06:48,861 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 98 places, 109 transitions [2019-12-27 21:07:11,602 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129810 states. [2019-12-27 21:07:11,604 INFO L276 IsEmpty]: Start isEmpty. Operand 129810 states. [2019-12-27 21:07:11,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 21:07:11,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:11,611 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 21:07:11,612 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:11,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:11,617 INFO L82 PathProgramCache]: Analyzing trace with hash 816355088, now seen corresponding path program 1 times [2019-12-27 21:07:11,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:11,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753628338] [2019-12-27 21:07:11,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:11,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:11,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753628338] [2019-12-27 21:07:11,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:11,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:07:11,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [510824334] [2019-12-27 21:07:11,968 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:11,974 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:11,988 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 21:07:11,989 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:11,993 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:07:11,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:07:11,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:12,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:07:12,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:07:12,012 INFO L87 Difference]: Start difference. First operand 129810 states. Second operand 3 states. [2019-12-27 21:07:15,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:15,936 INFO L93 Difference]: Finished difference Result 129322 states and 554746 transitions. [2019-12-27 21:07:15,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:07:15,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 21:07:15,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:17,077 INFO L225 Difference]: With dead ends: 129322 [2019-12-27 21:07:17,077 INFO L226 Difference]: Without dead ends: 126774 [2019-12-27 21:07:17,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:07:24,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126774 states. [2019-12-27 21:07:27,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126774 to 126774. [2019-12-27 21:07:27,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126774 states. [2019-12-27 21:07:28,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126774 states to 126774 states and 544358 transitions. [2019-12-27 21:07:28,480 INFO L78 Accepts]: Start accepts. Automaton has 126774 states and 544358 transitions. Word has length 5 [2019-12-27 21:07:28,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:28,480 INFO L462 AbstractCegarLoop]: Abstraction has 126774 states and 544358 transitions. [2019-12-27 21:07:28,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:07:28,481 INFO L276 IsEmpty]: Start isEmpty. Operand 126774 states and 544358 transitions. [2019-12-27 21:07:28,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:07:28,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:28,484 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:07:28,484 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:28,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:28,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1139031116, now seen corresponding path program 1 times [2019-12-27 21:07:28,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:28,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57653980] [2019-12-27 21:07:28,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:28,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:28,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57653980] [2019-12-27 21:07:28,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:28,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:07:28,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [215063180] [2019-12-27 21:07:28,610 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:28,611 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:28,619 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 21:07:28,619 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:28,670 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:07:28,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:07:28,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:28,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:07:28,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:07:28,672 INFO L87 Difference]: Start difference. First operand 126774 states and 544358 transitions. Second operand 5 states. [2019-12-27 21:07:34,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:34,786 INFO L93 Difference]: Finished difference Result 198214 states and 818020 transitions. [2019-12-27 21:07:34,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:07:34,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 21:07:34,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:35,386 INFO L225 Difference]: With dead ends: 198214 [2019-12-27 21:07:35,387 INFO L226 Difference]: Without dead ends: 198165 [2019-12-27 21:07:35,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:07:46,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198165 states. [2019-12-27 21:07:50,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198165 to 183268. [2019-12-27 21:07:50,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183268 states. [2019-12-27 21:07:51,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183268 states to 183268 states and 763968 transitions. [2019-12-27 21:07:51,439 INFO L78 Accepts]: Start accepts. Automaton has 183268 states and 763968 transitions. Word has length 11 [2019-12-27 21:07:51,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:51,439 INFO L462 AbstractCegarLoop]: Abstraction has 183268 states and 763968 transitions. [2019-12-27 21:07:51,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:07:51,439 INFO L276 IsEmpty]: Start isEmpty. Operand 183268 states and 763968 transitions. [2019-12-27 21:07:51,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:07:51,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:51,447 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:07:51,448 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:51,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:51,448 INFO L82 PathProgramCache]: Analyzing trace with hash 2060782969, now seen corresponding path program 1 times [2019-12-27 21:07:51,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:51,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129411558] [2019-12-27 21:07:51,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:51,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:51,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129411558] [2019-12-27 21:07:51,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:51,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:07:51,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2097358462] [2019-12-27 21:07:51,541 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:51,542 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:51,544 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 21:07:51,544 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:51,544 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:07:51,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:07:51,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:51,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:07:51,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:07:51,545 INFO L87 Difference]: Start difference. First operand 183268 states and 763968 transitions. Second operand 4 states. [2019-12-27 21:07:59,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:59,331 INFO L93 Difference]: Finished difference Result 261626 states and 1065461 transitions. [2019-12-27 21:07:59,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:07:59,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 21:07:59,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:08:00,362 INFO L225 Difference]: With dead ends: 261626 [2019-12-27 21:08:00,362 INFO L226 Difference]: Without dead ends: 261563 [2019-12-27 21:08:00,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:08:08,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261563 states. [2019-12-27 21:08:18,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261563 to 223048. [2019-12-27 21:08:18,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223048 states. [2019-12-27 21:08:20,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223048 states to 223048 states and 922460 transitions. [2019-12-27 21:08:20,679 INFO L78 Accepts]: Start accepts. Automaton has 223048 states and 922460 transitions. Word has length 13 [2019-12-27 21:08:20,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:08:20,680 INFO L462 AbstractCegarLoop]: Abstraction has 223048 states and 922460 transitions. [2019-12-27 21:08:20,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:08:20,680 INFO L276 IsEmpty]: Start isEmpty. Operand 223048 states and 922460 transitions. [2019-12-27 21:08:20,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:08:20,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:08:20,683 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:08:20,684 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:08:20,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:08:20,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1688626962, now seen corresponding path program 1 times [2019-12-27 21:08:20,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:08:20,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966447246] [2019-12-27 21:08:20,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:08:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:08:20,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:08:20,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966447246] [2019-12-27 21:08:20,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:08:20,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:08:20,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [265039375] [2019-12-27 21:08:20,777 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:08:20,778 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:08:20,780 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 21:08:20,780 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:08:20,780 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:08:20,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:08:20,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:08:20,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:08:20,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:08:20,781 INFO L87 Difference]: Start difference. First operand 223048 states and 922460 transitions. Second operand 4 states. [2019-12-27 21:08:30,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:08:30,272 INFO L93 Difference]: Finished difference Result 274912 states and 1127900 transitions. [2019-12-27 21:08:30,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:08:30,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 21:08:30,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:08:31,132 INFO L225 Difference]: With dead ends: 274912 [2019-12-27 21:08:31,132 INFO L226 Difference]: Without dead ends: 274912 [2019-12-27 21:08:31,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:08:39,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274912 states. [2019-12-27 21:08:42,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274912 to 235207. [2019-12-27 21:08:42,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235207 states. [2019-12-27 21:08:44,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235207 states to 235207 states and 973199 transitions. [2019-12-27 21:08:44,761 INFO L78 Accepts]: Start accepts. Automaton has 235207 states and 973199 transitions. Word has length 13 [2019-12-27 21:08:44,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:08:44,762 INFO L462 AbstractCegarLoop]: Abstraction has 235207 states and 973199 transitions. [2019-12-27 21:08:44,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:08:44,762 INFO L276 IsEmpty]: Start isEmpty. Operand 235207 states and 973199 transitions. [2019-12-27 21:08:44,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 21:08:44,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:08:44,787 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:08:44,787 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:08:44,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:08:44,787 INFO L82 PathProgramCache]: Analyzing trace with hash -22694219, now seen corresponding path program 1 times [2019-12-27 21:08:44,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:08:44,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011821110] [2019-12-27 21:08:44,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:08:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:08:44,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:08:44,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011821110] [2019-12-27 21:08:44,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:08:44,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:08:44,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [280088856] [2019-12-27 21:08:44,936 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:08:44,939 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:08:44,945 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 77 transitions. [2019-12-27 21:08:44,945 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:08:44,961 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:08:44,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:08:44,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:08:44,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:08:44,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:08:44,962 INFO L87 Difference]: Start difference. First operand 235207 states and 973199 transitions. Second operand 6 states. [2019-12-27 21:08:54,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:08:54,885 INFO L93 Difference]: Finished difference Result 336537 states and 1363420 transitions. [2019-12-27 21:08:54,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:08:54,885 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-27 21:08:54,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:08:55,980 INFO L225 Difference]: With dead ends: 336537 [2019-12-27 21:08:55,980 INFO L226 Difference]: Without dead ends: 336390 [2019-12-27 21:08:55,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:09:10,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336390 states. [2019-12-27 21:09:15,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336390 to 258307. [2019-12-27 21:09:15,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258307 states. [2019-12-27 21:09:17,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258307 states to 258307 states and 1064051 transitions. [2019-12-27 21:09:17,638 INFO L78 Accepts]: Start accepts. Automaton has 258307 states and 1064051 transitions. Word has length 19 [2019-12-27 21:09:17,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:09:17,638 INFO L462 AbstractCegarLoop]: Abstraction has 258307 states and 1064051 transitions. [2019-12-27 21:09:17,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:09:17,638 INFO L276 IsEmpty]: Start isEmpty. Operand 258307 states and 1064051 transitions. [2019-12-27 21:09:17,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 21:09:17,659 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:09:17,659 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:09:17,660 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:09:17,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:09:17,660 INFO L82 PathProgramCache]: Analyzing trace with hash -394850226, now seen corresponding path program 1 times [2019-12-27 21:09:17,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:09:17,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631394425] [2019-12-27 21:09:17,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:09:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:09:17,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:09:17,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631394425] [2019-12-27 21:09:17,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:09:17,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:09:17,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [448647651] [2019-12-27 21:09:17,787 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:09:17,790 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:09:17,796 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 79 transitions. [2019-12-27 21:09:17,797 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:09:17,829 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:09:17,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:09:17,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:09:17,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:09:17,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:09:17,830 INFO L87 Difference]: Start difference. First operand 258307 states and 1064051 transitions. Second operand 5 states. [2019-12-27 21:09:18,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:09:18,275 INFO L93 Difference]: Finished difference Result 52314 states and 172043 transitions. [2019-12-27 21:09:18,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:09:18,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 21:09:18,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:09:18,354 INFO L225 Difference]: With dead ends: 52314 [2019-12-27 21:09:18,355 INFO L226 Difference]: Without dead ends: 47127 [2019-12-27 21:09:18,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:09:18,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47127 states. [2019-12-27 21:09:19,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47127 to 43565. [2019-12-27 21:09:19,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43565 states. [2019-12-27 21:09:19,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43565 states to 43565 states and 141059 transitions. [2019-12-27 21:09:19,114 INFO L78 Accepts]: Start accepts. Automaton has 43565 states and 141059 transitions. Word has length 19 [2019-12-27 21:09:19,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:09:19,115 INFO L462 AbstractCegarLoop]: Abstraction has 43565 states and 141059 transitions. [2019-12-27 21:09:19,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:09:19,115 INFO L276 IsEmpty]: Start isEmpty. Operand 43565 states and 141059 transitions. [2019-12-27 21:09:19,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:09:19,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:09:19,122 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:09:19,122 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:09:19,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:09:19,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1635132596, now seen corresponding path program 1 times [2019-12-27 21:09:19,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:09:19,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137044134] [2019-12-27 21:09:19,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:09:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:09:21,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:09:21,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137044134] [2019-12-27 21:09:21,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:09:21,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:09:21,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [260847749] [2019-12-27 21:09:21,881 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:09:21,885 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:09:21,898 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 121 transitions. [2019-12-27 21:09:21,898 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:09:21,969 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:09:21,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:09:21,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:09:21,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:09:21,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:09:21,971 INFO L87 Difference]: Start difference. First operand 43565 states and 141059 transitions. Second operand 8 states. [2019-12-27 21:09:23,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:09:23,008 INFO L93 Difference]: Finished difference Result 59952 states and 190384 transitions. [2019-12-27 21:09:23,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:09:23,009 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-12-27 21:09:23,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:09:23,111 INFO L225 Difference]: With dead ends: 59952 [2019-12-27 21:09:23,111 INFO L226 Difference]: Without dead ends: 59952 [2019-12-27 21:09:23,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:09:23,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59952 states. [2019-12-27 21:09:23,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59952 to 47880. [2019-12-27 21:09:23,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47880 states. [2019-12-27 21:09:24,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47880 states to 47880 states and 154130 transitions. [2019-12-27 21:09:24,362 INFO L78 Accepts]: Start accepts. Automaton has 47880 states and 154130 transitions. Word has length 25 [2019-12-27 21:09:24,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:09:24,363 INFO L462 AbstractCegarLoop]: Abstraction has 47880 states and 154130 transitions. [2019-12-27 21:09:24,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:09:24,363 INFO L276 IsEmpty]: Start isEmpty. Operand 47880 states and 154130 transitions. [2019-12-27 21:09:24,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:09:24,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:09:24,372 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:09:24,372 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:09:24,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:09:24,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1874611609, now seen corresponding path program 1 times [2019-12-27 21:09:24,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:09:24,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959232414] [2019-12-27 21:09:24,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:09:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:09:24,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:09:24,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959232414] [2019-12-27 21:09:24,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:09:24,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:09:24,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [392057486] [2019-12-27 21:09:24,477 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:09:24,480 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:09:24,485 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 21:09:24,485 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:09:24,485 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:09:24,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:09:24,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:09:24,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:09:24,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:09:24,487 INFO L87 Difference]: Start difference. First operand 47880 states and 154130 transitions. Second operand 5 states. [2019-12-27 21:09:25,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:09:25,068 INFO L93 Difference]: Finished difference Result 63187 states and 200246 transitions. [2019-12-27 21:09:25,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:09:25,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 21:09:25,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:09:25,171 INFO L225 Difference]: With dead ends: 63187 [2019-12-27 21:09:25,171 INFO L226 Difference]: Without dead ends: 63187 [2019-12-27 21:09:25,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:09:25,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63187 states. [2019-12-27 21:09:26,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63187 to 50424. [2019-12-27 21:09:26,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50424 states. [2019-12-27 21:09:26,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50424 states to 50424 states and 162097 transitions. [2019-12-27 21:09:26,109 INFO L78 Accepts]: Start accepts. Automaton has 50424 states and 162097 transitions. Word has length 25 [2019-12-27 21:09:26,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:09:26,110 INFO L462 AbstractCegarLoop]: Abstraction has 50424 states and 162097 transitions. [2019-12-27 21:09:26,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:09:26,110 INFO L276 IsEmpty]: Start isEmpty. Operand 50424 states and 162097 transitions. [2019-12-27 21:09:26,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 21:09:26,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:09:26,127 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] [2019-12-27 21:09:26,328 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:09:26,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:09:26,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1232348268, now seen corresponding path program 1 times [2019-12-27 21:09:26,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:09:26,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282848139] [2019-12-27 21:09:26,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:09:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:09:26,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:09:26,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282848139] [2019-12-27 21:09:26,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:09:26,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:09:26,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1597299626] [2019-12-27 21:09:26,438 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:09:26,446 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:09:26,479 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 116 states and 199 transitions. [2019-12-27 21:09:26,479 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:09:26,532 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:09:26,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:09:26,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:09:26,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:09:26,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:09:26,534 INFO L87 Difference]: Start difference. First operand 50424 states and 162097 transitions. Second operand 7 states. [2019-12-27 21:09:26,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:09:26,853 INFO L93 Difference]: Finished difference Result 11271 states and 30627 transitions. [2019-12-27 21:09:26,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:09:26,854 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-12-27 21:09:26,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:09:26,872 INFO L225 Difference]: With dead ends: 11271 [2019-12-27 21:09:26,873 INFO L226 Difference]: Without dead ends: 9868 [2019-12-27 21:09:26,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:09:26,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9868 states. [2019-12-27 21:09:27,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9868 to 9532. [2019-12-27 21:09:27,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9532 states. [2019-12-27 21:09:27,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9532 states to 9532 states and 25671 transitions. [2019-12-27 21:09:27,018 INFO L78 Accepts]: Start accepts. Automaton has 9532 states and 25671 transitions. Word has length 31 [2019-12-27 21:09:27,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:09:27,018 INFO L462 AbstractCegarLoop]: Abstraction has 9532 states and 25671 transitions. [2019-12-27 21:09:27,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:09:27,018 INFO L276 IsEmpty]: Start isEmpty. Operand 9532 states and 25671 transitions. [2019-12-27 21:09:27,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 21:09:27,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:09:27,028 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:09:27,028 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:09:27,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:09:27,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1438726867, now seen corresponding path program 1 times [2019-12-27 21:09:27,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:09:27,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603268145] [2019-12-27 21:09:27,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:09:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:09:27,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:09:27,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603268145] [2019-12-27 21:09:27,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:09:27,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:09:27,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [357957906] [2019-12-27 21:09:27,130 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:09:27,136 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:09:27,165 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 203 transitions. [2019-12-27 21:09:27,165 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:09:27,178 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:09:27,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:09:27,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:09:27,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:09:27,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:09:27,179 INFO L87 Difference]: Start difference. First operand 9532 states and 25671 transitions. Second operand 7 states. [2019-12-27 21:09:27,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:09:27,276 INFO L93 Difference]: Finished difference Result 6843 states and 19372 transitions. [2019-12-27 21:09:27,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:09:27,277 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-12-27 21:09:27,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:09:27,286 INFO L225 Difference]: With dead ends: 6843 [2019-12-27 21:09:27,287 INFO L226 Difference]: Without dead ends: 6730 [2019-12-27 21:09:27,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:09:27,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6730 states. [2019-12-27 21:09:27,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6730 to 5841. [2019-12-27 21:09:27,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5841 states. [2019-12-27 21:09:27,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5841 states to 5841 states and 16742 transitions. [2019-12-27 21:09:27,375 INFO L78 Accepts]: Start accepts. Automaton has 5841 states and 16742 transitions. Word has length 37 [2019-12-27 21:09:27,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:09:27,375 INFO L462 AbstractCegarLoop]: Abstraction has 5841 states and 16742 transitions. [2019-12-27 21:09:27,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:09:27,376 INFO L276 IsEmpty]: Start isEmpty. Operand 5841 states and 16742 transitions. [2019-12-27 21:09:27,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:09:27,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:09:27,387 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:09:27,388 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:09:27,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:09:27,388 INFO L82 PathProgramCache]: Analyzing trace with hash -285289946, now seen corresponding path program 1 times [2019-12-27 21:09:27,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:09:27,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110436001] [2019-12-27 21:09:27,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:09:27,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:09:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:09:27,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110436001] [2019-12-27 21:09:27,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:09:27,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:09:27,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [54653563] [2019-12-27 21:09:27,456 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:09:27,476 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:09:27,632 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 352 transitions. [2019-12-27 21:09:27,632 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:09:27,633 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:09:27,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:09:27,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:09:27,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:09:27,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:09:27,634 INFO L87 Difference]: Start difference. First operand 5841 states and 16742 transitions. Second operand 3 states. [2019-12-27 21:09:27,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:09:27,696 INFO L93 Difference]: Finished difference Result 5853 states and 16754 transitions. [2019-12-27 21:09:27,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:09:27,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 21:09:27,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:09:27,704 INFO L225 Difference]: With dead ends: 5853 [2019-12-27 21:09:27,704 INFO L226 Difference]: Without dead ends: 5853 [2019-12-27 21:09:27,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:09:27,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5853 states. [2019-12-27 21:09:27,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5853 to 5844. [2019-12-27 21:09:27,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5844 states. [2019-12-27 21:09:27,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5844 states to 5844 states and 16745 transitions. [2019-12-27 21:09:27,784 INFO L78 Accepts]: Start accepts. Automaton has 5844 states and 16745 transitions. Word has length 65 [2019-12-27 21:09:27,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:09:27,785 INFO L462 AbstractCegarLoop]: Abstraction has 5844 states and 16745 transitions. [2019-12-27 21:09:27,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:09:27,785 INFO L276 IsEmpty]: Start isEmpty. Operand 5844 states and 16745 transitions. [2019-12-27 21:09:27,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:09:27,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:09:27,793 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:09:27,793 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:09:27,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:09:27,794 INFO L82 PathProgramCache]: Analyzing trace with hash 382965131, now seen corresponding path program 1 times [2019-12-27 21:09:27,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:09:27,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288044435] [2019-12-27 21:09:27,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:09:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:09:27,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:09:27,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288044435] [2019-12-27 21:09:27,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:09:27,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:09:27,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1454787460] [2019-12-27 21:09:27,890 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:09:27,911 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:09:28,140 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 352 transitions. [2019-12-27 21:09:28,141 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:09:28,145 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:09:28,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:09:28,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:09:28,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:09:28,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:09:28,146 INFO L87 Difference]: Start difference. First operand 5844 states and 16745 transitions. Second operand 3 states. [2019-12-27 21:09:28,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:09:28,195 INFO L93 Difference]: Finished difference Result 5558 states and 15712 transitions. [2019-12-27 21:09:28,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:09:28,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 21:09:28,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:09:28,208 INFO L225 Difference]: With dead ends: 5558 [2019-12-27 21:09:28,208 INFO L226 Difference]: Without dead ends: 5558 [2019-12-27 21:09:28,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:09:28,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5558 states. [2019-12-27 21:09:28,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5558 to 5558. [2019-12-27 21:09:28,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5558 states. [2019-12-27 21:09:28,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5558 states to 5558 states and 15712 transitions. [2019-12-27 21:09:28,364 INFO L78 Accepts]: Start accepts. Automaton has 5558 states and 15712 transitions. Word has length 65 [2019-12-27 21:09:28,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:09:28,365 INFO L462 AbstractCegarLoop]: Abstraction has 5558 states and 15712 transitions. [2019-12-27 21:09:28,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:09:28,365 INFO L276 IsEmpty]: Start isEmpty. Operand 5558 states and 15712 transitions. [2019-12-27 21:09:28,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:09:28,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:09:28,380 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:09:28,380 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:09:28,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:09:28,381 INFO L82 PathProgramCache]: Analyzing trace with hash -730876238, now seen corresponding path program 1 times [2019-12-27 21:09:28,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:09:28,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313631567] [2019-12-27 21:09:28,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:09:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:09:28,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:09:28,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313631567] [2019-12-27 21:09:28,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:09:28,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:09:28,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [370572988] [2019-12-27 21:09:28,555 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:09:28,576 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:09:28,743 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 195 states and 336 transitions. [2019-12-27 21:09:28,743 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:09:28,744 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:09:28,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:09:28,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:09:28,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:09:28,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:09:28,745 INFO L87 Difference]: Start difference. First operand 5558 states and 15712 transitions. Second operand 3 states. [2019-12-27 21:09:28,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:09:28,815 INFO L93 Difference]: Finished difference Result 5557 states and 15710 transitions. [2019-12-27 21:09:28,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:09:28,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 21:09:28,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:09:28,824 INFO L225 Difference]: With dead ends: 5557 [2019-12-27 21:09:28,824 INFO L226 Difference]: Without dead ends: 5557 [2019-12-27 21:09:28,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:09:28,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5557 states. [2019-12-27 21:09:28,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5557 to 4261. [2019-12-27 21:09:28,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4261 states. [2019-12-27 21:09:28,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4261 states to 4261 states and 12190 transitions. [2019-12-27 21:09:28,958 INFO L78 Accepts]: Start accepts. Automaton has 4261 states and 12190 transitions. Word has length 66 [2019-12-27 21:09:28,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:09:28,959 INFO L462 AbstractCegarLoop]: Abstraction has 4261 states and 12190 transitions. [2019-12-27 21:09:28,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:09:28,959 INFO L276 IsEmpty]: Start isEmpty. Operand 4261 states and 12190 transitions. [2019-12-27 21:09:28,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:09:28,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:09:28,973 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:09:28,973 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:09:28,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:09:28,974 INFO L82 PathProgramCache]: Analyzing trace with hash 350380320, now seen corresponding path program 1 times [2019-12-27 21:09:28,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:09:28,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203748926] [2019-12-27 21:09:28,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:09:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:09:29,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:09:29,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203748926] [2019-12-27 21:09:29,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:09:29,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:09:29,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [932974142] [2019-12-27 21:09:29,220 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:09:29,294 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:09:29,515 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 196 states and 325 transitions. [2019-12-27 21:09:29,515 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:09:29,654 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:09:29,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:09:29,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:09:29,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:09:29,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:09:29,656 INFO L87 Difference]: Start difference. First operand 4261 states and 12190 transitions. Second operand 11 states. [2019-12-27 21:09:30,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:09:30,621 INFO L93 Difference]: Finished difference Result 12272 states and 35158 transitions. [2019-12-27 21:09:30,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 21:09:30,621 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 21:09:30,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:09:30,634 INFO L225 Difference]: With dead ends: 12272 [2019-12-27 21:09:30,634 INFO L226 Difference]: Without dead ends: 7757 [2019-12-27 21:09:30,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=313, Unknown=0, NotChecked=0, Total=462 [2019-12-27 21:09:30,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7757 states. [2019-12-27 21:09:30,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7757 to 3613. [2019-12-27 21:09:30,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3613 states. [2019-12-27 21:09:30,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3613 states to 3613 states and 10237 transitions. [2019-12-27 21:09:30,714 INFO L78 Accepts]: Start accepts. Automaton has 3613 states and 10237 transitions. Word has length 67 [2019-12-27 21:09:30,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:09:30,714 INFO L462 AbstractCegarLoop]: Abstraction has 3613 states and 10237 transitions. [2019-12-27 21:09:30,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:09:30,714 INFO L276 IsEmpty]: Start isEmpty. Operand 3613 states and 10237 transitions. [2019-12-27 21:09:30,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:09:30,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:09:30,718 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:09:30,718 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:09:30,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:09:30,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1290030680, now seen corresponding path program 2 times [2019-12-27 21:09:30,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:09:30,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954330751] [2019-12-27 21:09:30,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:09:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:09:30,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:09:30,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954330751] [2019-12-27 21:09:30,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:09:30,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:09:30,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [984623054] [2019-12-27 21:09:30,800 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:09:30,820 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:09:30,975 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 146 states and 213 transitions. [2019-12-27 21:09:30,976 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:09:30,995 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:09:30,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:09:30,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:09:30,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:09:30,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:09:30,996 INFO L87 Difference]: Start difference. First operand 3613 states and 10237 transitions. Second operand 4 states. [2019-12-27 21:09:31,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:09:31,092 INFO L93 Difference]: Finished difference Result 3430 states and 9534 transitions. [2019-12-27 21:09:31,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:09:31,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 21:09:31,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:09:31,098 INFO L225 Difference]: With dead ends: 3430 [2019-12-27 21:09:31,098 INFO L226 Difference]: Without dead ends: 3430 [2019-12-27 21:09:31,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:09:31,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3430 states. [2019-12-27 21:09:31,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3430 to 3276. [2019-12-27 21:09:31,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3276 states. [2019-12-27 21:09:31,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3276 states to 3276 states and 9108 transitions. [2019-12-27 21:09:31,177 INFO L78 Accepts]: Start accepts. Automaton has 3276 states and 9108 transitions. Word has length 67 [2019-12-27 21:09:31,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:09:31,177 INFO L462 AbstractCegarLoop]: Abstraction has 3276 states and 9108 transitions. [2019-12-27 21:09:31,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:09:31,178 INFO L276 IsEmpty]: Start isEmpty. Operand 3276 states and 9108 transitions. [2019-12-27 21:09:31,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 21:09:31,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:09:31,182 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:09:31,183 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:09:31,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:09:31,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1954092807, now seen corresponding path program 1 times [2019-12-27 21:09:31,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:09:31,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097367236] [2019-12-27 21:09:31,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:09:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:09:31,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:09:31,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097367236] [2019-12-27 21:09:31,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:09:31,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 21:09:31,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [358080736] [2019-12-27 21:09:31,682 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:09:31,709 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:09:31,856 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 150 states and 232 transitions. [2019-12-27 21:09:31,856 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:09:32,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:09:32,136 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 21:09:32,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 21:09:32,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:09:32,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 21:09:32,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-12-27 21:09:32,138 INFO L87 Difference]: Start difference. First operand 3276 states and 9108 transitions. Second operand 18 states. [2019-12-27 21:09:33,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:09:33,789 INFO L93 Difference]: Finished difference Result 6848 states and 19043 transitions. [2019-12-27 21:09:33,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 21:09:33,789 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 68 [2019-12-27 21:09:33,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:09:33,799 INFO L225 Difference]: With dead ends: 6848 [2019-12-27 21:09:33,800 INFO L226 Difference]: Without dead ends: 6421 [2019-12-27 21:09:33,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=257, Invalid=1003, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 21:09:33,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6421 states. [2019-12-27 21:09:33,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6421 to 4646. [2019-12-27 21:09:33,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4646 states. [2019-12-27 21:09:33,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4646 states to 4646 states and 12870 transitions. [2019-12-27 21:09:33,874 INFO L78 Accepts]: Start accepts. Automaton has 4646 states and 12870 transitions. Word has length 68 [2019-12-27 21:09:33,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:09:33,874 INFO L462 AbstractCegarLoop]: Abstraction has 4646 states and 12870 transitions. [2019-12-27 21:09:33,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 21:09:33,874 INFO L276 IsEmpty]: Start isEmpty. Operand 4646 states and 12870 transitions. [2019-12-27 21:09:33,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 21:09:33,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:09:33,879 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:09:33,879 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:09:33,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:09:33,879 INFO L82 PathProgramCache]: Analyzing trace with hash 2120595639, now seen corresponding path program 2 times [2019-12-27 21:09:33,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:09:33,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054546822] [2019-12-27 21:09:33,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:09:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:09:34,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:09:34,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054546822] [2019-12-27 21:09:34,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:09:34,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 21:09:34,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1834713143] [2019-12-27 21:09:34,146 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:09:34,167 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:09:34,340 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 148 states and 226 transitions. [2019-12-27 21:09:34,341 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:09:34,485 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 21:09:34,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:09:34,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:09:34,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:09:34,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:09:34,487 INFO L87 Difference]: Start difference. First operand 4646 states and 12870 transitions. Second operand 13 states. [2019-12-27 21:09:35,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:09:35,463 INFO L93 Difference]: Finished difference Result 8315 states and 22910 transitions. [2019-12-27 21:09:35,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:09:35,463 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-27 21:09:35,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:09:35,476 INFO L225 Difference]: With dead ends: 8315 [2019-12-27 21:09:35,476 INFO L226 Difference]: Without dead ends: 8042 [2019-12-27 21:09:35,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 11 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2019-12-27 21:09:35,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8042 states. [2019-12-27 21:09:35,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8042 to 4859. [2019-12-27 21:09:35,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4859 states. [2019-12-27 21:09:35,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4859 states to 4859 states and 13478 transitions. [2019-12-27 21:09:35,602 INFO L78 Accepts]: Start accepts. Automaton has 4859 states and 13478 transitions. Word has length 68 [2019-12-27 21:09:35,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:09:35,602 INFO L462 AbstractCegarLoop]: Abstraction has 4859 states and 13478 transitions. [2019-12-27 21:09:35,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:09:35,603 INFO L276 IsEmpty]: Start isEmpty. Operand 4859 states and 13478 transitions. [2019-12-27 21:09:35,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 21:09:35,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:09:35,609 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:09:35,609 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:09:35,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:09:35,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1559121729, now seen corresponding path program 3 times [2019-12-27 21:09:35,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:09:35,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970839666] [2019-12-27 21:09:35,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:09:35,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:09:35,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:09:35,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970839666] [2019-12-27 21:09:35,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:09:35,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 21:09:35,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [215808756] [2019-12-27 21:09:35,955 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:09:35,975 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:09:36,150 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 339 transitions. [2019-12-27 21:09:36,151 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:09:36,346 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 21:09:36,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 21:09:36,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:09:36,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 21:09:36,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-27 21:09:36,348 INFO L87 Difference]: Start difference. First operand 4859 states and 13478 transitions. Second operand 16 states. [2019-12-27 21:09:37,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:09:37,348 INFO L93 Difference]: Finished difference Result 7362 states and 20214 transitions. [2019-12-27 21:09:37,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 21:09:37,349 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2019-12-27 21:09:37,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:09:37,357 INFO L225 Difference]: With dead ends: 7362 [2019-12-27 21:09:37,357 INFO L226 Difference]: Without dead ends: 7061 [2019-12-27 21:09:37,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 4 SyntacticMatches, 13 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=232, Invalid=890, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 21:09:37,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7061 states. [2019-12-27 21:09:37,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7061 to 4604. [2019-12-27 21:09:37,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4604 states. [2019-12-27 21:09:37,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4604 states to 4604 states and 12686 transitions. [2019-12-27 21:09:37,433 INFO L78 Accepts]: Start accepts. Automaton has 4604 states and 12686 transitions. Word has length 68 [2019-12-27 21:09:37,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:09:37,433 INFO L462 AbstractCegarLoop]: Abstraction has 4604 states and 12686 transitions. [2019-12-27 21:09:37,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 21:09:37,433 INFO L276 IsEmpty]: Start isEmpty. Operand 4604 states and 12686 transitions. [2019-12-27 21:09:37,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 21:09:37,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:09:37,438 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:09:37,438 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:09:37,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:09:37,438 INFO L82 PathProgramCache]: Analyzing trace with hash -424200247, now seen corresponding path program 4 times [2019-12-27 21:09:37,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:09:37,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514876340] [2019-12-27 21:09:37,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:09:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:09:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:09:37,609 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:09:37,609 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:09:37,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] ULTIMATE.startENTRY-->L817: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~a~0_9) (= 0 v_~weak$$choice0~0_8) (= v_~x$r_buff1_thd2~0_17 0) (= v_~__unbuffered_p2_EBX~0_10 0) (= 0 v_~x$w_buff1~0_23) (= 0 v_~x$r_buff0_thd1~0_20) (= (select .cse0 |v_ULTIMATE.start_main_~#t1019~0.base_25|) 0) (= 0 v_~__unbuffered_p1_EAX~0_12) (= |v_#NULL.offset_6| 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1019~0.base_25| 4)) (= 0 v_~x$r_buff0_thd2~0_27) (< 0 |v_#StackHeapBarrier_19|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1019~0.base_25| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1019~0.base_25|) |v_ULTIMATE.start_main_~#t1019~0.offset_19| 0)) |v_#memory_int_15|) (= v_~x$flush_delayed~0_16 0) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1019~0.base_25| 1)) (= 0 v_~x$w_buff0~0_26) (= v_~x$w_buff1_used~0_67 0) (= 0 v_~z~0_7) (= v_~x$mem_tmp~0_9 0) (= 0 v_~x$read_delayed_var~0.base_7) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1019~0.base_25|) (= v_~x$r_buff1_thd1~0_18 0) (= v_~x$r_buff1_thd0~0_47 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 v_~x$r_buff0_thd0~0_79) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~x~0_31 0) (= 0 v_~x$read_delayed~0_7) (= 0 v_~x$r_buff0_thd3~0_20) (= v_~x$r_buff1_thd3~0_18 0) (= 0 |v_ULTIMATE.start_main_~#t1019~0.offset_19|) (= 0 v_~x$w_buff0_used~0_114) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~y~0_11 0) (= v_~main$tmp_guard0~0_11 0) (= 0 v_~__unbuffered_cnt~0_18) (= v_~main$tmp_guard1~0_13 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_16|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_9|, ~x$w_buff0~0=v_~x$w_buff0~0_26, ULTIMATE.start_main_~#t1020~0.base=|v_ULTIMATE.start_main_~#t1020~0.base_27|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_11|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_13|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_15|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_18, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_~#t1020~0.offset=|v_ULTIMATE.start_main_~#t1020~0.offset_20|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_17|, ~a~0=v_~a~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_79, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ~x$w_buff1~0=v_~x$w_buff1~0_23, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ULTIMATE.start_main_~#t1021~0.base=|v_ULTIMATE.start_main_~#t1021~0.base_23|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~x~0=v_~x~0_31, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_9|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_14|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~x$mem_tmp~0=v_~x$mem_tmp~0_9, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_17|, ~y~0=v_~y~0_11, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_9|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_8|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_~#t1019~0.base=|v_ULTIMATE.start_main_~#t1019~0.base_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_47, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_27, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_114, ULTIMATE.start_main_~#t1021~0.offset=|v_ULTIMATE.start_main_~#t1021~0.offset_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_15|, ~z~0=v_~z~0_7, ~weak$$choice2~0=v_~weak$$choice2~0_33, ULTIMATE.start_main_~#t1019~0.offset=|v_ULTIMATE.start_main_~#t1019~0.offset_19|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_~#t1020~0.base, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t1020~0.offset, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t1021~0.base, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t1019~0.base, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t1021~0.offset, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1019~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 21:09:37,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L817-1-->L819: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1020~0.base_13| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1020~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1020~0.base_13|) |v_ULTIMATE.start_main_~#t1020~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1020~0.base_13| 4)) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1020~0.base_13| 1) |v_#valid_38|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1020~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1020~0.offset_11| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1020~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_5|, ULTIMATE.start_main_~#t1020~0.base=|v_ULTIMATE.start_main_~#t1020~0.base_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1020~0.offset=|v_ULTIMATE.start_main_~#t1020~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1020~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1020~0.offset] because there is no mapped edge [2019-12-27 21:09:37,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L4-->L768: Formula: (and (= ~x$r_buff0_thd3~0_In1965469910 ~x$r_buff1_thd3~0_Out1965469910) (= 1 ~x$r_buff0_thd2~0_Out1965469910) (= ~x$r_buff1_thd0~0_Out1965469910 ~x$r_buff0_thd0~0_In1965469910) (= ~y~0_In1965469910 ~__unbuffered_p1_EAX~0_Out1965469910) (= ~x$r_buff0_thd1~0_In1965469910 ~x$r_buff1_thd1~0_Out1965469910) (not (= 0 P1Thread1of1ForFork1___VERIFIER_assert_~expression_In1965469910)) (= ~x$r_buff1_thd2~0_Out1965469910 ~x$r_buff0_thd2~0_In1965469910)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In1965469910, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1965469910, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1965469910, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1965469910, ~y~0=~y~0_In1965469910, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1965469910} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In1965469910, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1965469910, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1965469910, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out1965469910, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_Out1965469910, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1965469910, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1965469910, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1965469910, ~y~0=~y~0_In1965469910, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1965469910, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1965469910} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 21:09:37,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-229499905 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-229499905 256) 0))) (or (and (= ~x$w_buff0_used~0_In-229499905 |P1Thread1of1ForFork1_#t~ite11_Out-229499905|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-229499905|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-229499905, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-229499905} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-229499905|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-229499905, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-229499905} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 21:09:37,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In394942285 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In394942285 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In394942285 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In394942285 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In394942285 |P1Thread1of1ForFork1_#t~ite12_Out394942285|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out394942285|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In394942285, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In394942285, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In394942285, ~x$w_buff0_used~0=~x$w_buff0_used~0_In394942285} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In394942285, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In394942285, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out394942285|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In394942285, ~x$w_buff0_used~0=~x$w_buff0_used~0_In394942285} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 21:09:37,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L819-1-->L821: Formula: (and (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1021~0.base_12| 1)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1021~0.base_12|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1021~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1021~0.base_12|) |v_ULTIMATE.start_main_~#t1021~0.offset_11| 2))) (not (= |v_ULTIMATE.start_main_~#t1021~0.base_12| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1021~0.base_12| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1021~0.base_12|) (= |v_ULTIMATE.start_main_~#t1021~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1021~0.offset=|v_ULTIMATE.start_main_~#t1021~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_6|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1021~0.base=|v_ULTIMATE.start_main_~#t1021~0.base_12|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1021~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t1021~0.base, #length] because there is no mapped edge [2019-12-27 21:09:37,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L794-2-->L794-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1563177107 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In1563177107 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In1563177107 |P2Thread1of1ForFork2_#t~ite15_Out1563177107|) (not .cse1)) (and (= ~x~0_In1563177107 |P2Thread1of1ForFork2_#t~ite15_Out1563177107|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1563177107, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1563177107, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1563177107, ~x~0=~x~0_In1563177107} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1563177107|, ~x$w_buff1~0=~x$w_buff1~0_In1563177107, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1563177107, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1563177107, ~x~0=~x~0_In1563177107} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 21:09:37,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L794-4-->L795: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~x~0_17) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-27 21:09:37,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L739-2-->L739-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1503310142 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1503310142 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite3_Out1503310142| ~x$w_buff1~0_In1503310142) (not .cse1)) (and (= ~x~0_In1503310142 |P0Thread1of1ForFork0_#t~ite3_Out1503310142|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1503310142, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1503310142, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1503310142, ~x~0=~x~0_In1503310142} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1503310142|, ~x$w_buff1~0=~x$w_buff1~0_In1503310142, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1503310142, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1503310142, ~x~0=~x~0_In1503310142} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3] because there is no mapped edge [2019-12-27 21:09:37,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L739-4-->L740: Formula: (= v_~x~0_18 |v_P0Thread1of1ForFork0_#t~ite3_8|) InVars {P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_8|} OutVars{P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_7|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_7|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, ~x~0] because there is no mapped edge [2019-12-27 21:09:37,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L795-->L795-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1057222623 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1057222623 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite17_Out-1057222623| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite17_Out-1057222623| ~x$w_buff0_used~0_In-1057222623)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1057222623, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1057222623} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1057222623, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-1057222623|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1057222623} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 21:09:37,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In-1115932295 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1115932295 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In-1115932295 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1115932295 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite18_Out-1115932295|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-1115932295 |P2Thread1of1ForFork2_#t~ite18_Out-1115932295|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1115932295, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1115932295, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1115932295, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1115932295} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1115932295, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1115932295, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1115932295, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1115932295|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1115932295} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 21:09:37,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L797-->L797-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1110591662 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1110591662 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out-1110591662| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In-1110591662 |P2Thread1of1ForFork2_#t~ite19_Out-1110591662|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1110591662, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1110591662} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1110591662, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-1110591662|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1110591662} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 21:09:37,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L798-->L798-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-410151188 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd3~0_In-410151188 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd3~0_In-410151188 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-410151188 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite20_Out-410151188| ~x$r_buff1_thd3~0_In-410151188)) (and (= |P2Thread1of1ForFork2_#t~ite20_Out-410151188| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-410151188, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-410151188, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-410151188, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-410151188} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-410151188|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-410151188, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-410151188, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-410151188, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-410151188} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 21:09:37,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L798-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~x$r_buff1_thd3~0_14)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_14, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 21:09:37,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L740-->L740-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1708227875 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1708227875 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1708227875|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1708227875 |P0Thread1of1ForFork0_#t~ite5_Out-1708227875|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1708227875, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1708227875} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1708227875|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1708227875, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1708227875} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 21:09:37,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L741-->L741-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1772616413 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-1772616413 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-1772616413 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1772616413 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1772616413| ~x$w_buff1_used~0_In-1772616413) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1772616413| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1772616413, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1772616413, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1772616413, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1772616413} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1772616413|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1772616413, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1772616413, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1772616413, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1772616413} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 21:09:37,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In2058958565 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In2058958565 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite7_Out2058958565|) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd1~0_In2058958565 |P0Thread1of1ForFork0_#t~ite7_Out2058958565|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2058958565, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2058958565} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2058958565, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out2058958565|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2058958565} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 21:09:37,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L743-->L743-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-540670658 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-540670658 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-540670658 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-540670658 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-540670658| ~x$r_buff1_thd1~0_In-540670658)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-540670658| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-540670658, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-540670658, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-540670658, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-540670658} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-540670658, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-540670658|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-540670658, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-540670658, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-540670658} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 21:09:37,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L743-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_13 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_13} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 21:09:37,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L771-->L772: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1439027088 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1439027088 256) 0))) (or (and (= 0 ~x$r_buff0_thd2~0_Out-1439027088) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In-1439027088 ~x$r_buff0_thd2~0_Out-1439027088) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1439027088, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1439027088} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1439027088|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1439027088, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1439027088} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 21:09:37,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In840579785 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In840579785 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In840579785 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In840579785 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out840579785| ~x$r_buff1_thd2~0_In840579785) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out840579785|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In840579785, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In840579785, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In840579785, ~x$w_buff0_used~0=~x$w_buff0_used~0_In840579785} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In840579785, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In840579785, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In840579785, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out840579785|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In840579785} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 21:09:37,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L772-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 21:09:37,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L825-->L827-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_46 256)) (= (mod v_~x$w_buff0_used~0_80 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_80} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_80} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 21:09:37,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L827-2-->L827-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In32426951 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In32426951 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite24_Out32426951| ~x~0_In32426951)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite24_Out32426951| ~x$w_buff1~0_In32426951)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In32426951, ~x$w_buff1_used~0=~x$w_buff1_used~0_In32426951, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In32426951, ~x~0=~x~0_In32426951} OutVars{~x$w_buff1~0=~x$w_buff1~0_In32426951, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out32426951|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In32426951, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In32426951, ~x~0=~x~0_In32426951} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 21:09:37,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L827-4-->L828: Formula: (= v_~x~0_22 |v_ULTIMATE.start_main_#t~ite24_8|) InVars {ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_8|} OutVars{ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_7|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_8|, ~x~0=v_~x~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ~x~0] because there is no mapped edge [2019-12-27 21:09:37,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L828-->L828-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In2140589351 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In2140589351 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite26_Out2140589351|)) (and (= ~x$w_buff0_used~0_In2140589351 |ULTIMATE.start_main_#t~ite26_Out2140589351|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2140589351, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2140589351} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2140589351, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out2140589351|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2140589351} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 21:09:37,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L829-->L829-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-1941697845 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-1941697845 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1941697845 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1941697845 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1941697845 |ULTIMATE.start_main_#t~ite27_Out-1941697845|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite27_Out-1941697845|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1941697845, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1941697845, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1941697845, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1941697845} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1941697845, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1941697845, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1941697845|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1941697845, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1941697845} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 21:09:37,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In522038264 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In522038264 256)))) (or (and (= ~x$r_buff0_thd0~0_In522038264 |ULTIMATE.start_main_#t~ite28_Out522038264|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite28_Out522038264| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In522038264, ~x$w_buff0_used~0=~x$w_buff0_used~0_In522038264} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In522038264, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out522038264|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In522038264} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 21:09:37,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L831-->L831-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1219863409 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-1219863409 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1219863409 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1219863409 256)))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out-1219863409| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite29_Out-1219863409| ~x$r_buff1_thd0~0_In-1219863409)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1219863409, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1219863409, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1219863409, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1219863409} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1219863409, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1219863409|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1219863409, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1219863409, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1219863409} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 21:09:37,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L843-->L844: Formula: (and (= v_~x$r_buff0_thd0~0_57 v_~x$r_buff0_thd0~0_56) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 21:09:37,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L844-->L844-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-408970117 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_In-408970117| |ULTIMATE.start_main_#t~ite50_Out-408970117|) (= ~x$r_buff1_thd0~0_In-408970117 |ULTIMATE.start_main_#t~ite51_Out-408970117|) (not .cse0)) (and .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-408970117 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-408970117 256))) (and (= 0 (mod ~x$r_buff1_thd0~0_In-408970117 256)) .cse1) (= (mod ~x$w_buff0_used~0_In-408970117 256) 0))) (= ~x$r_buff1_thd0~0_In-408970117 |ULTIMATE.start_main_#t~ite50_Out-408970117|) (= |ULTIMATE.start_main_#t~ite50_Out-408970117| |ULTIMATE.start_main_#t~ite51_Out-408970117|)))) InVars {ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_In-408970117|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-408970117, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-408970117, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-408970117, ~weak$$choice2~0=~weak$$choice2~0_In-408970117, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-408970117} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-408970117|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-408970117, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-408970117|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-408970117, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-408970117, ~weak$$choice2~0=~weak$$choice2~0_In-408970117, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-408970117} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 21:09:37,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L846-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= v_~x$mem_tmp~0_6 v_~x~0_25) (= v_~x$flush_delayed~0_10 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:09:37,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 21:09:37,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:09:37 BasicIcfg [2019-12-27 21:09:37,773 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:09:37,778 INFO L168 Benchmark]: Toolchain (without parser) took 174598.30 ms. Allocated memory was 138.4 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 100.3 MB in the beginning and 3.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 21:09:37,779 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 21:09:37,779 INFO L168 Benchmark]: CACSL2BoogieTranslator took 816.42 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 99.9 MB in the beginning and 156.1 MB in the end (delta: -56.2 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:09:37,782 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.74 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 152.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 21:09:37,782 INFO L168 Benchmark]: Boogie Preprocessor took 39.87 ms. Allocated memory is still 202.9 MB. Free memory was 152.8 MB in the beginning and 150.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:09:37,784 INFO L168 Benchmark]: RCFGBuilder took 894.86 ms. Allocated memory is still 202.9 MB. Free memory was 150.8 MB in the beginning and 100.0 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:09:37,785 INFO L168 Benchmark]: TraceAbstraction took 172763.11 ms. Allocated memory was 202.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.0 MB in the beginning and 3.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 21:09:37,788 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.24 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 816.42 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 99.9 MB in the beginning and 156.1 MB in the end (delta: -56.2 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.74 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 152.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.87 ms. Allocated memory is still 202.9 MB. Free memory was 152.8 MB in the beginning and 150.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 894.86 ms. Allocated memory is still 202.9 MB. Free memory was 150.8 MB in the beginning and 100.0 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 172763.11 ms. Allocated memory was 202.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.0 MB in the beginning and 3.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 177 ProgramPointsBefore, 98 ProgramPointsAfterwards, 214 TransitionsBefore, 109 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 30 ChoiceCompositions, 5872 VarBasedMoverChecksPositive, 192 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 84314 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L817] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L819] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 2 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L821] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L782] 3 y = 1 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L794] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L733] 1 a = 1 [L736] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=2, y=1, z=1] [L739] 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=2, y=1, z=1] [L795] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L796] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L797] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L740] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L741] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L742] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L828] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L829] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L830] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L831] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 x$flush_delayed = weak$$choice2 [L837] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L838] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L838] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L839] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L839] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L840] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L840] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L841] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L841] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L842] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 172.4s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 49.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3105 SDtfs, 4608 SDslu, 8416 SDs, 0 SdLazy, 4982 SolverSat, 352 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 266 GetRequests, 45 SyntacticMatches, 53 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258307occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 87.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 213840 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 800 NumberOfCodeBlocks, 800 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 714 ConstructedInterpolants, 0 QuantifiedInterpolants, 231871 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...