/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix036_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:01:42,915 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:01:42,918 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:01:42,937 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:01:42,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:01:42,938 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:01:42,940 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:01:42,950 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:01:42,954 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:01:42,957 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:01:42,959 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:01:42,961 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:01:42,961 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:01:42,963 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:01:42,965 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:01:42,966 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:01:42,968 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:01:42,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:01:42,970 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:01:42,975 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:01:42,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:01:42,984 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:01:42,985 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:01:42,986 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:01:42,988 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:01:42,988 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:01:42,988 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:01:42,990 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:01:42,991 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:01:42,992 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:01:42,992 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:01:42,994 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:01:42,995 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:01:42,996 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:01:42,997 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:01:42,997 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:01:42,998 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:01:42,998 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:01:42,998 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:01:42,999 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:01:43,000 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:01:43,001 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:01:43,022 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:01:43,023 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:01:43,025 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:01:43,025 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:01:43,026 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:01:43,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:01:43,028 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:01:43,028 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:01:43,028 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:01:43,029 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:01:43,029 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:01:43,030 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:01:43,030 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:01:43,030 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:01:43,030 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:01:43,030 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:01:43,030 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:01:43,031 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:01:43,031 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:01:43,031 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:01:43,031 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:01:43,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:01:43,032 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:01:43,032 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:01:43,032 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:01:43,032 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:01:43,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:01:43,033 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:01:43,033 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:01:43,033 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:01:43,033 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:01:43,034 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:01:43,304 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:01:43,325 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:01:43,329 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:01:43,331 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:01:43,331 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:01:43,332 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_tso.opt.i [2019-12-27 21:01:43,404 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89215fa3f/18ea77e58a294082bc7285a8fa289da9/FLAG0847e8abf [2019-12-27 21:01:43,969 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:01:43,969 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_tso.opt.i [2019-12-27 21:01:43,990 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89215fa3f/18ea77e58a294082bc7285a8fa289da9/FLAG0847e8abf [2019-12-27 21:01:44,243 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89215fa3f/18ea77e58a294082bc7285a8fa289da9 [2019-12-27 21:01:44,252 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:01:44,254 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:01:44,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:01:44,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:01:44,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:01:44,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:01:44" (1/1) ... [2019-12-27 21:01:44,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21807566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:01:44, skipping insertion in model container [2019-12-27 21:01:44,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:01:44" (1/1) ... [2019-12-27 21:01:44,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:01:44,323 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:01:44,804 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:01:44,817 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:01:44,882 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:01:44,982 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:01:44,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:01:44 WrapperNode [2019-12-27 21:01:44,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:01:44,984 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:01:44,984 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:01:44,986 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:01:44,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:01:44" (1/1) ... [2019-12-27 21:01:45,019 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:01:44" (1/1) ... [2019-12-27 21:01:45,055 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:01:45,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:01:45,057 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:01:45,057 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:01:45,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:01:44" (1/1) ... [2019-12-27 21:01:45,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:01:44" (1/1) ... [2019-12-27 21:01:45,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:01:44" (1/1) ... [2019-12-27 21:01:45,073 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:01:44" (1/1) ... [2019-12-27 21:01:45,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:01:44" (1/1) ... [2019-12-27 21:01:45,088 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:01:44" (1/1) ... [2019-12-27 21:01:45,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:01:44" (1/1) ... [2019-12-27 21:01:45,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:01:45,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:01:45,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:01:45,097 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:01:45,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:01:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:01:45,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:01:45,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:01:45,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:01:45,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:01:45,166 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:01:45,166 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:01:45,167 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:01:45,167 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:01:45,167 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:01:45,167 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:01:45,167 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 21:01:45,167 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 21:01:45,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:01:45,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:01:45,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:01:45,170 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 21:01:45,871 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:01:45,872 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:01:45,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:01:45 BoogieIcfgContainer [2019-12-27 21:01:45,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:01:45,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:01:45,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:01:45,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:01:45,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:01:44" (1/3) ... [2019-12-27 21:01:45,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241863fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:01:45, skipping insertion in model container [2019-12-27 21:01:45,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:01:44" (2/3) ... [2019-12-27 21:01:45,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241863fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:01:45, skipping insertion in model container [2019-12-27 21:01:45,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:01:45" (3/3) ... [2019-12-27 21:01:45,882 INFO L109 eAbstractionObserver]: Analyzing ICFG mix036_tso.opt.i [2019-12-27 21:01:45,892 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:01:45,892 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:01:45,900 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:01:45,901 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:01:45,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,941 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,941 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,943 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,943 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,946 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,946 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,984 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,985 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,985 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,985 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,985 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,985 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,986 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,986 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,986 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,986 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,987 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,987 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,987 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,987 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,987 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,988 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,988 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,988 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,988 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,988 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,989 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,989 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,989 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,989 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,989 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,990 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,990 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,990 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,990 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,990 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,991 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,991 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,991 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,991 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,994 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,995 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:45,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,000 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,001 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,006 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,006 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,007 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,007 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,007 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,007 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,007 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,007 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,008 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,010 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,011 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:46,025 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 21:01:46,041 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:01:46,041 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:01:46,041 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:01:46,041 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:01:46,041 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:01:46,041 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:01:46,042 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:01:46,042 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:01:46,059 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 193 transitions [2019-12-27 21:01:46,061 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 171 places, 193 transitions [2019-12-27 21:01:46,158 INFO L132 PetriNetUnfolder]: 35/189 cut-off events. [2019-12-27 21:01:46,158 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:01:46,177 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 189 events. 35/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 355 event pairs. 0/152 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 21:01:46,197 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 171 places, 193 transitions [2019-12-27 21:01:46,288 INFO L132 PetriNetUnfolder]: 35/189 cut-off events. [2019-12-27 21:01:46,288 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:01:46,296 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 189 events. 35/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 355 event pairs. 0/152 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 21:01:46,312 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-27 21:01:46,313 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:01:49,843 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 21:01:49,965 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 21:01:50,368 WARN L192 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-12-27 21:01:50,497 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-12-27 21:01:50,521 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50908 [2019-12-27 21:01:50,521 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-27 21:01:50,525 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 88 transitions [2019-12-27 21:01:52,236 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 28162 states. [2019-12-27 21:01:52,238 INFO L276 IsEmpty]: Start isEmpty. Operand 28162 states. [2019-12-27 21:01:52,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 21:01:52,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:01:52,245 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:01:52,246 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:01:52,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:01:52,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1869145816, now seen corresponding path program 1 times [2019-12-27 21:01:52,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:01:52,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339649227] [2019-12-27 21:01:52,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:01:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:01:52,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:01:52,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339649227] [2019-12-27 21:01:52,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:01:52,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:01:52,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1888857156] [2019-12-27 21:01:52,588 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:01:52,593 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:01:52,606 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 21:01:52,606 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:01:52,609 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:01:52,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:01:52,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:01:52,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:01:52,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:01:52,624 INFO L87 Difference]: Start difference. First operand 28162 states. Second operand 3 states. [2019-12-27 21:01:53,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:01:53,194 INFO L93 Difference]: Finished difference Result 27042 states and 118144 transitions. [2019-12-27 21:01:53,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:01:53,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 21:01:53,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:01:53,448 INFO L225 Difference]: With dead ends: 27042 [2019-12-27 21:01:53,449 INFO L226 Difference]: Without dead ends: 25430 [2019-12-27 21:01:53,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:01:54,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25430 states. [2019-12-27 21:01:55,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25430 to 25430. [2019-12-27 21:01:55,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25430 states. [2019-12-27 21:01:55,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25430 states to 25430 states and 110948 transitions. [2019-12-27 21:01:55,800 INFO L78 Accepts]: Start accepts. Automaton has 25430 states and 110948 transitions. Word has length 9 [2019-12-27 21:01:55,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:01:55,803 INFO L462 AbstractCegarLoop]: Abstraction has 25430 states and 110948 transitions. [2019-12-27 21:01:55,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:01:55,804 INFO L276 IsEmpty]: Start isEmpty. Operand 25430 states and 110948 transitions. [2019-12-27 21:01:55,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:01:55,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:01:55,827 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:01:55,828 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:01:55,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:01:55,829 INFO L82 PathProgramCache]: Analyzing trace with hash 508644198, now seen corresponding path program 1 times [2019-12-27 21:01:55,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:01:55,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832076650] [2019-12-27 21:01:55,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:01:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:01:55,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:01:55,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832076650] [2019-12-27 21:01:55,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:01:55,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:01:55,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1961334153] [2019-12-27 21:01:55,943 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:01:55,945 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:01:55,949 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 21:01:55,950 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:01:55,950 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:01:55,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:01:55,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:01:55,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:01:55,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:01:55,952 INFO L87 Difference]: Start difference. First operand 25430 states and 110948 transitions. Second operand 3 states. [2019-12-27 21:01:56,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:01:56,136 INFO L93 Difference]: Finished difference Result 20327 states and 82470 transitions. [2019-12-27 21:01:56,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:01:56,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 21:01:56,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:01:56,267 INFO L225 Difference]: With dead ends: 20327 [2019-12-27 21:01:56,267 INFO L226 Difference]: Without dead ends: 20327 [2019-12-27 21:01:56,268 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 21:01:57,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20327 states. [2019-12-27 21:01:58,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20327 to 20327. [2019-12-27 21:01:58,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20327 states. [2019-12-27 21:01:58,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20327 states to 20327 states and 82470 transitions. [2019-12-27 21:01:58,409 INFO L78 Accepts]: Start accepts. Automaton has 20327 states and 82470 transitions. Word has length 15 [2019-12-27 21:01:58,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:01:58,409 INFO L462 AbstractCegarLoop]: Abstraction has 20327 states and 82470 transitions. [2019-12-27 21:01:58,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:01:58,410 INFO L276 IsEmpty]: Start isEmpty. Operand 20327 states and 82470 transitions. [2019-12-27 21:01:58,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:01:58,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:01:58,414 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:01:58,414 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:01:58,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:01:58,414 INFO L82 PathProgramCache]: Analyzing trace with hash -2079616136, now seen corresponding path program 1 times [2019-12-27 21:01:58,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:01:58,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046100480] [2019-12-27 21:01:58,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:01:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:01:58,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:01:58,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046100480] [2019-12-27 21:01:58,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:01:58,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:01:58,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1798188110] [2019-12-27 21:01:58,504 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:01:58,508 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:01:58,511 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 21:01:58,511 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:01:58,550 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:01:58,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:01:58,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:01:58,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:01:58,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:01:58,552 INFO L87 Difference]: Start difference. First operand 20327 states and 82470 transitions. Second operand 5 states. [2019-12-27 21:01:58,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:01:58,655 INFO L93 Difference]: Finished difference Result 9376 states and 32306 transitions. [2019-12-27 21:01:58,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:01:58,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 21:01:58,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:01:58,683 INFO L225 Difference]: With dead ends: 9376 [2019-12-27 21:01:58,684 INFO L226 Difference]: Without dead ends: 9376 [2019-12-27 21:01:58,684 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 21:01:58,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9376 states. [2019-12-27 21:01:59,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9376 to 9376. [2019-12-27 21:01:59,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9376 states. [2019-12-27 21:01:59,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9376 states to 9376 states and 32306 transitions. [2019-12-27 21:01:59,091 INFO L78 Accepts]: Start accepts. Automaton has 9376 states and 32306 transitions. Word has length 16 [2019-12-27 21:01:59,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:01:59,091 INFO L462 AbstractCegarLoop]: Abstraction has 9376 states and 32306 transitions. [2019-12-27 21:01:59,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:01:59,091 INFO L276 IsEmpty]: Start isEmpty. Operand 9376 states and 32306 transitions. [2019-12-27 21:01:59,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:01:59,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:01:59,094 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:01:59,094 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:01:59,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:01:59,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1317832872, now seen corresponding path program 1 times [2019-12-27 21:01:59,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:01:59,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107152016] [2019-12-27 21:01:59,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:01:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:01:59,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:01:59,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107152016] [2019-12-27 21:01:59,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:01:59,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:01:59,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [944421377] [2019-12-27 21:01:59,146 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:01:59,150 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:01:59,153 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 21:01:59,154 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:01:59,169 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:01:59,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:01:59,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:01:59,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:01:59,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:01:59,170 INFO L87 Difference]: Start difference. First operand 9376 states and 32306 transitions. Second operand 6 states. [2019-12-27 21:01:59,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:01:59,231 INFO L93 Difference]: Finished difference Result 2757 states and 8603 transitions. [2019-12-27 21:01:59,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:01:59,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 21:01:59,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:01:59,239 INFO L225 Difference]: With dead ends: 2757 [2019-12-27 21:01:59,239 INFO L226 Difference]: Without dead ends: 2757 [2019-12-27 21:01:59,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:01:59,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2019-12-27 21:01:59,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 2757. [2019-12-27 21:01:59,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2757 states. [2019-12-27 21:01:59,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2757 states and 8603 transitions. [2019-12-27 21:01:59,293 INFO L78 Accepts]: Start accepts. Automaton has 2757 states and 8603 transitions. Word has length 17 [2019-12-27 21:01:59,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:01:59,294 INFO L462 AbstractCegarLoop]: Abstraction has 2757 states and 8603 transitions. [2019-12-27 21:01:59,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:01:59,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2757 states and 8603 transitions. [2019-12-27 21:01:59,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 21:01:59,296 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:01:59,296 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:01:59,296 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:01:59,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:01:59,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1770422545, now seen corresponding path program 1 times [2019-12-27 21:01:59,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:01:59,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544232749] [2019-12-27 21:01:59,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:01:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:01:59,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:01:59,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544232749] [2019-12-27 21:01:59,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:01:59,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:01:59,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1387450153] [2019-12-27 21:01:59,338 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:01:59,341 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:01:59,347 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 54 transitions. [2019-12-27 21:01:59,348 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:01:59,377 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:01:59,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:01:59,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:01:59,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:01:59,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:01:59,379 INFO L87 Difference]: Start difference. First operand 2757 states and 8603 transitions. Second operand 5 states. [2019-12-27 21:01:59,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:01:59,482 INFO L93 Difference]: Finished difference Result 3817 states and 11533 transitions. [2019-12-27 21:01:59,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:01:59,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-27 21:01:59,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:01:59,493 INFO L225 Difference]: With dead ends: 3817 [2019-12-27 21:01:59,493 INFO L226 Difference]: Without dead ends: 3817 [2019-12-27 21:01:59,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:01:59,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3817 states. [2019-12-27 21:01:59,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3817 to 3073. [2019-12-27 21:01:59,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3073 states. [2019-12-27 21:01:59,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 9503 transitions. [2019-12-27 21:01:59,571 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 9503 transitions. Word has length 18 [2019-12-27 21:01:59,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:01:59,572 INFO L462 AbstractCegarLoop]: Abstraction has 3073 states and 9503 transitions. [2019-12-27 21:01:59,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:01:59,572 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 9503 transitions. [2019-12-27 21:01:59,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 21:01:59,574 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:01:59,574 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:01:59,574 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:01:59,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:01:59,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1770543166, now seen corresponding path program 1 times [2019-12-27 21:01:59,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:01:59,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120825806] [2019-12-27 21:01:59,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:01:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:01:59,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:01:59,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120825806] [2019-12-27 21:01:59,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:01:59,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:01:59,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [62932002] [2019-12-27 21:01:59,663 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:01:59,665 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:01:59,670 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 54 transitions. [2019-12-27 21:01:59,670 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:01:59,697 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:01:59,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:01:59,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:01:59,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:01:59,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:01:59,698 INFO L87 Difference]: Start difference. First operand 3073 states and 9503 transitions. Second operand 5 states. [2019-12-27 21:01:59,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:01:59,956 INFO L93 Difference]: Finished difference Result 3911 states and 11810 transitions. [2019-12-27 21:01:59,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:01:59,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-27 21:01:59,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:01:59,970 INFO L225 Difference]: With dead ends: 3911 [2019-12-27 21:01:59,971 INFO L226 Difference]: Without dead ends: 3911 [2019-12-27 21:01:59,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:01:59,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3911 states. [2019-12-27 21:02:00,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3911 to 3703. [2019-12-27 21:02:00,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3703 states. [2019-12-27 21:02:00,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3703 states to 3703 states and 11360 transitions. [2019-12-27 21:02:00,090 INFO L78 Accepts]: Start accepts. Automaton has 3703 states and 11360 transitions. Word has length 18 [2019-12-27 21:02:00,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:02:00,091 INFO L462 AbstractCegarLoop]: Abstraction has 3703 states and 11360 transitions. [2019-12-27 21:02:00,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:02:00,091 INFO L276 IsEmpty]: Start isEmpty. Operand 3703 states and 11360 transitions. [2019-12-27 21:02:00,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 21:02:00,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:02:00,095 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:02:00,095 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:02:00,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:02:00,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1634843704, now seen corresponding path program 1 times [2019-12-27 21:02:00,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:02:00,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459568712] [2019-12-27 21:02:00,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:02:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:02:00,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:02:00,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459568712] [2019-12-27 21:02:00,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:02:00,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:02:00,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1715985784] [2019-12-27 21:02:00,229 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:02:00,235 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:02:00,244 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 54 transitions. [2019-12-27 21:02:00,247 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:02:00,287 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:02:00,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:02:00,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:02:00,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:02:00,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:02:00,291 INFO L87 Difference]: Start difference. First operand 3703 states and 11360 transitions. Second operand 5 states. [2019-12-27 21:02:00,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:02:00,565 INFO L93 Difference]: Finished difference Result 4550 states and 13714 transitions. [2019-12-27 21:02:00,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:02:00,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-27 21:02:00,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:02:00,575 INFO L225 Difference]: With dead ends: 4550 [2019-12-27 21:02:00,575 INFO L226 Difference]: Without dead ends: 4550 [2019-12-27 21:02:00,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:02:00,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4550 states. [2019-12-27 21:02:00,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4550 to 3814. [2019-12-27 21:02:00,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3814 states. [2019-12-27 21:02:00,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3814 states to 3814 states and 11697 transitions. [2019-12-27 21:02:00,844 INFO L78 Accepts]: Start accepts. Automaton has 3814 states and 11697 transitions. Word has length 18 [2019-12-27 21:02:00,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:02:00,845 INFO L462 AbstractCegarLoop]: Abstraction has 3814 states and 11697 transitions. [2019-12-27 21:02:00,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:02:00,845 INFO L276 IsEmpty]: Start isEmpty. Operand 3814 states and 11697 transitions. [2019-12-27 21:02:00,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 21:02:00,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:02:00,856 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:02:00,856 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:02:00,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:02:00,856 INFO L82 PathProgramCache]: Analyzing trace with hash 736675489, now seen corresponding path program 1 times [2019-12-27 21:02:00,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:02:00,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977035667] [2019-12-27 21:02:00,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:02:00,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:02:00,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:02:00,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977035667] [2019-12-27 21:02:00,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:02:00,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:02:00,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2082527335] [2019-12-27 21:02:00,981 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:02:00,989 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:02:01,009 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 112 transitions. [2019-12-27 21:02:01,010 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:02:01,046 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:02:01,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:02:01,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:02:01,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:02:01,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:02:01,047 INFO L87 Difference]: Start difference. First operand 3814 states and 11697 transitions. Second operand 8 states. [2019-12-27 21:02:01,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:02:01,120 INFO L93 Difference]: Finished difference Result 2862 states and 9250 transitions. [2019-12-27 21:02:01,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:02:01,121 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-12-27 21:02:01,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:02:01,127 INFO L225 Difference]: With dead ends: 2862 [2019-12-27 21:02:01,128 INFO L226 Difference]: Without dead ends: 2862 [2019-12-27 21:02:01,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:02:01,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2019-12-27 21:02:01,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 2702. [2019-12-27 21:02:01,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2702 states. [2019-12-27 21:02:01,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2702 states to 2702 states and 8770 transitions. [2019-12-27 21:02:01,190 INFO L78 Accepts]: Start accepts. Automaton has 2702 states and 8770 transitions. Word has length 32 [2019-12-27 21:02:01,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:02:01,190 INFO L462 AbstractCegarLoop]: Abstraction has 2702 states and 8770 transitions. [2019-12-27 21:02:01,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:02:01,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2702 states and 8770 transitions. [2019-12-27 21:02:01,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 21:02:01,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:02:01,200 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:02:01,200 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:02:01,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:02:01,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1388771925, now seen corresponding path program 1 times [2019-12-27 21:02:01,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:02:01,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661968638] [2019-12-27 21:02:01,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:02:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:02:01,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:02:01,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661968638] [2019-12-27 21:02:01,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:02:01,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:02:01,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [137929066] [2019-12-27 21:02:01,287 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:02:01,303 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:02:01,362 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 107 states and 163 transitions. [2019-12-27 21:02:01,362 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:02:01,376 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:02:01,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:02:01,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:02:01,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:02:01,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:02:01,377 INFO L87 Difference]: Start difference. First operand 2702 states and 8770 transitions. Second operand 5 states. [2019-12-27 21:02:01,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:02:01,413 INFO L93 Difference]: Finished difference Result 3792 states and 11773 transitions. [2019-12-27 21:02:01,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:02:01,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-27 21:02:01,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:02:01,420 INFO L225 Difference]: With dead ends: 3792 [2019-12-27 21:02:01,420 INFO L226 Difference]: Without dead ends: 2430 [2019-12-27 21:02:01,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:02:01,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2019-12-27 21:02:01,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 2430. [2019-12-27 21:02:01,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2430 states. [2019-12-27 21:02:01,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 2430 states and 7765 transitions. [2019-12-27 21:02:01,466 INFO L78 Accepts]: Start accepts. Automaton has 2430 states and 7765 transitions. Word has length 47 [2019-12-27 21:02:01,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:02:01,466 INFO L462 AbstractCegarLoop]: Abstraction has 2430 states and 7765 transitions. [2019-12-27 21:02:01,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:02:01,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2430 states and 7765 transitions. [2019-12-27 21:02:01,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 21:02:01,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:02:01,473 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:02:01,473 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:02:01,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:02:01,474 INFO L82 PathProgramCache]: Analyzing trace with hash -564374207, now seen corresponding path program 2 times [2019-12-27 21:02:01,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:02:01,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408312605] [2019-12-27 21:02:01,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:02:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:02:01,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:02:01,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408312605] [2019-12-27 21:02:01,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:02:01,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:02:01,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [61704843] [2019-12-27 21:02:01,552 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:02:01,567 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:02:01,662 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 282 transitions. [2019-12-27 21:02:01,662 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:02:01,884 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-12-27 21:02:01,887 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:02:01,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:02:01,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:02:01,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:02:01,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:02:01,889 INFO L87 Difference]: Start difference. First operand 2430 states and 7765 transitions. Second operand 7 states. [2019-12-27 21:02:02,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:02:02,802 INFO L93 Difference]: Finished difference Result 9032 states and 29060 transitions. [2019-12-27 21:02:02,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 21:02:02,802 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-27 21:02:02,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:02:02,814 INFO L225 Difference]: With dead ends: 9032 [2019-12-27 21:02:02,815 INFO L226 Difference]: Without dead ends: 6098 [2019-12-27 21:02:02,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-27 21:02:02,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6098 states. [2019-12-27 21:02:02,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6098 to 3416. [2019-12-27 21:02:02,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3416 states. [2019-12-27 21:02:02,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3416 states to 3416 states and 10986 transitions. [2019-12-27 21:02:02,915 INFO L78 Accepts]: Start accepts. Automaton has 3416 states and 10986 transitions. Word has length 47 [2019-12-27 21:02:02,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:02:02,915 INFO L462 AbstractCegarLoop]: Abstraction has 3416 states and 10986 transitions. [2019-12-27 21:02:02,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:02:02,916 INFO L276 IsEmpty]: Start isEmpty. Operand 3416 states and 10986 transitions. [2019-12-27 21:02:02,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 21:02:02,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:02:02,927 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:02:02,927 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:02:02,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:02:02,927 INFO L82 PathProgramCache]: Analyzing trace with hash -760514239, now seen corresponding path program 3 times [2019-12-27 21:02:02,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:02:02,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097627384] [2019-12-27 21:02:02,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:02:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:02:03,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:02:03,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097627384] [2019-12-27 21:02:03,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:02:03,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:02:03,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [325904762] [2019-12-27 21:02:03,049 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:02:03,063 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:02:03,164 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 159 states and 283 transitions. [2019-12-27 21:02:03,165 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:02:03,180 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:02:03,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:02:03,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:02:03,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:02:03,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:02:03,182 INFO L87 Difference]: Start difference. First operand 3416 states and 10986 transitions. Second operand 5 states. [2019-12-27 21:02:03,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:02:03,487 INFO L93 Difference]: Finished difference Result 5580 states and 17028 transitions. [2019-12-27 21:02:03,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:02:03,487 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-27 21:02:03,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:02:03,494 INFO L225 Difference]: With dead ends: 5580 [2019-12-27 21:02:03,494 INFO L226 Difference]: Without dead ends: 3581 [2019-12-27 21:02:03,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:02:03,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3581 states. [2019-12-27 21:02:03,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3581 to 2470. [2019-12-27 21:02:03,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2470 states. [2019-12-27 21:02:03,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2470 states to 2470 states and 7129 transitions. [2019-12-27 21:02:03,547 INFO L78 Accepts]: Start accepts. Automaton has 2470 states and 7129 transitions. Word has length 47 [2019-12-27 21:02:03,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:02:03,547 INFO L462 AbstractCegarLoop]: Abstraction has 2470 states and 7129 transitions. [2019-12-27 21:02:03,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:02:03,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 7129 transitions. [2019-12-27 21:02:03,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 21:02:03,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:02:03,556 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:02:03,556 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:02:03,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:02:03,557 INFO L82 PathProgramCache]: Analyzing trace with hash 860461867, now seen corresponding path program 4 times [2019-12-27 21:02:03,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:02:03,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876681057] [2019-12-27 21:02:03,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:02:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:02:03,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:02:03,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876681057] [2019-12-27 21:02:03,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:02:03,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:02:03,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [65090269] [2019-12-27 21:02:03,635 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:02:03,650 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:02:03,961 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 211 states and 412 transitions. [2019-12-27 21:02:03,961 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:02:03,976 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:02:03,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:02:03,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:02:03,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:02:03,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:02:03,977 INFO L87 Difference]: Start difference. First operand 2470 states and 7129 transitions. Second operand 5 states. [2019-12-27 21:02:04,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:02:04,225 INFO L93 Difference]: Finished difference Result 3909 states and 10905 transitions. [2019-12-27 21:02:04,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:02:04,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-27 21:02:04,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:02:04,227 INFO L225 Difference]: With dead ends: 3909 [2019-12-27 21:02:04,227 INFO L226 Difference]: Without dead ends: 929 [2019-12-27 21:02:04,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:02:04,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-12-27 21:02:04,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 599. [2019-12-27 21:02:04,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-12-27 21:02:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1339 transitions. [2019-12-27 21:02:04,237 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1339 transitions. Word has length 47 [2019-12-27 21:02:04,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:02:04,237 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 1339 transitions. [2019-12-27 21:02:04,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:02:04,237 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1339 transitions. [2019-12-27 21:02:04,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 21:02:04,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:02:04,239 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:02:04,239 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:02:04,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:02:04,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1346667599, now seen corresponding path program 5 times [2019-12-27 21:02:04,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:02:04,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660587658] [2019-12-27 21:02:04,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:02:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:02:04,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:02:04,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660587658] [2019-12-27 21:02:04,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:02:04,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:02:04,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1674855554] [2019-12-27 21:02:04,554 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:02:04,566 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:02:04,618 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 130 transitions. [2019-12-27 21:02:04,618 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:02:04,740 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 21:02:04,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 21:02:04,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:02:04,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 21:02:04,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:02:04,743 INFO L87 Difference]: Start difference. First operand 599 states and 1339 transitions. Second operand 15 states. [2019-12-27 21:02:06,132 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2019-12-27 21:02:07,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:02:07,130 INFO L93 Difference]: Finished difference Result 1337 states and 2696 transitions. [2019-12-27 21:02:07,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 21:02:07,130 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-12-27 21:02:07,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:02:07,133 INFO L225 Difference]: With dead ends: 1337 [2019-12-27 21:02:07,133 INFO L226 Difference]: Without dead ends: 1337 [2019-12-27 21:02:07,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=324, Invalid=1008, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 21:02:07,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2019-12-27 21:02:07,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 766. [2019-12-27 21:02:07,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2019-12-27 21:02:07,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1625 transitions. [2019-12-27 21:02:07,148 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1625 transitions. Word has length 47 [2019-12-27 21:02:07,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:02:07,149 INFO L462 AbstractCegarLoop]: Abstraction has 766 states and 1625 transitions. [2019-12-27 21:02:07,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 21:02:07,149 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1625 transitions. [2019-12-27 21:02:07,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 21:02:07,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:02:07,155 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:02:07,155 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:02:07,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:02:07,156 INFO L82 PathProgramCache]: Analyzing trace with hash 153801761, now seen corresponding path program 6 times [2019-12-27 21:02:07,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:02:07,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010857574] [2019-12-27 21:02:07,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:02:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:02:07,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:02:07,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010857574] [2019-12-27 21:02:07,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:02:07,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:02:07,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1004184041] [2019-12-27 21:02:07,263 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:02:07,275 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:02:07,319 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 114 transitions. [2019-12-27 21:02:07,319 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:02:07,319 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:02:07,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:02:07,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:02:07,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:02:07,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:02:07,320 INFO L87 Difference]: Start difference. First operand 766 states and 1625 transitions. Second operand 3 states. [2019-12-27 21:02:07,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:02:07,333 INFO L93 Difference]: Finished difference Result 764 states and 1620 transitions. [2019-12-27 21:02:07,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:02:07,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-27 21:02:07,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:02:07,335 INFO L225 Difference]: With dead ends: 764 [2019-12-27 21:02:07,335 INFO L226 Difference]: Without dead ends: 764 [2019-12-27 21:02:07,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:02:07,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-12-27 21:02:07,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 624. [2019-12-27 21:02:07,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-12-27 21:02:07,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 1339 transitions. [2019-12-27 21:02:07,345 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 1339 transitions. Word has length 47 [2019-12-27 21:02:07,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:02:07,345 INFO L462 AbstractCegarLoop]: Abstraction has 624 states and 1339 transitions. [2019-12-27 21:02:07,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:02:07,346 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 1339 transitions. [2019-12-27 21:02:07,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 21:02:07,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:02:07,348 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:02:07,348 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:02:07,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:02:07,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1207309809, now seen corresponding path program 1 times [2019-12-27 21:02:07,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:02:07,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950560140] [2019-12-27 21:02:07,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:02:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:02:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:02:07,456 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:02:07,456 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:02:07,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_83| 0 0))) (and (= v_~z$r_buff0_thd0~0_22 0) (= 0 v_~z$w_buff1~0_25) (= 0 v_~a~0_9) (= 0 v_~__unbuffered_p0_EAX~0_13) (= v_~main$tmp_guard1~0_18 0) (< 0 |v_#StackHeapBarrier_23|) (= 0 v_~weak$$choice0~0_9) (= 0 v_~z$r_buff1_thd1~0_11) (< |v_#StackHeapBarrier_23| |v_ULTIMATE.start_main_~#t965~0.base_29|) (= v_~b~0_10 0) (= v_~main$tmp_guard0~0_9 0) (= (store |v_#length_34| |v_ULTIMATE.start_main_~#t965~0.base_29| 4) |v_#length_33|) (= v_~z$mem_tmp~0_11 0) (= 0 v_~__unbuffered_p1_EAX~0_12) (= v_~z~0_22 0) (= |v_#NULL.offset_3| 0) (= v_~z$r_buff0_thd4~0_29 0) (= 0 v_~z$w_buff1_used~0_58) (= |v_#memory_int_31| (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t965~0.base_29| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t965~0.base_29|) |v_ULTIMATE.start_main_~#t965~0.offset_22| 0))) (= 0 v_~z$r_buff1_thd2~0_11) (= 0 v_~weak$$choice2~0_34) (= v_~x~0_10 0) (= v_~z$r_buff0_thd2~0_11 0) (= 0 v_~z$r_buff1_thd4~0_21) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t965~0.base_29|)) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$flush_delayed~0_14) (= v_~z$r_buff0_thd3~0_70 0) (= 0 v_~z$r_buff1_thd0~0_19) (= |v_#valid_81| (store .cse0 |v_ULTIMATE.start_main_~#t965~0.base_29| 1)) (= v_~z$read_delayed_var~0.base_7 0) (= 0 v_~__unbuffered_p3_EBX~0_13) (= v_~z$read_delayed~0_7 0) (= 0 v_~__unbuffered_cnt~0_27) (= v_~z$w_buff0_used~0_95 0) (= v_~z$r_buff0_thd1~0_11 0) (= 0 v_~__unbuffered_p2_EAX~0_12) (= 0 v_~z$r_buff1_thd3~0_42) (= 0 |v_#NULL.base_3|) (= 0 v_~__unbuffered_p3_EAX~0_13) (= |v_ULTIMATE.start_main_~#t965~0.offset_22| 0) (= 0 v_~z$w_buff0~0_25) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_23|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_32|, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_11|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ULTIMATE.start_main_~#t968~0.base=|v_ULTIMATE.start_main_~#t968~0.base_20|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_~#t965~0.base=|v_ULTIMATE.start_main_~#t965~0.base_29|, ~a~0=v_~a~0_9, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_29, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_13, #length=|v_#length_33|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_12|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_58, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_~#t966~0.offset=|v_ULTIMATE.start_main_~#t966~0.offset_19|, ~z$flush_delayed~0=v_~z$flush_delayed~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_23|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, ULTIMATE.start_main_~#t967~0.offset=|v_ULTIMATE.start_main_~#t967~0.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ULTIMATE.start_main_~#t966~0.base=|v_ULTIMATE.start_main_~#t966~0.base_24|, ~x~0=v_~x~0_10, ULTIMATE.start_main_~#t968~0.offset=|v_ULTIMATE.start_main_~#t968~0.offset_17|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_21, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_10|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t967~0.base=|v_ULTIMATE.start_main_~#t967~0.base_24|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_19, ULTIMATE.start_main_~#t965~0.offset=|v_ULTIMATE.start_main_~#t965~0.offset_22|, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_11, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_95, ~z$w_buff0~0=v_~z$w_buff0~0_25, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_42, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_12|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_13, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_18|, ~b~0=v_~b~0_10, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_81|, #memory_int=|v_#memory_int_31|, ~z~0=v_~z~0_22, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, ULTIMATE.start_main_~#t968~0.base, #NULL.offset, ULTIMATE.start_main_~#t965~0.base, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t966~0.offset, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t967~0.offset, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t966~0.base, ~x~0, ULTIMATE.start_main_~#t968~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t967~0.base, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t965~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:02:07,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L845-1-->L847: Formula: (and (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t966~0.base_12| 1)) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t966~0.base_12|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t966~0.base_12|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t966~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t966~0.base_12|) |v_ULTIMATE.start_main_~#t966~0.offset_10| 1)) |v_#memory_int_17|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t966~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t966~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t966~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_~#t966~0.offset=|v_ULTIMATE.start_main_~#t966~0.offset_10|, ULTIMATE.start_main_~#t966~0.base=|v_ULTIMATE.start_main_~#t966~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t966~0.offset, ULTIMATE.start_main_~#t966~0.base] because there is no mapped edge [2019-12-27 21:02:07,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L847-1-->L849: Formula: (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t967~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t967~0.base_13|) |v_ULTIMATE.start_main_~#t967~0.offset_11| 2)) |v_#memory_int_21|) (= 0 (select |v_#valid_55| |v_ULTIMATE.start_main_~#t967~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t967~0.offset_11|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t967~0.base_13|) (= (store |v_#valid_55| |v_ULTIMATE.start_main_~#t967~0.base_13| 1) |v_#valid_54|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t967~0.base_13| 4) |v_#length_23|) (not (= 0 |v_ULTIMATE.start_main_~#t967~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t967~0.base=|v_ULTIMATE.start_main_~#t967~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t967~0.offset=|v_ULTIMATE.start_main_~#t967~0.offset_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t967~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t967~0.offset, #length] because there is no mapped edge [2019-12-27 21:02:07,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L849-1-->L851: Formula: (and (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t968~0.base_10|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t968~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t968~0.base_10|) |v_ULTIMATE.start_main_~#t968~0.offset_9| 3)) |v_#memory_int_15|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t968~0.base_10| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t968~0.base_10| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t968~0.base_10|) (= |v_ULTIMATE.start_main_~#t968~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t968~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t968~0.offset=|v_ULTIMATE.start_main_~#t968~0.offset_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_4|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t968~0.base=|v_ULTIMATE.start_main_~#t968~0.base_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t968~0.offset, ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t968~0.base, #length] because there is no mapped edge [2019-12-27 21:02:07,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L4-->L822: Formula: (and (= v_~z$r_buff0_thd0~0_14 v_~z$r_buff1_thd0~0_10) (= v_~z$r_buff1_thd2~0_3 v_~z$r_buff0_thd2~0_4) (= v_~z$r_buff0_thd3~0_35 v_~z$r_buff1_thd3~0_21) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_6 0)) (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_4) (= 1 v_~a~0_3) (= v_~__unbuffered_p3_EAX~0_5 v_~a~0_3) (= v_~z$r_buff0_thd4~0_15 1) (= v_~z$r_buff0_thd4~0_16 v_~z$r_buff1_thd4~0_10) (= v_~z$r_buff1_thd1~0_3 v_~z$r_buff0_thd1~0_4)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_6, ~b~0=v_~b~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_6, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_10, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_21, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~b~0=v_~b~0_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_10, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_5, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 21:02:07,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_7) (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_P0Thread1of1ForFork3_~arg.base_4 |v_P0Thread1of1ForFork3_#in~arg.base_4|) (= 1 v_~b~0_7) (= |v_P0Thread1of1ForFork3_#in~arg.offset_4| v_P0Thread1of1ForFork3_~arg.offset_4) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_4|, ~x~0=v_~x~0_7} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~b~0=v_~b~0_7, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_4|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_4, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_4, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_4|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-27 21:02:07,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] P1ENTRY-->P1EXIT: Formula: (and (= 1 v_~x~0_6) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_p1_EAX~0_5 v_~y~0_6) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~y~0=v_~y~0_6} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_6, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_6} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-27 21:02:07,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L780-->L780-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1084730964 256)))) (or (and (= ~z$w_buff0~0_In1084730964 |P2Thread1of1ForFork1_#t~ite9_Out1084730964|) (= |P2Thread1of1ForFork1_#t~ite8_In1084730964| |P2Thread1of1ForFork1_#t~ite8_Out1084730964|) (not .cse0)) (and .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1084730964 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In1084730964 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1084730964 256))) (and (= (mod ~z$r_buff1_thd3~0_In1084730964 256) 0) .cse1))) (= |P2Thread1of1ForFork1_#t~ite8_Out1084730964| |P2Thread1of1ForFork1_#t~ite9_Out1084730964|) (= |P2Thread1of1ForFork1_#t~ite8_Out1084730964| ~z$w_buff0~0_In1084730964)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1084730964, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1084730964, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1084730964, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1084730964, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1084730964, ~weak$$choice2~0=~weak$$choice2~0_In1084730964, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In1084730964|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In1084730964, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1084730964, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1084730964, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1084730964, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1084730964, ~weak$$choice2~0=~weak$$choice2~0_In1084730964, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out1084730964|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out1084730964|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 21:02:07,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L784-->L785: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~z$r_buff0_thd3~0_58 v_~z$r_buff0_thd3~0_59)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_10|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_8|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_24, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 21:02:07,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] L787-->L795: Formula: (and (= v_~z~0_16 v_~z$mem_tmp~0_5) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 21:02:07,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1562328153 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1562328153 256)))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out-1562328153| 0)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out-1562328153| ~z$w_buff0_used~0_In-1562328153)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1562328153, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1562328153} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1562328153|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1562328153, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1562328153} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 21:02:07,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1527747507 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In1527747507 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In1527747507 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1527747507 256) 0))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite29_Out1527747507|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1527747507 |P3Thread1of1ForFork2_#t~ite29_Out1527747507|) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1527747507, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1527747507, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1527747507, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1527747507} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out1527747507|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1527747507, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1527747507, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1527747507, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1527747507} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 21:02:07,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L825-->L826: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-499623465 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-499623465 256)))) (or (and (= 0 ~z$r_buff0_thd4~0_Out-499623465) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out-499623465 ~z$r_buff0_thd4~0_In-499623465)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-499623465, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-499623465} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-499623465, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-499623465, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out-499623465|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-27 21:02:07,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L826-->L826-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1731645678 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1731645678 256))) (.cse3 (= (mod ~z$r_buff1_thd4~0_In-1731645678 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1731645678 256) 0))) (or (and (= |P3Thread1of1ForFork2_#t~ite31_Out-1731645678| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P3Thread1of1ForFork2_#t~ite31_Out-1731645678| ~z$r_buff1_thd4~0_In-1731645678)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1731645678, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1731645678, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1731645678, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1731645678} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1731645678, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1731645678, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1731645678, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1731645678, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out-1731645678|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 21:02:07,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L826-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= |v_P3Thread1of1ForFork2_#t~ite31_8| v_~z$r_buff1_thd4~0_15) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_8|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_15, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_7|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 21:02:07,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L851-1-->L857: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:02:07,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L857-2-->L857-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-26262519 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-26262519 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-26262519 |ULTIMATE.start_main_#t~ite36_Out-26262519|)) (and (= ~z~0_In-26262519 |ULTIMATE.start_main_#t~ite36_Out-26262519|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-26262519, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-26262519, ~z$w_buff1~0=~z$w_buff1~0_In-26262519, ~z~0=~z~0_In-26262519} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-26262519, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-26262519, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-26262519|, ~z$w_buff1~0=~z$w_buff1~0_In-26262519, ~z~0=~z~0_In-26262519} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 21:02:07,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L857-4-->L858: Formula: (= v_~z~0_13 |v_ULTIMATE.start_main_#t~ite36_7|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_7|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_6|, ~z~0=v_~z~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-27 21:02:07,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L858-->L858-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1213786458 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1213786458 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out1213786458| ~z$w_buff0_used~0_In1213786458) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out1213786458| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1213786458, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1213786458} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1213786458, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1213786458, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1213786458|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 21:02:07,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L859-->L859-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In-15631841 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-15631841 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-15631841 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-15631841 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-15631841 |ULTIMATE.start_main_#t~ite39_Out-15631841|)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-15631841|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-15631841, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-15631841, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-15631841, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-15631841} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-15631841, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-15631841|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-15631841, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-15631841, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-15631841} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 21:02:07,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L860-->L860-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-49278008 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-49278008 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-49278008| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-49278008| ~z$r_buff0_thd0~0_In-49278008)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-49278008, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-49278008} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-49278008, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-49278008|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-49278008} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 21:02:07,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L861-->L861-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-350818530 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-350818530 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-350818530 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-350818530 256)))) (or (and (= ~z$r_buff1_thd0~0_In-350818530 |ULTIMATE.start_main_#t~ite41_Out-350818530|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite41_Out-350818530| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-350818530, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-350818530, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-350818530, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-350818530} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-350818530|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-350818530, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-350818530, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-350818530, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-350818530} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 21:02:07,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L861-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_14 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~__unbuffered_p0_EAX~0_9 0) (= 1 v_~__unbuffered_p3_EAX~0_9) (= v_~__unbuffered_p2_EAX~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= 0 v_~__unbuffered_p1_EAX~0_8) (= v_~main$tmp_guard1~0_14 0) (= |v_ULTIMATE.start_main_#t~ite41_11| v_~z$r_buff1_thd0~0_14) (= 0 v_~__unbuffered_p3_EBX~0_9)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_9} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:02:07,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:02:07 BasicIcfg [2019-12-27 21:02:07,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:02:07,572 INFO L168 Benchmark]: Toolchain (without parser) took 23318.15 ms. Allocated memory was 139.5 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 102.0 MB in the beginning and 597.2 MB in the end (delta: -495.2 MB). Peak memory consumption was 565.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:02:07,572 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 21:02:07,574 INFO L168 Benchmark]: CACSL2BoogieTranslator took 728.49 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 101.5 MB in the beginning and 157.2 MB in the end (delta: -55.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:02:07,575 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.73 ms. Allocated memory is still 203.4 MB. Free memory was 157.2 MB in the beginning and 154.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:02:07,575 INFO L168 Benchmark]: Boogie Preprocessor took 41.13 ms. Allocated memory is still 203.4 MB. Free memory was 154.7 MB in the beginning and 152.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:02:07,578 INFO L168 Benchmark]: RCFGBuilder took 776.11 ms. Allocated memory is still 203.4 MB. Free memory was 152.0 MB in the beginning and 106.2 MB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:02:07,579 INFO L168 Benchmark]: TraceAbstraction took 21695.67 ms. Allocated memory was 203.4 MB in the beginning and 1.2 GB in the end (delta: 996.7 MB). Free memory was 105.6 MB in the beginning and 597.2 MB in the end (delta: -491.6 MB). Peak memory consumption was 505.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:02:07,587 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.22 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 728.49 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 101.5 MB in the beginning and 157.2 MB in the end (delta: -55.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.73 ms. Allocated memory is still 203.4 MB. Free memory was 157.2 MB in the beginning and 154.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.13 ms. Allocated memory is still 203.4 MB. Free memory was 154.7 MB in the beginning and 152.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 776.11 ms. Allocated memory is still 203.4 MB. Free memory was 152.0 MB in the beginning and 106.2 MB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21695.67 ms. Allocated memory was 203.4 MB in the beginning and 1.2 GB in the end (delta: 996.7 MB). Free memory was 105.6 MB in the beginning and 597.2 MB in the end (delta: -491.6 MB). Peak memory consumption was 505.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.4s, 171 ProgramPointsBefore, 80 ProgramPointsAfterwards, 193 TransitionsBefore, 88 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 39 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 19 ChoiceCompositions, 5370 VarBasedMoverChecksPositive, 132 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 50908 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L845] FCALL, FORK 0 pthread_create(&t965, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t966, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t967, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t968, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 1 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 3 y = 1 [L775] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 3 z$flush_delayed = weak$$choice2 [L778] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L780] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L782] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L783] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L857] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 159 locations, 2 error locations. Result: UNSAFE, OverallTime: 21.4s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1896 SDtfs, 2627 SDslu, 3529 SDs, 0 SdLazy, 2528 SolverSat, 219 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28162occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 6682 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 473 NumberOfCodeBlocks, 473 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 411 ConstructedInterpolants, 0 QuantifiedInterpolants, 55667 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...