/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix053_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:48:05,849 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:48:05,852 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:48:05,871 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:48:05,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:48:05,873 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:48:05,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:48:05,885 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:48:05,889 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:48:05,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:48:05,894 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:48:05,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:48:05,896 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:48:05,898 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:48:05,900 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:48:05,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:48:05,903 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:48:05,904 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:48:05,905 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:48:05,910 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:48:05,914 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:48:05,919 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:48:05,920 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:48:05,920 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:48:05,922 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:48:05,923 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:48:05,923 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:48:05,925 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:48:05,925 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:48:05,926 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:48:05,926 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:48:05,928 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:48:05,928 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:48:05,930 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:48:05,931 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:48:05,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:48:05,932 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:48:05,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:48:05,932 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:48:05,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:48:05,934 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:48:05,935 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:48:05,969 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:48:05,970 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:48:05,971 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:48:05,971 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:48:05,971 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:48:05,972 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:48:05,972 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:48:05,972 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:48:05,972 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:48:05,972 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:48:05,973 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:48:05,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:48:05,973 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:48:05,973 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:48:05,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:48:05,974 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:48:05,976 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:48:05,976 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:48:05,976 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:48:05,977 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:48:05,977 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:48:05,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:48:05,977 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:48:05,977 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:48:05,978 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:48:05,978 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:48:05,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:48:05,978 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:48:05,978 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:48:05,979 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:48:06,281 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:48:06,299 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:48:06,303 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:48:06,305 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:48:06,305 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:48:06,306 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_pso.opt.i [2019-12-18 21:48:06,379 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed0490808/94efc4baee474d009c30472b124690af/FLAG823d20f34 [2019-12-18 21:48:06,964 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:48:06,964 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_pso.opt.i [2019-12-18 21:48:06,985 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed0490808/94efc4baee474d009c30472b124690af/FLAG823d20f34 [2019-12-18 21:48:07,279 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed0490808/94efc4baee474d009c30472b124690af [2019-12-18 21:48:07,289 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:48:07,291 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:48:07,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:48:07,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:48:07,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:48:07,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:48:07" (1/1) ... [2019-12-18 21:48:07,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cc43a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:07, skipping insertion in model container [2019-12-18 21:48:07,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:48:07" (1/1) ... [2019-12-18 21:48:07,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:48:07,381 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:48:07,865 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:48:07,882 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:48:07,998 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:48:08,078 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:48:08,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:08 WrapperNode [2019-12-18 21:48:08,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:48:08,080 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:48:08,080 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:48:08,080 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:48:08,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:08" (1/1) ... [2019-12-18 21:48:08,107 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:08" (1/1) ... [2019-12-18 21:48:08,139 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:48:08,140 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:48:08,140 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:48:08,140 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:48:08,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:08" (1/1) ... [2019-12-18 21:48:08,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:08" (1/1) ... [2019-12-18 21:48:08,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:08" (1/1) ... [2019-12-18 21:48:08,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:08" (1/1) ... [2019-12-18 21:48:08,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:08" (1/1) ... [2019-12-18 21:48:08,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:08" (1/1) ... [2019-12-18 21:48:08,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:08" (1/1) ... [2019-12-18 21:48:08,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:48:08,198 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:48:08,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:48:08,199 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:48:08,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:48:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:48:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:48:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:48:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:48:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:48:08,262 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:48:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:48:08,262 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:48:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:48:08,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:48:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 21:48:08,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 21:48:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:48:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:48:08,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:48:08,265 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:48:08,964 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:48:08,965 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:48:08,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:48:08 BoogieIcfgContainer [2019-12-18 21:48:08,967 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:48:08,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:48:08,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:48:08,971 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:48:08,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:48:07" (1/3) ... [2019-12-18 21:48:08,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df59527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:48:08, skipping insertion in model container [2019-12-18 21:48:08,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:08" (2/3) ... [2019-12-18 21:48:08,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df59527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:48:08, skipping insertion in model container [2019-12-18 21:48:08,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:48:08" (3/3) ... [2019-12-18 21:48:08,975 INFO L109 eAbstractionObserver]: Analyzing ICFG mix053_pso.opt.i [2019-12-18 21:48:08,987 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:48:08,987 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:48:08,995 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:48:08,996 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:48:09,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,039 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,039 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,040 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,040 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,043 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,043 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,086 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,086 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,086 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,086 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,087 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,087 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,087 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,088 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,088 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,088 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,088 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,088 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,089 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,089 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,089 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,090 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,090 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,090 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,090 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,091 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,091 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,091 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,091 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,092 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,092 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,092 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,092 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,099 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,120 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,126 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,126 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,127 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,127 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,127 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,127 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,127 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,127 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,128 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,128 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,128 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,128 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,130 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,131 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,133 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,133 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:09,147 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 21:48:09,168 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:48:09,168 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:48:09,168 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:48:09,168 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:48:09,169 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:48:09,169 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:48:09,169 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:48:09,169 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:48:09,186 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 189 transitions [2019-12-18 21:48:09,188 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 167 places, 189 transitions [2019-12-18 21:48:09,272 INFO L126 PetriNetUnfolder]: 35/185 cut-off events. [2019-12-18 21:48:09,272 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:48:09,288 INFO L76 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 185 events. 35/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 348 event pairs. 12/160 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-18 21:48:09,310 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 167 places, 189 transitions [2019-12-18 21:48:09,354 INFO L126 PetriNetUnfolder]: 35/185 cut-off events. [2019-12-18 21:48:09,355 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:48:09,361 INFO L76 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 185 events. 35/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 348 event pairs. 12/160 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-18 21:48:09,380 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-18 21:48:09,381 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:48:12,787 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-18 21:48:13,107 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 21:48:13,268 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 21:48:13,285 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50569 [2019-12-18 21:48:13,286 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-18 21:48:13,289 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 87 transitions [2019-12-18 21:48:14,977 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27134 states. [2019-12-18 21:48:14,979 INFO L276 IsEmpty]: Start isEmpty. Operand 27134 states. [2019-12-18 21:48:14,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 21:48:14,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:14,987 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:48:14,987 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:14,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:14,992 INFO L82 PathProgramCache]: Analyzing trace with hash -2082077885, now seen corresponding path program 1 times [2019-12-18 21:48:14,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:14,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122960228] [2019-12-18 21:48:14,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:48:15,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:48:15,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122960228] [2019-12-18 21:48:15,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:48:15,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:48:15,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585607592] [2019-12-18 21:48:15,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:48:15,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:48:15,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:48:15,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:48:15,260 INFO L87 Difference]: Start difference. First operand 27134 states. Second operand 3 states. [2019-12-18 21:48:16,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:48:16,600 INFO L93 Difference]: Finished difference Result 26286 states and 115156 transitions. [2019-12-18 21:48:16,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:48:16,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 21:48:16,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:48:16,854 INFO L225 Difference]: With dead ends: 26286 [2019-12-18 21:48:16,854 INFO L226 Difference]: Without dead ends: 24606 [2019-12-18 21:48:16,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:48:17,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24606 states. [2019-12-18 21:48:18,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24606 to 24606. [2019-12-18 21:48:18,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24606 states. [2019-12-18 21:48:18,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24606 states to 24606 states and 107644 transitions. [2019-12-18 21:48:18,305 INFO L78 Accepts]: Start accepts. Automaton has 24606 states and 107644 transitions. Word has length 9 [2019-12-18 21:48:18,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:48:18,306 INFO L462 AbstractCegarLoop]: Abstraction has 24606 states and 107644 transitions. [2019-12-18 21:48:18,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:48:18,307 INFO L276 IsEmpty]: Start isEmpty. Operand 24606 states and 107644 transitions. [2019-12-18 21:48:18,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:48:18,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:18,314 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:48:18,315 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:18,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:18,315 INFO L82 PathProgramCache]: Analyzing trace with hash 2101467982, now seen corresponding path program 1 times [2019-12-18 21:48:18,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:18,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704610917] [2019-12-18 21:48:18,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:48:18,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:48:18,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704610917] [2019-12-18 21:48:18,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:48:18,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:48:18,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662698168] [2019-12-18 21:48:18,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:48:18,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:48:18,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:48:18,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:48:18,390 INFO L87 Difference]: Start difference. First operand 24606 states and 107644 transitions. Second operand 3 states. [2019-12-18 21:48:19,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:48:19,709 INFO L93 Difference]: Finished difference Result 19680 states and 80079 transitions. [2019-12-18 21:48:19,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:48:19,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 21:48:19,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:48:19,843 INFO L225 Difference]: With dead ends: 19680 [2019-12-18 21:48:19,843 INFO L226 Difference]: Without dead ends: 19680 [2019-12-18 21:48:19,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:48:20,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19680 states. [2019-12-18 21:48:20,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19680 to 19680. [2019-12-18 21:48:20,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19680 states. [2019-12-18 21:48:20,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19680 states to 19680 states and 80079 transitions. [2019-12-18 21:48:20,621 INFO L78 Accepts]: Start accepts. Automaton has 19680 states and 80079 transitions. Word has length 15 [2019-12-18 21:48:20,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:48:20,621 INFO L462 AbstractCegarLoop]: Abstraction has 19680 states and 80079 transitions. [2019-12-18 21:48:20,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:48:20,621 INFO L276 IsEmpty]: Start isEmpty. Operand 19680 states and 80079 transitions. [2019-12-18 21:48:20,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:48:20,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:20,625 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:48:20,625 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:20,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:20,625 INFO L82 PathProgramCache]: Analyzing trace with hash -740930963, now seen corresponding path program 1 times [2019-12-18 21:48:20,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:20,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142200321] [2019-12-18 21:48:20,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:48:20,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:48:20,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142200321] [2019-12-18 21:48:20,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:48:20,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:48:20,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203094348] [2019-12-18 21:48:20,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:48:20,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:48:20,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:48:20,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:48:20,702 INFO L87 Difference]: Start difference. First operand 19680 states and 80079 transitions. Second operand 4 states. [2019-12-18 21:48:20,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:48:20,774 INFO L93 Difference]: Finished difference Result 9128 states and 31583 transitions. [2019-12-18 21:48:20,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:48:20,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:48:20,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:48:20,798 INFO L225 Difference]: With dead ends: 9128 [2019-12-18 21:48:20,799 INFO L226 Difference]: Without dead ends: 9128 [2019-12-18 21:48:20,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:48:20,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9128 states. [2019-12-18 21:48:20,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9128 to 9128. [2019-12-18 21:48:20,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9128 states. [2019-12-18 21:48:21,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9128 states to 9128 states and 31583 transitions. [2019-12-18 21:48:21,026 INFO L78 Accepts]: Start accepts. Automaton has 9128 states and 31583 transitions. Word has length 16 [2019-12-18 21:48:21,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:48:21,027 INFO L462 AbstractCegarLoop]: Abstraction has 9128 states and 31583 transitions. [2019-12-18 21:48:21,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:48:21,027 INFO L276 IsEmpty]: Start isEmpty. Operand 9128 states and 31583 transitions. [2019-12-18 21:48:21,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 21:48:21,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:21,029 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:48:21,029 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:21,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:21,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1638469218, now seen corresponding path program 1 times [2019-12-18 21:48:21,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:21,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145881811] [2019-12-18 21:48:21,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:48:21,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:48:21,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145881811] [2019-12-18 21:48:21,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:48:21,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:48:21,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439674232] [2019-12-18 21:48:21,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:48:21,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:48:21,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:48:21,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:48:21,105 INFO L87 Difference]: Start difference. First operand 9128 states and 31583 transitions. Second operand 5 states. [2019-12-18 21:48:21,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:48:21,164 INFO L93 Difference]: Finished difference Result 2778 states and 8748 transitions. [2019-12-18 21:48:21,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:48:21,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 21:48:21,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:48:21,172 INFO L225 Difference]: With dead ends: 2778 [2019-12-18 21:48:21,172 INFO L226 Difference]: Without dead ends: 2778 [2019-12-18 21:48:21,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:48:21,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2019-12-18 21:48:21,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 2778. [2019-12-18 21:48:21,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2778 states. [2019-12-18 21:48:21,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2778 states to 2778 states and 8748 transitions. [2019-12-18 21:48:21,228 INFO L78 Accepts]: Start accepts. Automaton has 2778 states and 8748 transitions. Word has length 17 [2019-12-18 21:48:21,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:48:21,229 INFO L462 AbstractCegarLoop]: Abstraction has 2778 states and 8748 transitions. [2019-12-18 21:48:21,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:48:21,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2778 states and 8748 transitions. [2019-12-18 21:48:21,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 21:48:21,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:21,233 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:48:21,233 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:21,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:21,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1378718161, now seen corresponding path program 1 times [2019-12-18 21:48:21,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:21,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471064342] [2019-12-18 21:48:21,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:48:21,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:48:21,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471064342] [2019-12-18 21:48:21,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:48:21,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:48:21,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767070557] [2019-12-18 21:48:21,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:48:21,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:48:21,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:48:21,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:48:21,519 INFO L87 Difference]: Start difference. First operand 2778 states and 8748 transitions. Second operand 3 states. [2019-12-18 21:48:21,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:48:21,596 INFO L93 Difference]: Finished difference Result 4006 states and 12172 transitions. [2019-12-18 21:48:21,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:48:21,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 21:48:21,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:48:21,607 INFO L225 Difference]: With dead ends: 4006 [2019-12-18 21:48:21,607 INFO L226 Difference]: Without dead ends: 4006 [2019-12-18 21:48:21,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:48:21,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4006 states. [2019-12-18 21:48:21,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4006 to 3258. [2019-12-18 21:48:21,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3258 states. [2019-12-18 21:48:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3258 states to 3258 states and 10122 transitions. [2019-12-18 21:48:21,701 INFO L78 Accepts]: Start accepts. Automaton has 3258 states and 10122 transitions. Word has length 18 [2019-12-18 21:48:21,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:48:21,702 INFO L462 AbstractCegarLoop]: Abstraction has 3258 states and 10122 transitions. [2019-12-18 21:48:21,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:48:21,702 INFO L276 IsEmpty]: Start isEmpty. Operand 3258 states and 10122 transitions. [2019-12-18 21:48:21,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 21:48:21,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:21,705 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:48:21,705 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:21,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:21,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1378596424, now seen corresponding path program 1 times [2019-12-18 21:48:21,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:21,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564006814] [2019-12-18 21:48:21,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:48:21,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:48:21,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564006814] [2019-12-18 21:48:21,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:48:21,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:48:21,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567109645] [2019-12-18 21:48:21,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:48:21,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:48:21,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:48:21,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:48:21,799 INFO L87 Difference]: Start difference. First operand 3258 states and 10122 transitions. Second operand 4 states. [2019-12-18 21:48:21,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:48:21,963 INFO L93 Difference]: Finished difference Result 4136 states and 12556 transitions. [2019-12-18 21:48:21,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:48:21,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 21:48:21,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:48:21,972 INFO L225 Difference]: With dead ends: 4136 [2019-12-18 21:48:21,973 INFO L226 Difference]: Without dead ends: 4136 [2019-12-18 21:48:21,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:48:21,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4136 states. [2019-12-18 21:48:22,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4136 to 3930. [2019-12-18 21:48:22,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3930 states. [2019-12-18 21:48:22,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3930 states to 3930 states and 12106 transitions. [2019-12-18 21:48:22,066 INFO L78 Accepts]: Start accepts. Automaton has 3930 states and 12106 transitions. Word has length 18 [2019-12-18 21:48:22,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:48:22,066 INFO L462 AbstractCegarLoop]: Abstraction has 3930 states and 12106 transitions. [2019-12-18 21:48:22,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:48:22,066 INFO L276 IsEmpty]: Start isEmpty. Operand 3930 states and 12106 transitions. [2019-12-18 21:48:22,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 21:48:22,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:22,069 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:48:22,070 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:22,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:22,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1731664173, now seen corresponding path program 1 times [2019-12-18 21:48:22,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:22,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464134842] [2019-12-18 21:48:22,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:48:22,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:48:22,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464134842] [2019-12-18 21:48:22,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:48:22,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:48:22,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261987441] [2019-12-18 21:48:22,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:48:22,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:48:22,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:48:22,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:48:22,163 INFO L87 Difference]: Start difference. First operand 3930 states and 12106 transitions. Second operand 4 states. [2019-12-18 21:48:22,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:48:22,332 INFO L93 Difference]: Finished difference Result 4838 states and 14661 transitions. [2019-12-18 21:48:22,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:48:22,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 21:48:22,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:48:22,341 INFO L225 Difference]: With dead ends: 4838 [2019-12-18 21:48:22,342 INFO L226 Difference]: Without dead ends: 4838 [2019-12-18 21:48:22,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:48:22,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4838 states. [2019-12-18 21:48:22,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4838 to 4069. [2019-12-18 21:48:22,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4069 states. [2019-12-18 21:48:22,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4069 states to 4069 states and 12539 transitions. [2019-12-18 21:48:22,430 INFO L78 Accepts]: Start accepts. Automaton has 4069 states and 12539 transitions. Word has length 18 [2019-12-18 21:48:22,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:48:22,430 INFO L462 AbstractCegarLoop]: Abstraction has 4069 states and 12539 transitions. [2019-12-18 21:48:22,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:48:22,430 INFO L276 IsEmpty]: Start isEmpty. Operand 4069 states and 12539 transitions. [2019-12-18 21:48:22,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 21:48:22,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:22,440 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:48:22,441 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:22,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:22,441 INFO L82 PathProgramCache]: Analyzing trace with hash -819903788, now seen corresponding path program 1 times [2019-12-18 21:48:22,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:22,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333973996] [2019-12-18 21:48:22,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:48:22,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:48:22,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333973996] [2019-12-18 21:48:22,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:48:22,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:48:22,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184145604] [2019-12-18 21:48:22,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:48:22,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:48:22,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:48:22,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:48:22,526 INFO L87 Difference]: Start difference. First operand 4069 states and 12539 transitions. Second operand 6 states. [2019-12-18 21:48:22,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:48:22,624 INFO L93 Difference]: Finished difference Result 3144 states and 10159 transitions. [2019-12-18 21:48:22,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:48:22,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-18 21:48:22,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:48:22,635 INFO L225 Difference]: With dead ends: 3144 [2019-12-18 21:48:22,635 INFO L226 Difference]: Without dead ends: 3144 [2019-12-18 21:48:22,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:48:22,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3144 states. [2019-12-18 21:48:22,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3144 to 2944. [2019-12-18 21:48:22,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2944 states. [2019-12-18 21:48:22,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 9559 transitions. [2019-12-18 21:48:22,725 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 9559 transitions. Word has length 32 [2019-12-18 21:48:22,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:48:22,728 INFO L462 AbstractCegarLoop]: Abstraction has 2944 states and 9559 transitions. [2019-12-18 21:48:22,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:48:22,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 9559 transitions. [2019-12-18 21:48:22,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 21:48:22,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:22,745 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:48:22,746 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:22,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:22,746 INFO L82 PathProgramCache]: Analyzing trace with hash 579177876, now seen corresponding path program 1 times [2019-12-18 21:48:22,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:22,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364052014] [2019-12-18 21:48:22,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:48:22,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:48:22,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364052014] [2019-12-18 21:48:22,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:48:22,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:48:22,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513071783] [2019-12-18 21:48:22,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:48:22,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:48:22,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:48:22,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:48:22,922 INFO L87 Difference]: Start difference. First operand 2944 states and 9559 transitions. Second operand 4 states. [2019-12-18 21:48:22,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:48:22,954 INFO L93 Difference]: Finished difference Result 4140 states and 12859 transitions. [2019-12-18 21:48:22,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:48:22,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-18 21:48:22,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:48:22,961 INFO L225 Difference]: With dead ends: 4140 [2019-12-18 21:48:22,961 INFO L226 Difference]: Without dead ends: 2658 [2019-12-18 21:48:22,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:48:22,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2019-12-18 21:48:23,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2658. [2019-12-18 21:48:23,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2658 states. [2019-12-18 21:48:23,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 8505 transitions. [2019-12-18 21:48:23,018 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 8505 transitions. Word has length 47 [2019-12-18 21:48:23,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:48:23,018 INFO L462 AbstractCegarLoop]: Abstraction has 2658 states and 8505 transitions. [2019-12-18 21:48:23,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:48:23,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 8505 transitions. [2019-12-18 21:48:23,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 21:48:23,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:23,027 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:48:23,027 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:23,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:23,027 INFO L82 PathProgramCache]: Analyzing trace with hash -921349078, now seen corresponding path program 2 times [2019-12-18 21:48:23,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:23,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297906860] [2019-12-18 21:48:23,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:48:23,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:48:23,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297906860] [2019-12-18 21:48:23,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:48:23,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:48:23,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824546156] [2019-12-18 21:48:23,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:48:23,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:48:23,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:48:23,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:48:23,204 INFO L87 Difference]: Start difference. First operand 2658 states and 8505 transitions. Second operand 3 states. [2019-12-18 21:48:23,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:48:23,224 INFO L93 Difference]: Finished difference Result 3268 states and 9882 transitions. [2019-12-18 21:48:23,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:48:23,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-18 21:48:23,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:48:23,229 INFO L225 Difference]: With dead ends: 3268 [2019-12-18 21:48:23,229 INFO L226 Difference]: Without dead ends: 1930 [2019-12-18 21:48:23,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:48:23,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2019-12-18 21:48:23,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1930. [2019-12-18 21:48:23,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1930 states. [2019-12-18 21:48:23,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 5542 transitions. [2019-12-18 21:48:23,272 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 5542 transitions. Word has length 47 [2019-12-18 21:48:23,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:48:23,273 INFO L462 AbstractCegarLoop]: Abstraction has 1930 states and 5542 transitions. [2019-12-18 21:48:23,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:48:23,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 5542 transitions. [2019-12-18 21:48:23,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 21:48:23,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:23,280 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:48:23,280 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:23,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:23,280 INFO L82 PathProgramCache]: Analyzing trace with hash -46543648, now seen corresponding path program 3 times [2019-12-18 21:48:23,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:23,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887805554] [2019-12-18 21:48:23,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:48:23,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:48:23,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887805554] [2019-12-18 21:48:23,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:48:23,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:48:23,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304145779] [2019-12-18 21:48:23,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:48:23,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:48:23,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:48:23,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:48:23,400 INFO L87 Difference]: Start difference. First operand 1930 states and 5542 transitions. Second operand 3 states. [2019-12-18 21:48:23,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:48:23,415 INFO L93 Difference]: Finished difference Result 2372 states and 6561 transitions. [2019-12-18 21:48:23,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:48:23,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-18 21:48:23,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:48:23,418 INFO L225 Difference]: With dead ends: 2372 [2019-12-18 21:48:23,418 INFO L226 Difference]: Without dead ends: 490 [2019-12-18 21:48:23,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:48:23,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-12-18 21:48:23,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2019-12-18 21:48:23,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-12-18 21:48:23,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1104 transitions. [2019-12-18 21:48:23,427 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1104 transitions. Word has length 47 [2019-12-18 21:48:23,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:48:23,427 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 1104 transitions. [2019-12-18 21:48:23,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:48:23,428 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1104 transitions. [2019-12-18 21:48:23,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 21:48:23,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:23,429 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:48:23,430 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:23,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:23,430 INFO L82 PathProgramCache]: Analyzing trace with hash 146962906, now seen corresponding path program 4 times [2019-12-18 21:48:23,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:23,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399401350] [2019-12-18 21:48:23,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:48:23,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:48:23,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399401350] [2019-12-18 21:48:23,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:48:23,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:48:23,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965744202] [2019-12-18 21:48:23,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:48:23,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:48:23,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:48:23,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:48:23,547 INFO L87 Difference]: Start difference. First operand 490 states and 1104 transitions. Second operand 7 states. [2019-12-18 21:48:23,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:48:23,734 INFO L93 Difference]: Finished difference Result 890 states and 1958 transitions. [2019-12-18 21:48:23,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:48:23,735 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-18 21:48:23,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:48:23,736 INFO L225 Difference]: With dead ends: 890 [2019-12-18 21:48:23,736 INFO L226 Difference]: Without dead ends: 604 [2019-12-18 21:48:23,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:48:23,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-12-18 21:48:23,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 546. [2019-12-18 21:48:23,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-12-18 21:48:23,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1193 transitions. [2019-12-18 21:48:23,748 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1193 transitions. Word has length 47 [2019-12-18 21:48:23,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:48:23,749 INFO L462 AbstractCegarLoop]: Abstraction has 546 states and 1193 transitions. [2019-12-18 21:48:23,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:48:23,749 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1193 transitions. [2019-12-18 21:48:23,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 21:48:23,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:23,751 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:48:23,752 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:23,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:23,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1762247142, now seen corresponding path program 5 times [2019-12-18 21:48:23,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:23,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186043985] [2019-12-18 21:48:23,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:48:23,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:48:23,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186043985] [2019-12-18 21:48:23,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:48:23,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:48:23,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404658560] [2019-12-18 21:48:23,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:48:23,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:48:23,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:48:23,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:48:23,887 INFO L87 Difference]: Start difference. First operand 546 states and 1193 transitions. Second operand 3 states. [2019-12-18 21:48:23,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:48:23,900 INFO L93 Difference]: Finished difference Result 546 states and 1191 transitions. [2019-12-18 21:48:23,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:48:23,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-18 21:48:23,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:48:23,901 INFO L225 Difference]: With dead ends: 546 [2019-12-18 21:48:23,901 INFO L226 Difference]: Without dead ends: 546 [2019-12-18 21:48:23,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:48:23,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-12-18 21:48:23,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 546. [2019-12-18 21:48:23,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-12-18 21:48:23,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1191 transitions. [2019-12-18 21:48:23,910 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1191 transitions. Word has length 47 [2019-12-18 21:48:23,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:48:23,911 INFO L462 AbstractCegarLoop]: Abstraction has 546 states and 1191 transitions. [2019-12-18 21:48:23,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:48:23,911 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1191 transitions. [2019-12-18 21:48:23,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 21:48:23,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:23,913 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:48:23,913 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:23,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:23,913 INFO L82 PathProgramCache]: Analyzing trace with hash 317472309, now seen corresponding path program 1 times [2019-12-18 21:48:23,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:23,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63329769] [2019-12-18 21:48:23,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:48:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:48:24,050 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:48:24,050 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:48:24,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= 0 v_~z$r_buff1_thd3~0_40) (= 0 v_~z$w_buff1~0_25) (= v_~y~0_18 0) (= 0 v_~z$r_buff1_thd0~0_24) (= 0 v_~z$r_buff1_thd1~0_10) (= 0 v_~weak$$choice0~0_9) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1421~0.base_24|)) (= v_~z$r_buff0_thd0~0_20 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1421~0.base_24| 4)) (= v_~z~0_22 0) (= v_~z$r_buff0_thd4~0_25 0) (= v_~z$r_buff0_thd2~0_8 0) (= v_~main$tmp_guard0~0_8 0) (= v_~z$read_delayed~0_6 0) (= v_~z$read_delayed_var~0.base_8 0) (= 0 v_~weak$$choice2~0_34) (= 0 v_~z$r_buff1_thd4~0_18) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t1421~0.base_24| 1)) (= 0 v_~__unbuffered_p3_EAX~0_16) (= v_~z$w_buff0_used~0_97 0) (= 0 v_~__unbuffered_cnt~0_26) (= 0 v_~z$flush_delayed~0_14) (= 0 v_~z$r_buff1_thd2~0_10) (= 0 |v_ULTIMATE.start_main_~#t1421~0.offset_19|) (= |v_#memory_int_25| (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1421~0.base_24| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1421~0.base_24|) |v_ULTIMATE.start_main_~#t1421~0.offset_19| 0))) (= 0 |v_#NULL.base_4|) (= v_~a~0_10 0) (= 0 v_~__unbuffered_p2_EAX~0_15) (= v_~z$r_buff0_thd1~0_9 0) (= v_~z$mem_tmp~0_10 0) (< 0 |v_#StackHeapBarrier_20|) (= v_~x~0_20 0) (= |v_#NULL.offset_4| 0) (= v_~z$r_buff0_thd3~0_67 0) (= 0 v_~z$w_buff0~0_29) (= 0 v_~z$w_buff1_used~0_57) (= v_~z$read_delayed_var~0.offset_8 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1421~0.base_24|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t1424~0.base=|v_ULTIMATE.start_main_~#t1424~0.base_19|, ULTIMATE.start_main_~#t1423~0.offset=|v_ULTIMATE.start_main_~#t1423~0.offset_16|, ~a~0=v_~a~0_10, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ULTIMATE.start_main_~#t1421~0.base=|v_ULTIMATE.start_main_~#t1421~0.base_24|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_25, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_57, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~x~0=v_~x~0_20, ULTIMATE.start_main_~#t1424~0.offset=|v_ULTIMATE.start_main_~#t1424~0.offset_15|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_18, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_8|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t1421~0.offset=|v_ULTIMATE.start_main_~#t1421~0.offset_19|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ULTIMATE.start_main_~#t1423~0.base=|v_ULTIMATE.start_main_~#t1423~0.base_22|, ~y~0=v_~y~0_18, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_97, ~z$w_buff0~0=v_~z$w_buff0~0_29, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_40, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_25|, ~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_9, ULTIMATE.start_main_~#t1422~0.offset=|v_ULTIMATE.start_main_~#t1422~0.offset_19|, ULTIMATE.start_main_~#t1422~0.base=|v_ULTIMATE.start_main_~#t1422~0.base_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1424~0.base, ULTIMATE.start_main_~#t1423~0.offset, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t1421~0.base, ~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, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1424~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_~#t1421~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1423~0.base, ~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, #NULL.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t1422~0.offset, ULTIMATE.start_main_~#t1422~0.base] because there is no mapped edge [2019-12-18 21:48:24,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L831-1-->L833: Formula: (and (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1422~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1422~0.offset_11|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1422~0.base_12| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1422~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1422~0.base_12|) |v_ULTIMATE.start_main_~#t1422~0.offset_11| 1)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1422~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t1422~0.base_12| 0)) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1422~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1422~0.offset=|v_ULTIMATE.start_main_~#t1422~0.offset_11|, ULTIMATE.start_main_~#t1422~0.base=|v_ULTIMATE.start_main_~#t1422~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1422~0.offset, ULTIMATE.start_main_~#t1422~0.base] because there is no mapped edge [2019-12-18 21:48:24,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L833-1-->L835: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1423~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t1423~0.offset_10|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1423~0.base_11| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1423~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1423~0.base_11|) |v_ULTIMATE.start_main_~#t1423~0.offset_10| 2)) |v_#memory_int_15|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1423~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t1423~0.base_11|)) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1423~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1423~0.offset=|v_ULTIMATE.start_main_~#t1423~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t1423~0.base=|v_ULTIMATE.start_main_~#t1423~0.base_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_15|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1423~0.offset, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1423~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 21:48:24,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L835-1-->L837: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1424~0.offset_10|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1424~0.base_12|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1424~0.base_12| 4)) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1424~0.base_12|) 0) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1424~0.base_12| 1) |v_#valid_48|) (not (= |v_ULTIMATE.start_main_~#t1424~0.base_12| 0)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1424~0.base_12| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1424~0.base_12|) |v_ULTIMATE.start_main_~#t1424~0.offset_10| 3)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1424~0.offset=|v_ULTIMATE.start_main_~#t1424~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1424~0.base=|v_ULTIMATE.start_main_~#t1424~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1424~0.offset, ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1424~0.base] because there is no mapped edge [2019-12-18 21:48:24,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] P3ENTRY-->L4-3: Formula: (and (= (mod v_~z$w_buff1_used~0_38 256) 0) (= v_P3Thread1of1ForFork1_~arg.base_5 |v_P3Thread1of1ForFork1_#in~arg.base_5|) (= 1 v_~z$w_buff0~0_17) (= v_~z$w_buff0_used~0_62 1) (= v_~z$w_buff0_used~0_63 v_~z$w_buff1_used~0_38) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_7) (= |v_P3Thread1of1ForFork1_#in~arg.offset_5| v_P3Thread1of1ForFork1_~arg.offset_5) (= v_~z$w_buff0~0_18 v_~z$w_buff1~0_15)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_63, ~z$w_buff0~0=v_~z$w_buff0~0_18, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_5|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_5|} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_62, ~z$w_buff0~0=v_~z$w_buff0~0_17, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_5|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_38, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, ~z$w_buff1~0=v_~z$w_buff1~0_15, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_5, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_5|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression, ~z$w_buff1~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 21:48:24,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork2_~arg.base_4 |v_P0Thread1of1ForFork2_#in~arg.base_4|) (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= v_~x~0_10 1) (= 1 v_~a~0_7) (= v_P0Thread1of1ForFork2_~arg.offset_4 |v_P0Thread1of1ForFork2_#in~arg.offset_4|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|} OutVars{~a~0=v_~a~0_7, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_4, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_10, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_4} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-18 21:48:24,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork3_#res.base_5|) (= 2 v_~x~0_8) (= 0 |v_P1Thread1of1ForFork3_#res.offset_5|) (= 1 v_~y~0_7) (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_5|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_5, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_5, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~y~0=v_~y~0_7, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~y~0, ~x~0] because there is no mapped edge [2019-12-18 21:48:24,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In710931429 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In710931429 256)))) (or (and (= 0 |P3Thread1of1ForFork1_#t~ite28_Out710931429|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In710931429 |P3Thread1of1ForFork1_#t~ite28_Out710931429|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In710931429, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In710931429} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In710931429, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out710931429|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In710931429} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 21:48:24,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-456446531 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-456446531 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-456446531 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-456446531 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork1_#t~ite29_Out-456446531| ~z$w_buff1_used~0_In-456446531)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P3Thread1of1ForFork1_#t~ite29_Out-456446531| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-456446531, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-456446531, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-456446531, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-456446531} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-456446531, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out-456446531|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-456446531, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-456446531, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-456446531} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-18 21:48:24,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L811-->L812: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1642455949 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1642455949 256) 0))) (or (and (= ~z$r_buff0_thd4~0_Out1642455949 ~z$r_buff0_thd4~0_In1642455949) (or .cse0 .cse1)) (and (not .cse0) (= ~z$r_buff0_thd4~0_Out1642455949 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1642455949, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1642455949} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1642455949, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1642455949, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out1642455949|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 21:48:24,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L812-->L812-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In1715981130 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In1715981130 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1715981130 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In1715981130 256) 0))) (or (and (= 0 |P3Thread1of1ForFork1_#t~ite31_Out1715981130|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$r_buff1_thd4~0_In1715981130 |P3Thread1of1ForFork1_#t~ite31_Out1715981130|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1715981130, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1715981130, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1715981130, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1715981130} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1715981130, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1715981130, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1715981130, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1715981130, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out1715981130|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 21:48:24,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L812-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd4~0_12 |v_P3Thread1of1ForFork1_#t~ite31_8|) (= |v_P3Thread1of1ForFork1_#res.base_5| 0) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_8|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_12, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_5|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_7|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 21:48:24,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L773-->L773-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-473754094 256)))) (or (and (= ~z$w_buff1~0_In-473754094 |P2Thread1of1ForFork0_#t~ite11_Out-473754094|) (= |P2Thread1of1ForFork0_#t~ite12_Out-473754094| |P2Thread1of1ForFork0_#t~ite11_Out-473754094|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-473754094 256)))) (or (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-473754094 256))) (and .cse0 (= (mod ~z$r_buff1_thd3~0_In-473754094 256) 0)) (= (mod ~z$w_buff0_used~0_In-473754094 256) 0))) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite12_Out-473754094| ~z$w_buff1~0_In-473754094) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite11_In-473754094| |P2Thread1of1ForFork0_#t~ite11_Out-473754094|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-473754094, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_In-473754094|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-473754094, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-473754094, ~z$w_buff1~0=~z$w_buff1~0_In-473754094, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-473754094, ~weak$$choice2~0=~weak$$choice2~0_In-473754094} OutVars{P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-473754094|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-473754094, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-473754094|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-473754094, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-473754094, ~z$w_buff1~0=~z$w_buff1~0_In-473754094, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-473754094, ~weak$$choice2~0=~weak$$choice2~0_In-473754094} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11, P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 21:48:24,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L776-->L777: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~z$r_buff0_thd3~0_56 v_~z$r_buff0_thd3~0_55)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_56, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_55, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_7|, ~weak$$choice2~0=v_~weak$$choice2~0_25, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-18 21:48:24,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L779-->L787: Formula: (and (= (+ 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) (= v_~z~0_15 v_~z$mem_tmp~0_4)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 21:48:24,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L837-1-->L843: Formula: (and (= 4 v_~__unbuffered_cnt~0_11) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:48:24,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L843-2-->L843-5: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In1748935014 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite37_Out1748935014| |ULTIMATE.start_main_#t~ite36_Out1748935014|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1748935014 256)))) (or (and .cse0 (= ~z~0_In1748935014 |ULTIMATE.start_main_#t~ite36_Out1748935014|) (or .cse1 .cse2)) (and (not .cse2) .cse0 (not .cse1) (= ~z$w_buff1~0_In1748935014 |ULTIMATE.start_main_#t~ite36_Out1748935014|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1748935014, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1748935014, ~z$w_buff1~0=~z$w_buff1~0_In1748935014, ~z~0=~z~0_In1748935014} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1748935014, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1748935014, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1748935014|, ~z$w_buff1~0=~z$w_buff1~0_In1748935014, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1748935014|, ~z~0=~z~0_In1748935014} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 21:48:24,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L844-->L844-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In208228926 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In208228926 256) 0))) (or (and (= ~z$w_buff0_used~0_In208228926 |ULTIMATE.start_main_#t~ite38_Out208228926|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out208228926| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In208228926, ~z$w_buff0_used~0=~z$w_buff0_used~0_In208228926} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In208228926, ~z$w_buff0_used~0=~z$w_buff0_used~0_In208228926, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out208228926|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 21:48:24,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L845-->L845-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-20341577 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-20341577 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-20341577 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-20341577 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out-20341577| 0)) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-20341577 |ULTIMATE.start_main_#t~ite39_Out-20341577|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-20341577, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-20341577, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-20341577, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-20341577} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-20341577, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-20341577|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-20341577, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-20341577, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-20341577} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 21:48:24,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1018643653 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1018643653 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-1018643653| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1018643653 |ULTIMATE.start_main_#t~ite40_Out-1018643653|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1018643653, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1018643653} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1018643653, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1018643653|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1018643653} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 21:48:24,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L847-->L847-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In1579595406 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1579595406 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1579595406 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1579595406 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out1579595406| ~z$r_buff1_thd0~0_In1579595406) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite41_Out1579595406| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1579595406, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1579595406, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1579595406, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1579595406} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1579595406|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1579595406, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1579595406, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1579595406, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1579595406} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 21:48:24,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L847-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 2 v_~y~0_9) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9| (mod v_~main$tmp_guard1~0_8 256)) (= v_~main$tmp_guard1~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0) (= v_~__unbuffered_p2_EAX~0_8 0) (= 0 v_~__unbuffered_p3_EAX~0_9) (= |v_ULTIMATE.start_main_#t~ite41_11| v_~z$r_buff1_thd0~0_16) (= v_~x~0_11 2)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_9, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_9, ~x~0=v_~x~0_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:48:24,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:48:24 BasicIcfg [2019-12-18 21:48:24,187 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:48:24,190 INFO L168 Benchmark]: Toolchain (without parser) took 16899.41 ms. Allocated memory was 137.4 MB in the beginning and 870.3 MB in the end (delta: 733.0 MB). Free memory was 100.9 MB in the beginning and 444.0 MB in the end (delta: -343.1 MB). Peak memory consumption was 389.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:48:24,191 INFO L168 Benchmark]: CDTParser took 1.54 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 21:48:24,191 INFO L168 Benchmark]: CACSL2BoogieTranslator took 787.25 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.7 MB in the beginning and 155.8 MB in the end (delta: -55.1 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:48:24,192 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.64 ms. Allocated memory is still 201.9 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:48:24,196 INFO L168 Benchmark]: Boogie Preprocessor took 51.92 ms. Allocated memory is still 201.9 MB. Free memory was 153.1 MB in the beginning and 150.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:48:24,198 INFO L168 Benchmark]: RCFGBuilder took 768.33 ms. Allocated memory is still 201.9 MB. Free memory was 150.4 MB in the beginning and 105.0 MB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:48:24,199 INFO L168 Benchmark]: TraceAbstraction took 15219.50 ms. Allocated memory was 201.9 MB in the beginning and 870.3 MB in the end (delta: 668.5 MB). Free memory was 105.0 MB in the beginning and 444.0 MB in the end (delta: -339.1 MB). Peak memory consumption was 329.4 MB. Max. memory is 7.1 GB. [2019-12-18 21:48:24,205 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.54 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 787.25 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.7 MB in the beginning and 155.8 MB in the end (delta: -55.1 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.64 ms. Allocated memory is still 201.9 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.92 ms. Allocated memory is still 201.9 MB. Free memory was 153.1 MB in the beginning and 150.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 768.33 ms. Allocated memory is still 201.9 MB. Free memory was 150.4 MB in the beginning and 105.0 MB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15219.50 ms. Allocated memory was 201.9 MB in the beginning and 870.3 MB in the end (delta: 668.5 MB). Free memory was 105.0 MB in the beginning and 444.0 MB in the end (delta: -339.1 MB). Peak memory consumption was 329.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 167 ProgramPointsBefore, 79 ProgramPointsAfterwards, 189 TransitionsBefore, 87 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 19 ChoiceCompositions, 5341 VarBasedMoverChecksPositive, 131 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 50569 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t1421, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0: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] [L833] FCALL, FORK 0 pthread_create(&t1422, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0: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] [L835] FCALL, FORK 0 pthread_create(&t1423, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L837] FCALL, FORK 0 pthread_create(&t1424, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L797] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L798] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L799] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L800] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L801] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L802] 4 z$r_buff0_thd4 = (_Bool)1 [L805] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L808] 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_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L764] 3 y = 2 [L767] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 3 z$flush_delayed = weak$$choice2 [L770] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, 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] [L771] 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_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, 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] [L808] 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) [L809] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L810] 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 [L771] 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) [L772] EXPR 3 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, 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))=1, x=2, y=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L772] 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)) [L773] 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)) [L774] 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=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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))=0, x=2, y=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 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)) [L775] 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=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 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)) [L777] 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=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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=2, y=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L777] 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)) [L778] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L843] EXPR 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_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L844] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L845] 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 [L846] 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, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.8s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1428 SDtfs, 1623 SDslu, 1983 SDs, 0 SdLazy, 499 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27134occurred 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: 2.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 1981 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 426 NumberOfCodeBlocks, 426 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 365 ConstructedInterpolants, 0 QuantifiedInterpolants, 33649 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...