/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:45:04,874 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:45:04,877 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:45:04,889 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:45:04,889 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:45:04,890 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:45:04,892 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:45:04,897 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:45:04,900 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:45:04,903 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:45:04,905 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:45:04,911 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:45:04,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:45:04,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:45:04,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:45:04,918 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:45:04,918 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:45:04,919 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:45:04,921 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:45:04,923 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:45:04,924 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:45:04,925 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:45:04,926 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:45:04,927 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:45:04,929 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:45:04,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:45:04,930 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:45:04,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:45:04,931 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:45:04,932 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:45:04,932 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:45:04,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:45:04,934 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:45:04,934 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:45:04,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:45:04,936 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:45:04,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:45:04,937 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:45:04,937 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:45:04,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:45:04,938 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:45:04,939 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.epf [2019-12-27 07:45:04,953 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:45:04,954 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:45:04,955 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:45:04,956 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:45:04,956 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:45:04,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:45:04,956 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:45:04,956 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:45:04,957 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:45:04,957 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:45:04,957 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:45:04,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:45:04,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:45:04,958 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:45:04,958 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:45:04,958 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:45:04,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:45:04,959 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:45:04,959 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:45:04,959 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:45:04,959 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:45:04,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:45:04,961 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:45:04,962 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:45:04,962 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:45:04,962 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:45:04,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:45:04,962 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:45:04,962 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:45:04,963 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:45:05,264 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:45:05,285 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:45:05,288 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:45:05,290 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:45:05,290 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:45:05,291 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.opt.i [2019-12-27 07:45:05,363 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2996b15e8/88b387f07dae4a6999f2296fb1415c3f/FLAG1f992c6c9 [2019-12-27 07:45:06,000 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:45:06,002 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.opt.i [2019-12-27 07:45:06,025 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2996b15e8/88b387f07dae4a6999f2296fb1415c3f/FLAG1f992c6c9 [2019-12-27 07:45:06,272 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2996b15e8/88b387f07dae4a6999f2296fb1415c3f [2019-12-27 07:45:06,281 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:45:06,283 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:45:06,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:45:06,285 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:45:06,290 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:45:06,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:45:06" (1/1) ... [2019-12-27 07:45:06,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32a7d1ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:06, skipping insertion in model container [2019-12-27 07:45:06,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:45:06" (1/1) ... [2019-12-27 07:45:06,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:45:06,366 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:45:06,836 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:45:06,849 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:45:06,916 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:45:07,006 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:45:07,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:07 WrapperNode [2019-12-27 07:45:07,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:45:07,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:45:07,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:45:07,008 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:45:07,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:07" (1/1) ... [2019-12-27 07:45:07,044 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:07" (1/1) ... [2019-12-27 07:45:07,085 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:45:07,086 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:45:07,086 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:45:07,086 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:45:07,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:07" (1/1) ... [2019-12-27 07:45:07,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:07" (1/1) ... [2019-12-27 07:45:07,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:07" (1/1) ... [2019-12-27 07:45:07,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:07" (1/1) ... [2019-12-27 07:45:07,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:07" (1/1) ... [2019-12-27 07:45:07,124 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:07" (1/1) ... [2019-12-27 07:45:07,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:07" (1/1) ... [2019-12-27 07:45:07,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:45:07,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:45:07,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:45:07,135 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:45:07,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:07" (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 07:45:07,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:45:07,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:45:07,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:45:07,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:45:07,204 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:45:07,204 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:45:07,205 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:45:07,206 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:45:07,206 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 07:45:07,207 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 07:45:07,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:45:07,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:45:07,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:45:07,209 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 07:45:07,979 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:45:07,980 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:45:07,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:45:07 BoogieIcfgContainer [2019-12-27 07:45:07,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:45:07,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:45:07,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:45:07,986 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:45:07,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:45:06" (1/3) ... [2019-12-27 07:45:07,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c05e4d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:45:07, skipping insertion in model container [2019-12-27 07:45:07,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:07" (2/3) ... [2019-12-27 07:45:07,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c05e4d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:45:07, skipping insertion in model container [2019-12-27 07:45:07,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:45:07" (3/3) ... [2019-12-27 07:45:07,990 INFO L109 eAbstractionObserver]: Analyzing ICFG safe017_power.opt.i [2019-12-27 07:45:08,001 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:45:08,001 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:45:08,014 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:45:08,016 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:45:08,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,058 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,059 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,059 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,059 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,060 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,083 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,084 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,091 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,091 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,101 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,102 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,102 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,105 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,106 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,109 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,109 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,124 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 07:45:08,140 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:45:08,140 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:45:08,140 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:45:08,141 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:45:08,141 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:45:08,141 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:45:08,141 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:45:08,141 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:45:08,158 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 210 transitions [2019-12-27 07:45:08,160 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-27 07:45:08,266 INFO L132 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-27 07:45:08,267 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:45:08,288 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/158 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 07:45:08,317 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-27 07:45:08,409 INFO L132 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-27 07:45:08,409 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:45:08,419 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/158 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 07:45:08,442 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-27 07:45:08,444 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:45:11,803 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 07:45:11,907 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 07:45:11,933 INFO L206 etLargeBlockEncoding]: Checked pairs total: 81965 [2019-12-27 07:45:11,934 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 07:45:11,938 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 107 transitions [2019-12-27 07:45:30,597 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 123932 states. [2019-12-27 07:45:30,599 INFO L276 IsEmpty]: Start isEmpty. Operand 123932 states. [2019-12-27 07:45:30,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 07:45:30,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:45:30,605 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 07:45:30,605 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:45:30,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:45:30,611 INFO L82 PathProgramCache]: Analyzing trace with hash 840548, now seen corresponding path program 1 times [2019-12-27 07:45:30,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:45:30,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293038775] [2019-12-27 07:45:30,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:45:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:45:30,857 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 07:45:30,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293038775] [2019-12-27 07:45:30,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:45:30,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:45:30,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039072325] [2019-12-27 07:45:30,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:45:30,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:45:30,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:45:30,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:45:30,885 INFO L87 Difference]: Start difference. First operand 123932 states. Second operand 3 states. [2019-12-27 07:45:34,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:45:34,732 INFO L93 Difference]: Finished difference Result 123232 states and 527355 transitions. [2019-12-27 07:45:34,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:45:34,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 07:45:34,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:45:35,590 INFO L225 Difference]: With dead ends: 123232 [2019-12-27 07:45:35,590 INFO L226 Difference]: Without dead ends: 120684 [2019-12-27 07:45:35,595 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 07:45:41,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120684 states. [2019-12-27 07:45:44,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120684 to 120684. [2019-12-27 07:45:44,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120684 states. [2019-12-27 07:45:48,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120684 states to 120684 states and 516967 transitions. [2019-12-27 07:45:48,800 INFO L78 Accepts]: Start accepts. Automaton has 120684 states and 516967 transitions. Word has length 3 [2019-12-27 07:45:48,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:45:48,801 INFO L462 AbstractCegarLoop]: Abstraction has 120684 states and 516967 transitions. [2019-12-27 07:45:48,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:45:48,801 INFO L276 IsEmpty]: Start isEmpty. Operand 120684 states and 516967 transitions. [2019-12-27 07:45:48,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:45:48,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:45:48,806 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:45:48,806 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:45:48,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:45:48,807 INFO L82 PathProgramCache]: Analyzing trace with hash -693264508, now seen corresponding path program 1 times [2019-12-27 07:45:48,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:45:48,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306125686] [2019-12-27 07:45:48,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:45:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:45:48,930 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 07:45:48,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306125686] [2019-12-27 07:45:48,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:45:48,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:45:48,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097153886] [2019-12-27 07:45:48,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:45:48,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:45:48,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:45:48,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:45:48,934 INFO L87 Difference]: Start difference. First operand 120684 states and 516967 transitions. Second operand 4 states. [2019-12-27 07:45:50,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:45:50,157 INFO L93 Difference]: Finished difference Result 188314 states and 770960 transitions. [2019-12-27 07:45:50,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:45:50,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:45:50,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:45:55,955 INFO L225 Difference]: With dead ends: 188314 [2019-12-27 07:45:55,955 INFO L226 Difference]: Without dead ends: 188265 [2019-12-27 07:45:55,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:46:00,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188265 states. [2019-12-27 07:46:03,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188265 to 173329. [2019-12-27 07:46:03,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173329 states. [2019-12-27 07:46:05,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173329 states to 173329 states and 717928 transitions. [2019-12-27 07:46:05,168 INFO L78 Accepts]: Start accepts. Automaton has 173329 states and 717928 transitions. Word has length 11 [2019-12-27 07:46:05,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:05,168 INFO L462 AbstractCegarLoop]: Abstraction has 173329 states and 717928 transitions. [2019-12-27 07:46:05,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:46:05,168 INFO L276 IsEmpty]: Start isEmpty. Operand 173329 states and 717928 transitions. [2019-12-27 07:46:05,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:46:05,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:05,177 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:05,178 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:05,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:05,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1884384651, now seen corresponding path program 1 times [2019-12-27 07:46:05,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:05,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384606429] [2019-12-27 07:46:05,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:05,294 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 07:46:05,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384606429] [2019-12-27 07:46:05,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:05,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:46:05,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623538342] [2019-12-27 07:46:05,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:46:05,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:05,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:46:05,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:46:05,298 INFO L87 Difference]: Start difference. First operand 173329 states and 717928 transitions. Second operand 3 states. [2019-12-27 07:46:05,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:05,455 INFO L93 Difference]: Finished difference Result 34664 states and 112616 transitions. [2019-12-27 07:46:05,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:46:05,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 07:46:05,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:05,508 INFO L225 Difference]: With dead ends: 34664 [2019-12-27 07:46:05,508 INFO L226 Difference]: Without dead ends: 34664 [2019-12-27 07:46:05,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:46:05,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34664 states. [2019-12-27 07:46:06,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34664 to 34664. [2019-12-27 07:46:06,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34664 states. [2019-12-27 07:46:06,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34664 states to 34664 states and 112616 transitions. [2019-12-27 07:46:06,186 INFO L78 Accepts]: Start accepts. Automaton has 34664 states and 112616 transitions. Word has length 13 [2019-12-27 07:46:06,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:06,186 INFO L462 AbstractCegarLoop]: Abstraction has 34664 states and 112616 transitions. [2019-12-27 07:46:06,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:46:06,186 INFO L276 IsEmpty]: Start isEmpty. Operand 34664 states and 112616 transitions. [2019-12-27 07:46:06,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:46:06,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:06,188 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:06,188 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:06,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:06,188 INFO L82 PathProgramCache]: Analyzing trace with hash -2074529167, now seen corresponding path program 1 times [2019-12-27 07:46:06,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:06,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319083005] [2019-12-27 07:46:06,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:06,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:46:06,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319083005] [2019-12-27 07:46:06,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:06,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:46:06,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381452572] [2019-12-27 07:46:06,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:46:06,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:06,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:46:06,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:46:06,286 INFO L87 Difference]: Start difference. First operand 34664 states and 112616 transitions. Second operand 4 states. [2019-12-27 07:46:07,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:07,225 INFO L93 Difference]: Finished difference Result 46077 states and 146183 transitions. [2019-12-27 07:46:07,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:46:07,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 07:46:07,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:07,291 INFO L225 Difference]: With dead ends: 46077 [2019-12-27 07:46:07,291 INFO L226 Difference]: Without dead ends: 46070 [2019-12-27 07:46:07,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:46:07,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46070 states. [2019-12-27 07:46:07,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46070 to 40619. [2019-12-27 07:46:07,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40619 states. [2019-12-27 07:46:08,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40619 states to 40619 states and 130997 transitions. [2019-12-27 07:46:08,053 INFO L78 Accepts]: Start accepts. Automaton has 40619 states and 130997 transitions. Word has length 13 [2019-12-27 07:46:08,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:08,053 INFO L462 AbstractCegarLoop]: Abstraction has 40619 states and 130997 transitions. [2019-12-27 07:46:08,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:46:08,053 INFO L276 IsEmpty]: Start isEmpty. Operand 40619 states and 130997 transitions. [2019-12-27 07:46:08,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 07:46:08,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:08,057 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 07:46:08,057 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:08,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:08,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1372726712, now seen corresponding path program 1 times [2019-12-27 07:46:08,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:08,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917300258] [2019-12-27 07:46:08,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:08,140 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 07:46:08,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917300258] [2019-12-27 07:46:08,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:08,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:46:08,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398034123] [2019-12-27 07:46:08,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:46:08,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:08,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:46:08,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:46:08,143 INFO L87 Difference]: Start difference. First operand 40619 states and 130997 transitions. Second operand 5 states. [2019-12-27 07:46:08,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:08,925 INFO L93 Difference]: Finished difference Result 54297 states and 171188 transitions. [2019-12-27 07:46:08,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:46:08,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 07:46:08,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:09,013 INFO L225 Difference]: With dead ends: 54297 [2019-12-27 07:46:09,014 INFO L226 Difference]: Without dead ends: 54284 [2019-12-27 07:46:09,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:46:09,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54284 states. [2019-12-27 07:46:10,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54284 to 40933. [2019-12-27 07:46:10,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40933 states. [2019-12-27 07:46:10,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40933 states to 40933 states and 131862 transitions. [2019-12-27 07:46:10,278 INFO L78 Accepts]: Start accepts. Automaton has 40933 states and 131862 transitions. Word has length 19 [2019-12-27 07:46:10,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:10,278 INFO L462 AbstractCegarLoop]: Abstraction has 40933 states and 131862 transitions. [2019-12-27 07:46:10,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:46:10,279 INFO L276 IsEmpty]: Start isEmpty. Operand 40933 states and 131862 transitions. [2019-12-27 07:46:10,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:46:10,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:10,292 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 07:46:10,292 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:10,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:10,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1682135623, now seen corresponding path program 1 times [2019-12-27 07:46:10,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:10,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123557346] [2019-12-27 07:46:10,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:10,363 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 07:46:10,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123557346] [2019-12-27 07:46:10,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:10,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:46:10,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535480878] [2019-12-27 07:46:10,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:46:10,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:10,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:46:10,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:46:10,365 INFO L87 Difference]: Start difference. First operand 40933 states and 131862 transitions. Second operand 4 states. [2019-12-27 07:46:10,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:10,417 INFO L93 Difference]: Finished difference Result 7502 states and 20469 transitions. [2019-12-27 07:46:10,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:46:10,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 07:46:10,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:10,431 INFO L225 Difference]: With dead ends: 7502 [2019-12-27 07:46:10,431 INFO L226 Difference]: Without dead ends: 7502 [2019-12-27 07:46:10,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:46:10,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7502 states. [2019-12-27 07:46:10,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7502 to 7390. [2019-12-27 07:46:10,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7390 states. [2019-12-27 07:46:10,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7390 states to 7390 states and 20149 transitions. [2019-12-27 07:46:10,529 INFO L78 Accepts]: Start accepts. Automaton has 7390 states and 20149 transitions. Word has length 25 [2019-12-27 07:46:10,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:10,530 INFO L462 AbstractCegarLoop]: Abstraction has 7390 states and 20149 transitions. [2019-12-27 07:46:10,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:46:10,530 INFO L276 IsEmpty]: Start isEmpty. Operand 7390 states and 20149 transitions. [2019-12-27 07:46:10,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 07:46:10,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:10,541 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 07:46:10,541 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:10,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:10,542 INFO L82 PathProgramCache]: Analyzing trace with hash -2147477439, now seen corresponding path program 1 times [2019-12-27 07:46:10,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:10,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591723641] [2019-12-27 07:46:10,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:10,621 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 07:46:10,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591723641] [2019-12-27 07:46:10,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:10,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:46:10,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831246783] [2019-12-27 07:46:10,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:46:10,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:10,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:46:10,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:46:10,624 INFO L87 Difference]: Start difference. First operand 7390 states and 20149 transitions. Second operand 5 states. [2019-12-27 07:46:10,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:10,656 INFO L93 Difference]: Finished difference Result 5312 states and 15267 transitions. [2019-12-27 07:46:10,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:46:10,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 07:46:10,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:10,666 INFO L225 Difference]: With dead ends: 5312 [2019-12-27 07:46:10,666 INFO L226 Difference]: Without dead ends: 5312 [2019-12-27 07:46:10,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:46:10,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2019-12-27 07:46:10,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 4948. [2019-12-27 07:46:10,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4948 states. [2019-12-27 07:46:10,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4948 states to 4948 states and 14283 transitions. [2019-12-27 07:46:10,762 INFO L78 Accepts]: Start accepts. Automaton has 4948 states and 14283 transitions. Word has length 37 [2019-12-27 07:46:10,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:10,763 INFO L462 AbstractCegarLoop]: Abstraction has 4948 states and 14283 transitions. [2019-12-27 07:46:10,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:46:10,763 INFO L276 IsEmpty]: Start isEmpty. Operand 4948 states and 14283 transitions. [2019-12-27 07:46:10,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:46:10,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:10,770 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 07:46:10,771 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:10,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:10,771 INFO L82 PathProgramCache]: Analyzing trace with hash -314622142, now seen corresponding path program 1 times [2019-12-27 07:46:10,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:10,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679702240] [2019-12-27 07:46:10,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:10,851 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 07:46:10,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679702240] [2019-12-27 07:46:10,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:10,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:46:10,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120850399] [2019-12-27 07:46:10,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:46:10,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:10,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:46:10,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:46:10,855 INFO L87 Difference]: Start difference. First operand 4948 states and 14283 transitions. Second operand 3 states. [2019-12-27 07:46:10,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:10,915 INFO L93 Difference]: Finished difference Result 4959 states and 14299 transitions. [2019-12-27 07:46:10,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:46:10,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:46:10,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:10,924 INFO L225 Difference]: With dead ends: 4959 [2019-12-27 07:46:10,924 INFO L226 Difference]: Without dead ends: 4959 [2019-12-27 07:46:10,924 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 07:46:10,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4959 states. [2019-12-27 07:46:10,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4959 to 4955. [2019-12-27 07:46:10,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4955 states. [2019-12-27 07:46:10,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4955 states to 4955 states and 14295 transitions. [2019-12-27 07:46:10,990 INFO L78 Accepts]: Start accepts. Automaton has 4955 states and 14295 transitions. Word has length 65 [2019-12-27 07:46:10,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:10,992 INFO L462 AbstractCegarLoop]: Abstraction has 4955 states and 14295 transitions. [2019-12-27 07:46:10,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:46:10,992 INFO L276 IsEmpty]: Start isEmpty. Operand 4955 states and 14295 transitions. [2019-12-27 07:46:10,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:46:11,000 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:11,000 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 07:46:11,000 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:11,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:11,000 INFO L82 PathProgramCache]: Analyzing trace with hash 143495123, now seen corresponding path program 1 times [2019-12-27 07:46:11,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:11,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427925978] [2019-12-27 07:46:11,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:11,120 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 07:46:11,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427925978] [2019-12-27 07:46:11,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:11,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:46:11,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747617508] [2019-12-27 07:46:11,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:46:11,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:11,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:46:11,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:46:11,123 INFO L87 Difference]: Start difference. First operand 4955 states and 14295 transitions. Second operand 5 states. [2019-12-27 07:46:11,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:11,437 INFO L93 Difference]: Finished difference Result 7546 states and 21560 transitions. [2019-12-27 07:46:11,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:46:11,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 07:46:11,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:11,450 INFO L225 Difference]: With dead ends: 7546 [2019-12-27 07:46:11,450 INFO L226 Difference]: Without dead ends: 7546 [2019-12-27 07:46:11,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:46:11,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7546 states. [2019-12-27 07:46:11,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7546 to 6352. [2019-12-27 07:46:11,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6352 states. [2019-12-27 07:46:11,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6352 states to 6352 states and 18330 transitions. [2019-12-27 07:46:11,567 INFO L78 Accepts]: Start accepts. Automaton has 6352 states and 18330 transitions. Word has length 65 [2019-12-27 07:46:11,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:11,567 INFO L462 AbstractCegarLoop]: Abstraction has 6352 states and 18330 transitions. [2019-12-27 07:46:11,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:46:11,567 INFO L276 IsEmpty]: Start isEmpty. Operand 6352 states and 18330 transitions. [2019-12-27 07:46:11,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:46:11,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:11,576 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 07:46:11,576 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:11,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:11,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1279878861, now seen corresponding path program 2 times [2019-12-27 07:46:11,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:11,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004714934] [2019-12-27 07:46:11,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:11,683 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 07:46:11,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004714934] [2019-12-27 07:46:11,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:11,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:46:11,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184100097] [2019-12-27 07:46:11,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:46:11,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:11,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:46:11,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:46:11,685 INFO L87 Difference]: Start difference. First operand 6352 states and 18330 transitions. Second operand 6 states. [2019-12-27 07:46:12,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:12,196 INFO L93 Difference]: Finished difference Result 10887 states and 31211 transitions. [2019-12-27 07:46:12,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:46:12,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 07:46:12,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:12,213 INFO L225 Difference]: With dead ends: 10887 [2019-12-27 07:46:12,213 INFO L226 Difference]: Without dead ends: 10887 [2019-12-27 07:46:12,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:46:12,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10887 states. [2019-12-27 07:46:12,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10887 to 7014. [2019-12-27 07:46:12,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7014 states. [2019-12-27 07:46:12,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7014 states to 7014 states and 20308 transitions. [2019-12-27 07:46:12,558 INFO L78 Accepts]: Start accepts. Automaton has 7014 states and 20308 transitions. Word has length 65 [2019-12-27 07:46:12,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:12,558 INFO L462 AbstractCegarLoop]: Abstraction has 7014 states and 20308 transitions. [2019-12-27 07:46:12,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:46:12,558 INFO L276 IsEmpty]: Start isEmpty. Operand 7014 states and 20308 transitions. [2019-12-27 07:46:12,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:46:12,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:12,569 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 07:46:12,569 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:12,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:12,570 INFO L82 PathProgramCache]: Analyzing trace with hash -817749225, now seen corresponding path program 3 times [2019-12-27 07:46:12,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:12,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596872509] [2019-12-27 07:46:12,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:12,729 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 07:46:12,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596872509] [2019-12-27 07:46:12,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:12,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:46:12,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718335149] [2019-12-27 07:46:12,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:46:12,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:12,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:46:12,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:46:12,732 INFO L87 Difference]: Start difference. First operand 7014 states and 20308 transitions. Second operand 3 states. [2019-12-27 07:46:12,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:12,802 INFO L93 Difference]: Finished difference Result 7014 states and 20307 transitions. [2019-12-27 07:46:12,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:46:12,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:46:12,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:12,814 INFO L225 Difference]: With dead ends: 7014 [2019-12-27 07:46:12,815 INFO L226 Difference]: Without dead ends: 7014 [2019-12-27 07:46:12,815 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 07:46:12,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7014 states. [2019-12-27 07:46:12,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7014 to 4684. [2019-12-27 07:46:12,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4684 states. [2019-12-27 07:46:12,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4684 states to 4684 states and 13831 transitions. [2019-12-27 07:46:12,928 INFO L78 Accepts]: Start accepts. Automaton has 4684 states and 13831 transitions. Word has length 65 [2019-12-27 07:46:12,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:12,930 INFO L462 AbstractCegarLoop]: Abstraction has 4684 states and 13831 transitions. [2019-12-27 07:46:12,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:46:12,930 INFO L276 IsEmpty]: Start isEmpty. Operand 4684 states and 13831 transitions. [2019-12-27 07:46:12,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:46:12,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:12,939 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 07:46:12,940 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:12,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:12,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1536074806, now seen corresponding path program 1 times [2019-12-27 07:46:12,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:12,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146685930] [2019-12-27 07:46:12,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:13,025 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 07:46:13,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146685930] [2019-12-27 07:46:13,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:13,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:46:13,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541214121] [2019-12-27 07:46:13,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:46:13,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:13,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:46:13,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:46:13,027 INFO L87 Difference]: Start difference. First operand 4684 states and 13831 transitions. Second operand 3 states. [2019-12-27 07:46:13,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:13,056 INFO L93 Difference]: Finished difference Result 4188 states and 12063 transitions. [2019-12-27 07:46:13,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:46:13,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 07:46:13,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:13,063 INFO L225 Difference]: With dead ends: 4188 [2019-12-27 07:46:13,064 INFO L226 Difference]: Without dead ends: 4188 [2019-12-27 07:46:13,064 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 07:46:13,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4188 states. [2019-12-27 07:46:13,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4188 to 3864. [2019-12-27 07:46:13,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3864 states. [2019-12-27 07:46:13,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3864 states to 3864 states and 11147 transitions. [2019-12-27 07:46:13,156 INFO L78 Accepts]: Start accepts. Automaton has 3864 states and 11147 transitions. Word has length 66 [2019-12-27 07:46:13,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:13,156 INFO L462 AbstractCegarLoop]: Abstraction has 3864 states and 11147 transitions. [2019-12-27 07:46:13,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:46:13,157 INFO L276 IsEmpty]: Start isEmpty. Operand 3864 states and 11147 transitions. [2019-12-27 07:46:13,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:46:13,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:13,165 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 07:46:13,165 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:13,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:13,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1372470305, now seen corresponding path program 1 times [2019-12-27 07:46:13,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:13,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045567028] [2019-12-27 07:46:13,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:13,323 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 07:46:13,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045567028] [2019-12-27 07:46:13,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:13,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:46:13,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605003796] [2019-12-27 07:46:13,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:46:13,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:13,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:46:13,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:46:13,325 INFO L87 Difference]: Start difference. First operand 3864 states and 11147 transitions. Second operand 3 states. [2019-12-27 07:46:13,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:13,352 INFO L93 Difference]: Finished difference Result 3692 states and 10434 transitions. [2019-12-27 07:46:13,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:46:13,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 07:46:13,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:13,359 INFO L225 Difference]: With dead ends: 3692 [2019-12-27 07:46:13,359 INFO L226 Difference]: Without dead ends: 3692 [2019-12-27 07:46:13,364 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 07:46:13,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3692 states. [2019-12-27 07:46:13,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3692 to 2990. [2019-12-27 07:46:13,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2990 states. [2019-12-27 07:46:13,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 8464 transitions. [2019-12-27 07:46:13,430 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 8464 transitions. Word has length 67 [2019-12-27 07:46:13,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:13,430 INFO L462 AbstractCegarLoop]: Abstraction has 2990 states and 8464 transitions. [2019-12-27 07:46:13,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:46:13,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 8464 transitions. [2019-12-27 07:46:13,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 07:46:13,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:13,436 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 07:46:13,436 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:13,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:13,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1708175791, now seen corresponding path program 1 times [2019-12-27 07:46:13,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:13,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855864556] [2019-12-27 07:46:13,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:13,694 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 07:46:13,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855864556] [2019-12-27 07:46:13,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:13,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 07:46:13,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047120135] [2019-12-27 07:46:13,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 07:46:13,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:13,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 07:46:13,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:46:13,697 INFO L87 Difference]: Start difference. First operand 2990 states and 8464 transitions. Second operand 13 states. [2019-12-27 07:46:14,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:14,194 INFO L93 Difference]: Finished difference Result 5799 states and 16480 transitions. [2019-12-27 07:46:14,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 07:46:14,194 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-27 07:46:14,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:14,203 INFO L225 Difference]: With dead ends: 5799 [2019-12-27 07:46:14,203 INFO L226 Difference]: Without dead ends: 5766 [2019-12-27 07:46:14,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2019-12-27 07:46:14,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5766 states. [2019-12-27 07:46:14,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5766 to 4145. [2019-12-27 07:46:14,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4145 states. [2019-12-27 07:46:14,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4145 states to 4145 states and 11627 transitions. [2019-12-27 07:46:14,272 INFO L78 Accepts]: Start accepts. Automaton has 4145 states and 11627 transitions. Word has length 68 [2019-12-27 07:46:14,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:14,273 INFO L462 AbstractCegarLoop]: Abstraction has 4145 states and 11627 transitions. [2019-12-27 07:46:14,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 07:46:14,273 INFO L276 IsEmpty]: Start isEmpty. Operand 4145 states and 11627 transitions. [2019-12-27 07:46:14,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 07:46:14,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:14,278 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:14,278 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:14,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:14,279 INFO L82 PathProgramCache]: Analyzing trace with hash 947098105, now seen corresponding path program 2 times [2019-12-27 07:46:14,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:14,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462502420] [2019-12-27 07:46:14,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:46:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:46:14,415 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:46:14,415 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:46:14,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~y$r_buff0_thd3~0_18 0) (= 0 v_~y$w_buff1~0_28) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$r_buff1_thd3~0_17) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff0_used~0_123 0) (= 0 v_~y$r_buff1_thd0~0_49) (= 0 v_~__unbuffered_cnt~0_20) (= v_~y$r_buff0_thd2~0_20 0) (= v_~y$read_delayed~0_7 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2180~0.base_27|)) (= v_~y$w_buff1_used~0_75 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2180~0.base_27|) (= v_~y~0_30 0) (= v_~x~0_13 0) (= 0 |v_ULTIMATE.start_main_~#t2180~0.offset_20|) (= (store .cse0 |v_ULTIMATE.start_main_~#t2180~0.base_27| 1) |v_#valid_63|) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2180~0.base_27| 4)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2180~0.base_27| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2180~0.base_27|) |v_ULTIMATE.start_main_~#t2180~0.offset_20| 0)) |v_#memory_int_21|) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff0_thd1~0_26 0) (= v_~main$tmp_guard0~0_6 0) (= v_~y$mem_tmp~0_11 0) (= 0 v_~weak$$choice2~0_33) (= 0 v_~y$r_buff1_thd1~0_18) (= v_~y$r_buff0_thd0~0_83 0) (= 0 v_~y$w_buff0~0_30) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$r_buff1_thd2~0_17) (= |v_#NULL.offset_5| 0) (= v_~__unbuffered_p2_EAX~0_9 0) (= v_~main$tmp_guard1~0_12 0) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_9|, ULTIMATE.start_main_~#t2182~0.base=|v_ULTIMATE.start_main_~#t2182~0.base_19|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_11|, 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_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_14|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_16|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_26, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ULTIMATE.start_main_~#t2180~0.offset=|v_ULTIMATE.start_main_~#t2180~0.offset_20|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_~#t2181~0.base=|v_ULTIMATE.start_main_~#t2181~0.base_23|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~y$w_buff1~0=v_~y$w_buff1~0_28, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_49, ~x~0=v_~x~0_13, ULTIMATE.start_main_~#t2182~0.offset=|v_ULTIMATE.start_main_~#t2182~0.offset_16|, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_123, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_13|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_15|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ULTIMATE.start_main_~#t2181~0.offset=|v_ULTIMATE.start_main_~#t2181~0.offset_18|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_18, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_13|, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ULTIMATE.start_main_~#t2180~0.base=|v_ULTIMATE.start_main_~#t2180~0.base_27|, ~y~0=v_~y~0_30, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_83, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_75} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_~#t2182~0.base, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2180~0.offset, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t2181~0.base, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t2182~0.offset, ULTIMATE.start_main_#t~nondet31, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2181~0.offset, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t2180~0.base, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 07:46:14,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L800-1-->L802: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2181~0.offset_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2181~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2181~0.base_11|) |v_ULTIMATE.start_main_~#t2181~0.offset_10| 1)) |v_#memory_int_11|) (not (= |v_ULTIMATE.start_main_~#t2181~0.base_11| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2181~0.base_11| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2181~0.base_11|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t2181~0.base_11|)) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t2181~0.base_11| 1) |v_#valid_37|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2181~0.base=|v_ULTIMATE.start_main_~#t2181~0.base_11|, ULTIMATE.start_main_~#t2181~0.offset=|v_ULTIMATE.start_main_~#t2181~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2181~0.base, ULTIMATE.start_main_~#t2181~0.offset] because there is no mapped edge [2019-12-27 07:46:14,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P0ENTRY-->L4-3: Formula: (and (= 1 v_~y$w_buff0_used~0_85) (= 2 v_~y$w_buff0~0_16) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff1_used~0_48 v_~y$w_buff0_used~0_86) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0~0_17 v_~y$w_buff1~0_13) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= 0 (mod v_~y$w_buff1_used~0_48 256)) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_17, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_85, ~y$w_buff1~0=v_~y$w_buff1~0_13, ~y$w_buff0~0=v_~y$w_buff0~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_48} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 07:46:14,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L802-1-->L804: Formula: (and (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2182~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t2182~0.offset_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2182~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2182~0.base_13|) |v_ULTIMATE.start_main_~#t2182~0.offset_11| 2)) |v_#memory_int_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2182~0.base_13| 4) |v_#length_17|) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2182~0.base_13|) 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2182~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2182~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2182~0.base=|v_ULTIMATE.start_main_~#t2182~0.base_13|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2182~0.offset=|v_ULTIMATE.start_main_~#t2182~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2182~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2182~0.offset] because there is no mapped edge [2019-12-27 07:46:14,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L741-->L741-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In863777432 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In863777432 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out863777432| ~y$w_buff0_used~0_In863777432) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out863777432|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In863777432, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In863777432} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out863777432|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In863777432, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In863777432} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 07:46:14,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L757-2-->L757-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In765025418 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In765025418 256) 0))) (or (and (= ~y$w_buff1~0_In765025418 |P1Thread1of1ForFork1_#t~ite9_Out765025418|) (not .cse0) (not .cse1)) (and (= ~y~0_In765025418 |P1Thread1of1ForFork1_#t~ite9_Out765025418|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In765025418, ~y$w_buff1~0=~y$w_buff1~0_In765025418, ~y~0=~y~0_In765025418, ~y$w_buff1_used~0=~y$w_buff1_used~0_In765025418} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In765025418, ~y$w_buff1~0=~y$w_buff1~0_In765025418, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out765025418|, ~y~0=~y~0_In765025418, ~y$w_buff1_used~0=~y$w_buff1_used~0_In765025418} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 07:46:14,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L742-->L742-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-847144324 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In-847144324 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-847144324 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-847144324 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-847144324 |P0Thread1of1ForFork0_#t~ite6_Out-847144324|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-847144324|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-847144324, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-847144324, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-847144324, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-847144324} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-847144324|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-847144324, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-847144324, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-847144324, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-847144324} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 07:46:14,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L743-->L744: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In765515901 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In765515901 256)))) (or (and (= 0 ~y$r_buff0_thd1~0_Out765515901) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd1~0_Out765515901 ~y$r_buff0_thd1~0_In765515901) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In765515901, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In765515901} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In765515901, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out765515901|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out765515901} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 07:46:14,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L744-->L744-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-2021683046 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-2021683046 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2021683046 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-2021683046 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-2021683046|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In-2021683046 |P0Thread1of1ForFork0_#t~ite8_Out-2021683046|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2021683046, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2021683046, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2021683046, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2021683046} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2021683046, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2021683046, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-2021683046|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2021683046, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2021683046} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 07:46:14,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L744-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_14, 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_11} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 07:46:14,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L777-2-->L777-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In578524441 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd3~0_In578524441 256) 0))) (or (and (= ~y$w_buff1~0_In578524441 |P2Thread1of1ForFork2_#t~ite15_Out578524441|) (not .cse0) (not .cse1)) (and (= ~y~0_In578524441 |P2Thread1of1ForFork2_#t~ite15_Out578524441|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In578524441, ~y$w_buff1~0=~y$w_buff1~0_In578524441, ~y~0=~y~0_In578524441, ~y$w_buff1_used~0=~y$w_buff1_used~0_In578524441} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In578524441, P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out578524441|, ~y$w_buff1~0=~y$w_buff1~0_In578524441, ~y~0=~y~0_In578524441, ~y$w_buff1_used~0=~y$w_buff1_used~0_In578524441} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 07:46:14,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-4-->L778: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~y~0_20) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~y~0=v_~y~0_20, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~y~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 07:46:14,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L757-4-->L758: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~y~0_21) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-27 07:46:14,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L758-->L758-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1825622599 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1825622599 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out1825622599| 0)) (and (= ~y$w_buff0_used~0_In1825622599 |P1Thread1of1ForFork1_#t~ite11_Out1825622599|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1825622599, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1825622599} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1825622599, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1825622599, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1825622599|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 07:46:14,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L759-->L759-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In800430150 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In800430150 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In800430150 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In800430150 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite12_Out800430150| ~y$w_buff1_used~0_In800430150)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite12_Out800430150| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In800430150, ~y$w_buff0_used~0=~y$w_buff0_used~0_In800430150, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In800430150, ~y$w_buff1_used~0=~y$w_buff1_used~0_In800430150} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In800430150, ~y$w_buff0_used~0=~y$w_buff0_used~0_In800430150, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In800430150, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out800430150|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In800430150} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 07:46:14,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1209729860 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1209729860 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out-1209729860| ~y$r_buff0_thd2~0_In-1209729860) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-1209729860|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1209729860, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1209729860} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1209729860, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1209729860, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1209729860|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 07:46:14,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L761-->L761-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1074102179 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-1074102179 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1074102179 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1074102179 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-1074102179 |P1Thread1of1ForFork1_#t~ite14_Out-1074102179|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite14_Out-1074102179| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1074102179, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1074102179, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1074102179, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1074102179} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1074102179, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1074102179, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1074102179, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1074102179|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1074102179} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 07:46:14,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L761-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 07:46:14,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1890438818 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1890438818 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-1890438818|)) (and (= ~y$w_buff0_used~0_In-1890438818 |P2Thread1of1ForFork2_#t~ite17_Out-1890438818|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1890438818, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1890438818} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1890438818, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1890438818, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-1890438818|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 07:46:14,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1614539168 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1614539168 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1614539168 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In1614539168 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite18_Out1614539168|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In1614539168 |P2Thread1of1ForFork2_#t~ite18_Out1614539168|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1614539168, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1614539168, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1614539168, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1614539168} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1614539168, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1614539168, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1614539168, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out1614539168|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1614539168} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 07:46:14,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1211804607 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1211804607 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite19_Out1211804607| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out1211804607| ~y$r_buff0_thd3~0_In1211804607)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1211804607, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1211804607} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1211804607, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1211804607, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out1211804607|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 07:46:14,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L781-->L781-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1974482806 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd3~0_In1974482806 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd3~0_In1974482806 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1974482806 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out1974482806| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite20_Out1974482806| ~y$r_buff1_thd3~0_In1974482806) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1974482806, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1974482806, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1974482806, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1974482806} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1974482806, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1974482806, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1974482806|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1974482806, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1974482806} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 07:46:14,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L781-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_~y$r_buff1_thd3~0_12)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, 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[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 07:46:14,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L804-1-->L810: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 07:46:14,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L810-2-->L810-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite25_Out-1316131501| |ULTIMATE.start_main_#t~ite24_Out-1316131501|)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1316131501 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1316131501 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite24_Out-1316131501| ~y$w_buff1~0_In-1316131501) (not .cse1) (not .cse2)) (and .cse0 (= ~y~0_In-1316131501 |ULTIMATE.start_main_#t~ite24_Out-1316131501|) (or .cse2 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1316131501, ~y~0=~y~0_In-1316131501, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1316131501, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1316131501} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1316131501, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1316131501|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1316131501|, ~y~0=~y~0_In-1316131501, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1316131501, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1316131501} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 07:46:14,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2141597326 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-2141597326 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite26_Out-2141597326| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-2141597326 |ULTIMATE.start_main_#t~ite26_Out-2141597326|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2141597326, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2141597326} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2141597326, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2141597326, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-2141597326|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 07:46:14,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L812-->L812-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-753679617 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-753679617 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-753679617 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-753679617 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-753679617 |ULTIMATE.start_main_#t~ite27_Out-753679617|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite27_Out-753679617|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-753679617, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-753679617, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-753679617, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-753679617} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-753679617, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-753679617, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-753679617|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-753679617, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-753679617} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 07:46:14,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In2127547558 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In2127547558 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite28_Out2127547558|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In2127547558 |ULTIMATE.start_main_#t~ite28_Out2127547558|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2127547558, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2127547558} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out2127547558|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2127547558, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2127547558} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 07:46:14,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L814-->L814-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1047688612 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1047688612 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1047688612 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1047688612 256)))) (or (and (= ~y$r_buff1_thd0~0_In1047688612 |ULTIMATE.start_main_#t~ite29_Out1047688612|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite29_Out1047688612|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1047688612, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1047688612, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1047688612, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1047688612} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1047688612, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1047688612|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1047688612, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1047688612, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1047688612} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 07:46:14,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L823-->L823-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1343356893 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In-1343356893 |ULTIMATE.start_main_#t~ite39_Out-1343356893|) (= |ULTIMATE.start_main_#t~ite38_In-1343356893| |ULTIMATE.start_main_#t~ite38_Out-1343356893|)) (and .cse0 (= |ULTIMATE.start_main_#t~ite38_Out-1343356893| |ULTIMATE.start_main_#t~ite39_Out-1343356893|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1343356893 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1343356893 256))) (= (mod ~y$w_buff0_used~0_In-1343356893 256) 0) (and (= (mod ~y$w_buff1_used~0_In-1343356893 256) 0) .cse1))) (= |ULTIMATE.start_main_#t~ite38_Out-1343356893| ~y$w_buff1~0_In-1343356893)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1343356893, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1343356893, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1343356893, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-1343356893|, ~weak$$choice2~0=~weak$$choice2~0_In-1343356893, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1343356893, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1343356893} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1343356893, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1343356893, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1343356893|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1343356893, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1343356893|, ~weak$$choice2~0=~weak$$choice2~0_In-1343356893, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1343356893, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1343356893} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 07:46:14,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L824-->L824-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-17583096 256)))) (or (and (= ~y$w_buff0_used~0_In-17583096 |ULTIMATE.start_main_#t~ite42_Out-17583096|) (not .cse0) (= |ULTIMATE.start_main_#t~ite41_In-17583096| |ULTIMATE.start_main_#t~ite41_Out-17583096|)) (and (= ~y$w_buff0_used~0_In-17583096 |ULTIMATE.start_main_#t~ite41_Out-17583096|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-17583096 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-17583096 256)) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-17583096 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-17583096 256))))) (= |ULTIMATE.start_main_#t~ite42_Out-17583096| |ULTIMATE.start_main_#t~ite41_Out-17583096|) .cse0))) InVars {ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_In-17583096|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-17583096, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-17583096, ~weak$$choice2~0=~weak$$choice2~0_In-17583096, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-17583096, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-17583096} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-17583096|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-17583096, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-17583096, ~weak$$choice2~0=~weak$$choice2~0_In-17583096, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-17583096|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-17583096, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-17583096} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 07:46:14,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L826-->L827: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~y$r_buff0_thd0~0_65 v_~y$r_buff0_thd0~0_64)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_9|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[~y$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 07:46:14,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L829-->L832-1: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= v_~y~0_25 v_~y$mem_tmp~0_7) (not (= 0 (mod v_~y$flush_delayed~0_11 256))) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:46:14,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 07:46:14,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:46:14 BasicIcfg [2019-12-27 07:46:14,524 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:46:14,527 INFO L168 Benchmark]: Toolchain (without parser) took 68243.13 ms. Allocated memory was 145.8 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 101.8 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 07:46:14,527 INFO L168 Benchmark]: CDTParser took 0.72 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 07:46:14,528 INFO L168 Benchmark]: CACSL2BoogieTranslator took 722.80 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.4 MB in the beginning and 154.2 MB in the end (delta: -52.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:46:14,529 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.66 ms. Allocated memory is still 202.9 MB. Free memory was 154.2 MB in the beginning and 151.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:46:14,529 INFO L168 Benchmark]: Boogie Preprocessor took 48.88 ms. Allocated memory is still 202.9 MB. Free memory was 151.5 MB in the beginning and 148.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:46:14,530 INFO L168 Benchmark]: RCFGBuilder took 846.63 ms. Allocated memory is still 202.9 MB. Free memory was 148.9 MB in the beginning and 99.4 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-12-27 07:46:14,531 INFO L168 Benchmark]: TraceAbstraction took 66541.48 ms. Allocated memory was 202.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 98.7 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 07:46:14,536 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.72 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 722.80 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.4 MB in the beginning and 154.2 MB in the end (delta: -52.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.66 ms. Allocated memory is still 202.9 MB. Free memory was 154.2 MB in the beginning and 151.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.88 ms. Allocated memory is still 202.9 MB. Free memory was 151.5 MB in the beginning and 148.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 846.63 ms. Allocated memory is still 202.9 MB. Free memory was 148.9 MB in the beginning and 99.4 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 66541.48 ms. Allocated memory was 202.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 98.7 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 173 ProgramPointsBefore, 96 ProgramPointsAfterwards, 210 TransitionsBefore, 107 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 30 ChoiceCompositions, 5662 VarBasedMoverChecksPositive, 190 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 81965 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t2180, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L731] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L732] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L733] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L734] 1 y$r_buff0_thd1 = (_Bool)1 [L737] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] FCALL, FORK 0 pthread_create(&t2181, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L804] FCALL, FORK 0 pthread_create(&t2182, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L771] 3 __unbuffered_p2_EAX = x [L774] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, 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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L777] 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, 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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L758] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L780] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 164 locations, 2 error locations. Result: UNSAFE, OverallTime: 66.2s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 15.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2107 SDtfs, 1766 SDslu, 3529 SDs, 0 SdLazy, 1869 SolverSat, 111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 19 SyntacticMatches, 8 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173329occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 26.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 44262 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 650 NumberOfCodeBlocks, 650 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 568 ConstructedInterpolants, 0 QuantifiedInterpolants, 113823 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...