/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix032_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:19:36,955 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:19:36,959 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:19:36,973 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:19:36,973 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:19:36,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:19:36,976 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:19:36,978 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:19:36,979 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:19:36,980 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:19:36,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:19:36,982 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:19:36,983 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:19:36,984 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:19:36,985 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:19:36,986 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:19:36,987 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:19:36,988 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:19:36,989 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:19:36,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:19:36,993 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:19:36,994 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:19:36,995 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:19:36,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:19:36,998 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:19:36,999 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:19:36,999 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:19:37,000 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:19:37,000 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:19:37,001 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:19:37,002 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:19:37,002 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:19:37,003 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:19:37,004 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:19:37,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:19:37,005 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:19:37,006 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:19:37,006 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:19:37,006 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:19:37,007 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:19:37,008 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:19:37,009 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:19:37,026 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:19:37,027 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:19:37,029 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:19:37,030 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:19:37,030 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:19:37,030 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:19:37,030 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:19:37,030 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:19:37,031 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:19:37,031 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:19:37,032 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:19:37,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:19:37,032 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:19:37,033 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:19:37,033 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:19:37,033 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:19:37,033 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:19:37,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:19:37,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:19:37,034 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:19:37,035 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:19:37,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:19:37,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:19:37,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:19:37,036 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:19:37,036 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:19:37,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:19:37,036 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:19:37,036 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:19:37,037 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:19:37,335 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:19:37,355 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:19:37,358 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:19:37,359 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:19:37,360 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:19:37,361 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032_power.opt.i [2019-12-26 22:19:37,429 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c5cce03a/fb15555433804c8d980fd6b52c27c8fe/FLAG76b89873d [2019-12-26 22:19:38,004 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:19:38,006 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_power.opt.i [2019-12-26 22:19:38,029 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c5cce03a/fb15555433804c8d980fd6b52c27c8fe/FLAG76b89873d [2019-12-26 22:19:38,233 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c5cce03a/fb15555433804c8d980fd6b52c27c8fe [2019-12-26 22:19:38,244 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:19:38,246 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:19:38,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:19:38,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:19:38,251 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:19:38,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:19:38" (1/1) ... [2019-12-26 22:19:38,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@166c5411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:38, skipping insertion in model container [2019-12-26 22:19:38,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:19:38" (1/1) ... [2019-12-26 22:19:38,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:19:38,323 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:19:38,907 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:19:38,920 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:19:38,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:19:39,057 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:19:39,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:39 WrapperNode [2019-12-26 22:19:39,059 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:19:39,060 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:19:39,060 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:19:39,060 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:19:39,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:39" (1/1) ... [2019-12-26 22:19:39,099 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:39" (1/1) ... [2019-12-26 22:19:39,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:19:39,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:19:39,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:19:39,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:19:39,158 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:39" (1/1) ... [2019-12-26 22:19:39,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:39" (1/1) ... [2019-12-26 22:19:39,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:39" (1/1) ... [2019-12-26 22:19:39,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:39" (1/1) ... [2019-12-26 22:19:39,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:39" (1/1) ... [2019-12-26 22:19:39,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:39" (1/1) ... [2019-12-26 22:19:39,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:39" (1/1) ... [2019-12-26 22:19:39,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:19:39,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:19:39,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:19:39,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:19:39,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:39" (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-26 22:19:39,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:19:39,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:19:39,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:19:39,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:19:39,287 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:19:39,288 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:19:39,288 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:19:39,289 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:19:39,289 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:19:39,290 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:19:39,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:19:39,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:19:39,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:19:39,293 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:19:40,122 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:19:40,123 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:19:40,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:19:40 BoogieIcfgContainer [2019-12-26 22:19:40,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:19:40,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:19:40,126 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:19:40,129 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:19:40,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:19:38" (1/3) ... [2019-12-26 22:19:40,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@549173bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:19:40, skipping insertion in model container [2019-12-26 22:19:40,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:39" (2/3) ... [2019-12-26 22:19:40,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@549173bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:19:40, skipping insertion in model container [2019-12-26 22:19:40,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:19:40" (3/3) ... [2019-12-26 22:19:40,132 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_power.opt.i [2019-12-26 22:19:40,143 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:19:40,143 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:19:40,151 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:19:40,152 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:19:40,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,196 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,197 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,200 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,200 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,225 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,225 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,225 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,226 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,226 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,237 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,238 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,239 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,243 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,243 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,247 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,266 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:40,283 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 22:19:40,303 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:19:40,303 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:19:40,303 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:19:40,303 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:19:40,304 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:19:40,304 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:19:40,304 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:19:40,304 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:19:40,321 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 181 transitions [2019-12-26 22:19:40,323 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 156 places, 181 transitions [2019-12-26 22:19:40,416 INFO L132 PetriNetUnfolder]: 35/178 cut-off events. [2019-12-26 22:19:40,416 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:19:40,432 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 178 events. 35/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/141 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-26 22:19:40,450 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 156 places, 181 transitions [2019-12-26 22:19:40,495 INFO L132 PetriNetUnfolder]: 35/178 cut-off events. [2019-12-26 22:19:40,495 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:19:40,500 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 178 events. 35/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/141 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-26 22:19:40,514 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-26 22:19:40,516 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:19:44,649 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-26 22:19:44,807 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-26 22:19:45,158 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-26 22:19:45,291 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-26 22:19:45,312 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50265 [2019-12-26 22:19:45,313 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-26 22:19:45,316 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 85 transitions [2019-12-26 22:19:46,097 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14534 states. [2019-12-26 22:19:46,099 INFO L276 IsEmpty]: Start isEmpty. Operand 14534 states. [2019-12-26 22:19:46,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-26 22:19:46,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:46,106 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:19:46,106 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:46,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:46,111 INFO L82 PathProgramCache]: Analyzing trace with hash 104230949, now seen corresponding path program 1 times [2019-12-26 22:19:46,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:46,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665738919] [2019-12-26 22:19:46,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:46,409 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-26 22:19:46,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665738919] [2019-12-26 22:19:46,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:46,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:19:46,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324886122] [2019-12-26 22:19:46,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:19:46,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:46,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:19:46,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:19:46,437 INFO L87 Difference]: Start difference. First operand 14534 states. Second operand 3 states. [2019-12-26 22:19:46,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:46,832 INFO L93 Difference]: Finished difference Result 14182 states and 55174 transitions. [2019-12-26 22:19:46,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:19:46,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-26 22:19:46,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:46,975 INFO L225 Difference]: With dead ends: 14182 [2019-12-26 22:19:46,975 INFO L226 Difference]: Without dead ends: 13350 [2019-12-26 22:19:46,977 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-26 22:19:47,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13350 states. [2019-12-26 22:19:47,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13350 to 13350. [2019-12-26 22:19:47,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13350 states. [2019-12-26 22:19:47,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13350 states to 13350 states and 51860 transitions. [2019-12-26 22:19:47,770 INFO L78 Accepts]: Start accepts. Automaton has 13350 states and 51860 transitions. Word has length 7 [2019-12-26 22:19:47,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:47,771 INFO L462 AbstractCegarLoop]: Abstraction has 13350 states and 51860 transitions. [2019-12-26 22:19:47,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:19:47,772 INFO L276 IsEmpty]: Start isEmpty. Operand 13350 states and 51860 transitions. [2019-12-26 22:19:47,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:19:47,784 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:47,784 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:19:47,784 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:47,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:47,785 INFO L82 PathProgramCache]: Analyzing trace with hash 27609139, now seen corresponding path program 1 times [2019-12-26 22:19:47,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:47,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179908043] [2019-12-26 22:19:47,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:47,902 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-26 22:19:47,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179908043] [2019-12-26 22:19:47,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:47,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:19:47,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945148789] [2019-12-26 22:19:47,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:19:47,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:47,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:19:47,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:19:47,906 INFO L87 Difference]: Start difference. First operand 13350 states and 51860 transitions. Second operand 3 states. [2019-12-26 22:19:48,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:48,053 INFO L93 Difference]: Finished difference Result 7974 states and 27125 transitions. [2019-12-26 22:19:48,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:19:48,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 22:19:48,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:48,089 INFO L225 Difference]: With dead ends: 7974 [2019-12-26 22:19:48,089 INFO L226 Difference]: Without dead ends: 7974 [2019-12-26 22:19:48,090 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-26 22:19:48,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7974 states. [2019-12-26 22:19:48,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7974 to 7974. [2019-12-26 22:19:48,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7974 states. [2019-12-26 22:19:48,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7974 states to 7974 states and 27125 transitions. [2019-12-26 22:19:48,370 INFO L78 Accepts]: Start accepts. Automaton has 7974 states and 27125 transitions. Word has length 13 [2019-12-26 22:19:48,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:48,371 INFO L462 AbstractCegarLoop]: Abstraction has 7974 states and 27125 transitions. [2019-12-26 22:19:48,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:19:48,371 INFO L276 IsEmpty]: Start isEmpty. Operand 7974 states and 27125 transitions. [2019-12-26 22:19:48,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 22:19:48,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:48,373 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:19:48,373 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:48,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:48,374 INFO L82 PathProgramCache]: Analyzing trace with hash 192037431, now seen corresponding path program 1 times [2019-12-26 22:19:48,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:48,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065516045] [2019-12-26 22:19:48,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:48,423 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-26 22:19:48,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065516045] [2019-12-26 22:19:48,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:48,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:19:48,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807718964] [2019-12-26 22:19:48,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:19:48,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:48,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:19:48,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:19:48,425 INFO L87 Difference]: Start difference. First operand 7974 states and 27125 transitions. Second operand 4 states. [2019-12-26 22:19:48,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:48,467 INFO L93 Difference]: Finished difference Result 1840 states and 5044 transitions. [2019-12-26 22:19:48,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:19:48,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 22:19:48,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:48,475 INFO L225 Difference]: With dead ends: 1840 [2019-12-26 22:19:48,475 INFO L226 Difference]: Without dead ends: 1840 [2019-12-26 22:19:48,476 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-26 22:19:48,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2019-12-26 22:19:49,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1840. [2019-12-26 22:19:49,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1840 states. [2019-12-26 22:19:49,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 5044 transitions. [2019-12-26 22:19:49,022 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 5044 transitions. Word has length 14 [2019-12-26 22:19:49,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:49,023 INFO L462 AbstractCegarLoop]: Abstraction has 1840 states and 5044 transitions. [2019-12-26 22:19:49,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:19:49,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 5044 transitions. [2019-12-26 22:19:49,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:19:49,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:49,024 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:19:49,025 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:49,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:49,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1189360442, now seen corresponding path program 1 times [2019-12-26 22:19:49,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:49,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134572510] [2019-12-26 22:19:49,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:49,072 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-26 22:19:49,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134572510] [2019-12-26 22:19:49,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:49,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:19:49,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535203853] [2019-12-26 22:19:49,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:19:49,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:49,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:19:49,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:19:49,074 INFO L87 Difference]: Start difference. First operand 1840 states and 5044 transitions. Second operand 3 states. [2019-12-26 22:19:49,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:49,149 INFO L93 Difference]: Finished difference Result 2653 states and 7081 transitions. [2019-12-26 22:19:49,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:19:49,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-26 22:19:49,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:49,157 INFO L225 Difference]: With dead ends: 2653 [2019-12-26 22:19:49,157 INFO L226 Difference]: Without dead ends: 2653 [2019-12-26 22:19:49,158 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-26 22:19:49,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2019-12-26 22:19:49,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 2071. [2019-12-26 22:19:49,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2019-12-26 22:19:49,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 5594 transitions. [2019-12-26 22:19:49,218 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 5594 transitions. Word has length 16 [2019-12-26 22:19:49,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:49,219 INFO L462 AbstractCegarLoop]: Abstraction has 2071 states and 5594 transitions. [2019-12-26 22:19:49,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:19:49,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 5594 transitions. [2019-12-26 22:19:49,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:19:49,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:49,221 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:19:49,221 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:49,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:49,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1189225003, now seen corresponding path program 1 times [2019-12-26 22:19:49,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:49,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787481306] [2019-12-26 22:19:49,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:49,327 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-26 22:19:49,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787481306] [2019-12-26 22:19:49,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:49,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:19:49,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356530980] [2019-12-26 22:19:49,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:19:49,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:49,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:19:49,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:19:49,330 INFO L87 Difference]: Start difference. First operand 2071 states and 5594 transitions. Second operand 4 states. [2019-12-26 22:19:49,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:49,492 INFO L93 Difference]: Finished difference Result 2647 states and 6980 transitions. [2019-12-26 22:19:49,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:19:49,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:19:49,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:49,500 INFO L225 Difference]: With dead ends: 2647 [2019-12-26 22:19:49,500 INFO L226 Difference]: Without dead ends: 2647 [2019-12-26 22:19:49,500 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-26 22:19:49,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2019-12-26 22:19:49,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 2439. [2019-12-26 22:19:49,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2439 states. [2019-12-26 22:19:49,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2439 states to 2439 states and 6530 transitions. [2019-12-26 22:19:49,564 INFO L78 Accepts]: Start accepts. Automaton has 2439 states and 6530 transitions. Word has length 16 [2019-12-26 22:19:49,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:49,565 INFO L462 AbstractCegarLoop]: Abstraction has 2439 states and 6530 transitions. [2019-12-26 22:19:49,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:19:49,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2439 states and 6530 transitions. [2019-12-26 22:19:49,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:19:49,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:49,566 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:19:49,567 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:49,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:49,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1055623133, now seen corresponding path program 1 times [2019-12-26 22:19:49,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:49,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365618894] [2019-12-26 22:19:49,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:49,650 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-26 22:19:49,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365618894] [2019-12-26 22:19:49,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:49,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:19:49,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526110176] [2019-12-26 22:19:49,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:19:49,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:49,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:19:49,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:19:49,653 INFO L87 Difference]: Start difference. First operand 2439 states and 6530 transitions. Second operand 4 states. [2019-12-26 22:19:49,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:49,822 INFO L93 Difference]: Finished difference Result 3088 states and 8135 transitions. [2019-12-26 22:19:49,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:19:49,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:19:49,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:49,834 INFO L225 Difference]: With dead ends: 3088 [2019-12-26 22:19:49,834 INFO L226 Difference]: Without dead ends: 3088 [2019-12-26 22:19:49,835 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-26 22:19:49,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2019-12-26 22:19:49,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 2576. [2019-12-26 22:19:49,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2576 states. [2019-12-26 22:19:49,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2576 states and 6902 transitions. [2019-12-26 22:19:49,935 INFO L78 Accepts]: Start accepts. Automaton has 2576 states and 6902 transitions. Word has length 16 [2019-12-26 22:19:49,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:49,935 INFO L462 AbstractCegarLoop]: Abstraction has 2576 states and 6902 transitions. [2019-12-26 22:19:49,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:19:49,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2576 states and 6902 transitions. [2019-12-26 22:19:49,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 22:19:49,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:49,941 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] [2019-12-26 22:19:49,941 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:49,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:49,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1556871702, now seen corresponding path program 1 times [2019-12-26 22:19:49,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:49,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968787833] [2019-12-26 22:19:49,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:50,035 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-26 22:19:50,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968787833] [2019-12-26 22:19:50,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:50,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:19:50,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915424093] [2019-12-26 22:19:50,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:19:50,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:50,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:19:50,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:19:50,037 INFO L87 Difference]: Start difference. First operand 2576 states and 6902 transitions. Second operand 3 states. [2019-12-26 22:19:50,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:50,054 INFO L93 Difference]: Finished difference Result 2575 states and 6900 transitions. [2019-12-26 22:19:50,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:19:50,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-26 22:19:50,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:50,063 INFO L225 Difference]: With dead ends: 2575 [2019-12-26 22:19:50,063 INFO L226 Difference]: Without dead ends: 2575 [2019-12-26 22:19:50,063 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-26 22:19:50,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2019-12-26 22:19:50,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 2575. [2019-12-26 22:19:50,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2575 states. [2019-12-26 22:19:50,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2575 states to 2575 states and 6900 transitions. [2019-12-26 22:19:50,120 INFO L78 Accepts]: Start accepts. Automaton has 2575 states and 6900 transitions. Word has length 29 [2019-12-26 22:19:50,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:50,120 INFO L462 AbstractCegarLoop]: Abstraction has 2575 states and 6900 transitions. [2019-12-26 22:19:50,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:19:50,121 INFO L276 IsEmpty]: Start isEmpty. Operand 2575 states and 6900 transitions. [2019-12-26 22:19:50,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 22:19:50,129 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:50,129 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] [2019-12-26 22:19:50,129 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:50,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:50,129 INFO L82 PathProgramCache]: Analyzing trace with hash 85752327, now seen corresponding path program 1 times [2019-12-26 22:19:50,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:50,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438468059] [2019-12-26 22:19:50,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:50,205 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-26 22:19:50,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438468059] [2019-12-26 22:19:50,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:50,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:19:50,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453463686] [2019-12-26 22:19:50,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:19:50,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:50,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:19:50,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:19:50,208 INFO L87 Difference]: Start difference. First operand 2575 states and 6900 transitions. Second operand 5 states. [2019-12-26 22:19:50,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:50,271 INFO L93 Difference]: Finished difference Result 1612 states and 4421 transitions. [2019-12-26 22:19:50,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:19:50,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-26 22:19:50,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:50,277 INFO L225 Difference]: With dead ends: 1612 [2019-12-26 22:19:50,277 INFO L226 Difference]: Without dead ends: 1612 [2019-12-26 22:19:50,277 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-26 22:19:50,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2019-12-26 22:19:50,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1512. [2019-12-26 22:19:50,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512 states. [2019-12-26 22:19:50,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 4171 transitions. [2019-12-26 22:19:50,310 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 4171 transitions. Word has length 29 [2019-12-26 22:19:50,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:50,312 INFO L462 AbstractCegarLoop]: Abstraction has 1512 states and 4171 transitions. [2019-12-26 22:19:50,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:19:50,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 4171 transitions. [2019-12-26 22:19:50,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-26 22:19:50,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:50,320 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] [2019-12-26 22:19:50,321 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:50,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:50,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1399697698, now seen corresponding path program 1 times [2019-12-26 22:19:50,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:50,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508600527] [2019-12-26 22:19:50,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:50,447 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-26 22:19:50,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508600527] [2019-12-26 22:19:50,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:50,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:19:50,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065467694] [2019-12-26 22:19:50,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:19:50,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:50,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:19:50,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:19:50,450 INFO L87 Difference]: Start difference. First operand 1512 states and 4171 transitions. Second operand 7 states. [2019-12-26 22:19:50,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:50,755 INFO L93 Difference]: Finished difference Result 3804 states and 10339 transitions. [2019-12-26 22:19:50,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 22:19:50,756 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-12-26 22:19:50,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:50,764 INFO L225 Difference]: With dead ends: 3804 [2019-12-26 22:19:50,764 INFO L226 Difference]: Without dead ends: 2546 [2019-12-26 22:19:50,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:19:50,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2019-12-26 22:19:50,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 1686. [2019-12-26 22:19:50,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1686 states. [2019-12-26 22:19:50,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 4642 transitions. [2019-12-26 22:19:50,806 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 4642 transitions. Word has length 44 [2019-12-26 22:19:50,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:50,806 INFO L462 AbstractCegarLoop]: Abstraction has 1686 states and 4642 transitions. [2019-12-26 22:19:50,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:19:50,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 4642 transitions. [2019-12-26 22:19:50,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-26 22:19:50,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:50,811 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] [2019-12-26 22:19:50,811 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:50,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:50,812 INFO L82 PathProgramCache]: Analyzing trace with hash -620079968, now seen corresponding path program 2 times [2019-12-26 22:19:50,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:50,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382947517] [2019-12-26 22:19:50,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:50,875 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-26 22:19:50,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382947517] [2019-12-26 22:19:50,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:50,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:19:50,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801431313] [2019-12-26 22:19:50,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:19:50,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:50,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:19:50,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:19:50,878 INFO L87 Difference]: Start difference. First operand 1686 states and 4642 transitions. Second operand 4 states. [2019-12-26 22:19:50,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:50,901 INFO L93 Difference]: Finished difference Result 2373 states and 6192 transitions. [2019-12-26 22:19:50,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:19:50,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-26 22:19:50,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:50,907 INFO L225 Difference]: With dead ends: 2373 [2019-12-26 22:19:50,908 INFO L226 Difference]: Without dead ends: 1519 [2019-12-26 22:19:50,908 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-26 22:19:50,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2019-12-26 22:19:50,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1519. [2019-12-26 22:19:50,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1519 states. [2019-12-26 22:19:50,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 4099 transitions. [2019-12-26 22:19:50,935 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 4099 transitions. Word has length 44 [2019-12-26 22:19:50,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:50,936 INFO L462 AbstractCegarLoop]: Abstraction has 1519 states and 4099 transitions. [2019-12-26 22:19:50,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:19:50,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 4099 transitions. [2019-12-26 22:19:50,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-26 22:19:50,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:50,940 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] [2019-12-26 22:19:50,940 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:50,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:50,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1600402034, now seen corresponding path program 3 times [2019-12-26 22:19:50,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:50,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657921456] [2019-12-26 22:19:50,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:51,040 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-26 22:19:51,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657921456] [2019-12-26 22:19:51,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:51,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:19:51,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751804499] [2019-12-26 22:19:51,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:19:51,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:51,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:19:51,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:19:51,043 INFO L87 Difference]: Start difference. First operand 1519 states and 4099 transitions. Second operand 3 states. [2019-12-26 22:19:51,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:51,059 INFO L93 Difference]: Finished difference Result 1517 states and 4094 transitions. [2019-12-26 22:19:51,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:19:51,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-26 22:19:51,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:51,064 INFO L225 Difference]: With dead ends: 1517 [2019-12-26 22:19:51,065 INFO L226 Difference]: Without dead ends: 1517 [2019-12-26 22:19:51,065 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-26 22:19:51,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2019-12-26 22:19:51,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1375. [2019-12-26 22:19:51,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1375 states. [2019-12-26 22:19:51,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 3761 transitions. [2019-12-26 22:19:51,091 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 3761 transitions. Word has length 44 [2019-12-26 22:19:51,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:51,092 INFO L462 AbstractCegarLoop]: Abstraction has 1375 states and 3761 transitions. [2019-12-26 22:19:51,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:19:51,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 3761 transitions. [2019-12-26 22:19:51,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-26 22:19:51,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:51,096 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] [2019-12-26 22:19:51,097 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:51,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:51,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1547697441, now seen corresponding path program 1 times [2019-12-26 22:19:51,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:51,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622561024] [2019-12-26 22:19:51,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:19:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:19:51,209 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:19:51,209 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:19:51,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~z$mem_tmp~0_20 0) (= 0 |v_ULTIMATE.start_main_~#t852~0.offset_25|) (= v_~z$w_buff0_used~0_485 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= v_~z$r_buff0_thd3~0_99 0) (= 0 v_~z$r_buff1_thd3~0_76) (= 0 v_~__unbuffered_p0_EAX~0_49) (= |v_#NULL.offset_3| 0) (= v_~z~0_140 0) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd2~0_143 0) (= v_~z$r_buff0_thd2~0_213 0) (= v_~__unbuffered_cnt~0_109 0) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t852~0.base_36| 4) |v_#length_25|) (= v_~b~0_40 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~z$r_buff1_thd1~0_25) (= (store .cse0 |v_ULTIMATE.start_main_~#t852~0.base_36| 1) |v_#valid_72|) (= v_~__unbuffered_p1_EBX~0_70 0) (= v_~__unbuffered_p2_EBX~0_52 0) (= v_~y~0_15 0) (= v_~z$r_buff0_thd1~0_25 0) (= v_~z$w_buff1~0_118 0) (= v_~x~0_31 0) (= v_~main$tmp_guard1~0_38 0) (= v_~a~0_24 0) (= 0 v_~z$flush_delayed~0_46) (= 0 |v_#NULL.base_3|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t852~0.base_36|)) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t852~0.base_36|) (= 0 v_~weak$$choice2~0_95) (= 0 v_~weak$$choice0~0_13) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t852~0.base_36| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t852~0.base_36|) |v_ULTIMATE.start_main_~#t852~0.offset_25| 0)) |v_#memory_int_17|) (= v_~z$r_buff0_thd0~0_82 0) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$w_buff0~0_173 0) (= 0 v_~__unbuffered_p2_EAX~0_52) (= v_~z$w_buff1_used~0_228 0) (= 0 v_~z$r_buff1_thd0~0_88))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_18|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_~#t852~0.base=|v_ULTIMATE.start_main_~#t852~0.base_36|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_21|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_143, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_~#t852~0.offset=|v_ULTIMATE.start_main_~#t852~0.offset_25|, ~a~0=v_~a~0_24, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_82, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_52, ~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_52, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_27|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_~#t854~0.base=|v_ULTIMATE.start_main_~#t854~0.base_25|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_228, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_245|, ~z$flush_delayed~0=v_~z$flush_delayed~0_46, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t853~0.base=|v_ULTIMATE.start_main_~#t853~0.base_31|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_71|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_25, ~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_99, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ~x~0=v_~x~0_31, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_118, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t854~0.offset=|v_ULTIMATE.start_main_~#t854~0.offset_19|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_88, ~y~0=v_~y~0_15, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_213, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_70, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_485, ~z$w_buff0~0=v_~z$w_buff0~0_173, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_76, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_29|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, #NULL.base=|v_#NULL.base_3|, ~b~0=v_~b~0_40, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_140, ~weak$$choice2~0=v_~weak$$choice2~0_95, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25, ULTIMATE.start_main_~#t853~0.offset=|v_ULTIMATE.start_main_~#t853~0.offset_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t852~0.base, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t852~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t854~0.base, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t853~0.base, 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_#t~nondet33, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t854~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~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, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t853~0.offset] because there is no mapped edge [2019-12-26 22:19:51,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L832-1-->L834: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t853~0.base_10|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t853~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t853~0.offset_9| 0) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t853~0.base_10|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t853~0.base_10|) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t853~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t853~0.base_10|) |v_ULTIMATE.start_main_~#t853~0.offset_9| 1)) |v_#memory_int_7|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t853~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t853~0.base=|v_ULTIMATE.start_main_~#t853~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_main_~#t853~0.offset=|v_ULTIMATE.start_main_~#t853~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t853~0.base, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t853~0.offset] because there is no mapped edge [2019-12-26 22:19:51,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L834-1-->L836: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t854~0.base_13| 4) |v_#length_17|) (not (= |v_ULTIMATE.start_main_~#t854~0.base_13| 0)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t854~0.base_13|)) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t854~0.base_13| 1) |v_#valid_35|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t854~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t854~0.base_13|) |v_ULTIMATE.start_main_~#t854~0.offset_11| 2))) (= 0 |v_ULTIMATE.start_main_~#t854~0.offset_11|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t854~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_10|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t854~0.offset=|v_ULTIMATE.start_main_~#t854~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t854~0.base=|v_ULTIMATE.start_main_~#t854~0.base_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t854~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t854~0.base, #length] because there is no mapped edge [2019-12-26 22:19:51,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P2ENTRY-->L4-3: Formula: (and (= |P2Thread1of1ForFork0_#in~arg.base_In177304428| P2Thread1of1ForFork0_~arg.base_Out177304428) (= |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out177304428| 1) (= 0 (mod ~z$w_buff1_used~0_Out177304428 256)) (= ~z$w_buff0~0_Out177304428 1) (= P2Thread1of1ForFork0_~arg.offset_Out177304428 |P2Thread1of1ForFork0_#in~arg.offset_In177304428|) (= ~z$w_buff0_used~0_In177304428 ~z$w_buff1_used~0_Out177304428) (= |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out177304428| P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out177304428) (= 1 ~z$w_buff0_used~0_Out177304428) (= ~z$w_buff1~0_Out177304428 ~z$w_buff0~0_In177304428)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In177304428|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In177304428, ~z$w_buff0~0=~z$w_buff0~0_In177304428, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In177304428|} OutVars{P2Thread1of1ForFork0_~arg.base=P2Thread1of1ForFork0_~arg.base_Out177304428, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out177304428|, P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In177304428|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out177304428, ~z$w_buff0~0=~z$w_buff0~0_Out177304428, P2Thread1of1ForFork0_~arg.offset=P2Thread1of1ForFork0_~arg.offset_Out177304428, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out177304428, ~z$w_buff1~0=~z$w_buff1~0_Out177304428, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In177304428|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out177304428} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 22:19:51,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_13| v_P0Thread1of1ForFork1_~arg.base_13) (= v_P0Thread1of1ForFork1_~arg.offset_13 |v_P0Thread1of1ForFork1_#in~arg.offset_13|) (= 0 |v_P0Thread1of1ForFork1_#res.base_9|) (= v_~x~0_16 v_~__unbuffered_p0_EAX~0_17) (= 0 |v_P0Thread1of1ForFork1_#res.offset_9|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~b~0_23 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_16} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, ~b~0=v_~b~0_23, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_16, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_13} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, ~b~0, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-26 22:19:51,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1723175991 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1723175991 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out1723175991| 0) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In1723175991 |P2Thread1of1ForFork0_#t~ite28_Out1723175991|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1723175991, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1723175991} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1723175991|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1723175991, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1723175991} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-26 22:19:51,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L811-->L811-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-2130166014 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-2130166014 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-2130166014 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-2130166014 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite29_Out-2130166014| 0)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-2130166014 |P2Thread1of1ForFork0_#t~ite29_Out-2130166014|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2130166014, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2130166014, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2130166014, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2130166014} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2130166014, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2130166014, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2130166014, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2130166014, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-2130166014|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 22:19:51,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L812-->L813: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In684241416 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In684241416 256)))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd3~0_Out684241416) (not .cse1)) (and (= ~z$r_buff0_thd3~0_In684241416 ~z$r_buff0_thd3~0_Out684241416) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In684241416, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In684241416} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In684241416, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out684241416, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out684241416|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite30] because there is no mapped edge [2019-12-26 22:19:51,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In912633203 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In912633203 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In912633203 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In912633203 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite31_Out912633203| ~z$r_buff1_thd3~0_In912633203)) (and (= 0 |P2Thread1of1ForFork0_#t~ite31_Out912633203|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In912633203, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In912633203, ~z$w_buff1_used~0=~z$w_buff1_used~0_In912633203, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In912633203} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In912633203, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In912633203, ~z$w_buff1_used~0=~z$w_buff1_used~0_In912633203, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In912633203, P2Thread1of1ForFork0_#t~ite31=|P2Thread1of1ForFork0_#t~ite31_Out912633203|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 22:19:51,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_63 |v_P2Thread1of1ForFork0_#t~ite31_52|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_52|} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_63, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_51|, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-26 22:19:51,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L772-->L773: Formula: (and (not (= (mod v_~weak$$choice2~0_40 256) 0)) (= v_~z$r_buff0_thd2~0_102 v_~z$r_buff0_thd2~0_101)) InVars {~weak$$choice2~0=v_~weak$$choice2~0_40, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_102} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_18|, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_12|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_9|, ~weak$$choice2~0=v_~weak$$choice2~0_40, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_101} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 22:19:51,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L775-->L783: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 v_~z$flush_delayed~0_10) (= v_~z~0_23 v_~z$mem_tmp~0_4) (not (= (mod v_~z$flush_delayed~0_11 256) 0))) InVars {~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_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_23, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_13|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-26 22:19:51,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L836-1-->L842: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 3 v_~__unbuffered_cnt~0_32)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 22:19:51,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L842-2-->L842-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1661531567 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1661531567 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In-1661531567 |ULTIMATE.start_main_#t~ite35_Out-1661531567|) (not .cse1)) (and (or .cse0 .cse1) (= ~z~0_In-1661531567 |ULTIMATE.start_main_#t~ite35_Out-1661531567|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1661531567, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1661531567, ~z$w_buff1~0=~z$w_buff1~0_In-1661531567, ~z~0=~z~0_In-1661531567} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1661531567, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1661531567|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1661531567, ~z$w_buff1~0=~z$w_buff1~0_In-1661531567, ~z~0=~z~0_In-1661531567} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-26 22:19:51,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L842-4-->L843: Formula: (= v_~z~0_12 |v_ULTIMATE.start_main_#t~ite35_7|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ~z~0=v_~z~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~z~0] because there is no mapped edge [2019-12-26 22:19:51,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1093855965 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1093855965 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite37_Out1093855965| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite37_Out1093855965| ~z$w_buff0_used~0_In1093855965) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1093855965, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1093855965} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1093855965, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1093855965, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1093855965|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-26 22:19:51,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L844-->L844-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-367932884 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-367932884 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-367932884 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-367932884 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite38_Out-367932884|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-367932884 |ULTIMATE.start_main_#t~ite38_Out-367932884|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-367932884, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-367932884, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-367932884, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-367932884} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-367932884, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-367932884, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-367932884, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-367932884, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-367932884|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-26 22:19:51,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L845-->L845-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In940392101 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In940392101 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite39_Out940392101| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out940392101| ~z$r_buff0_thd0~0_In940392101)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In940392101, ~z$w_buff0_used~0=~z$w_buff0_used~0_In940392101} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In940392101, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out940392101|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In940392101} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-26 22:19:51,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1807487966 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1807487966 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1807487966 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1807487966 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite40_Out-1807487966| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite40_Out-1807487966| ~z$r_buff1_thd0~0_In-1807487966)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1807487966, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1807487966, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1807487966, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1807487966} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1807487966, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1807487966|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1807487966, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1807487966, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1807487966} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-26 22:19:51,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EBX~0_35 0) (= v_~__unbuffered_p1_EBX~0_48 0) (= 1 v_~__unbuffered_p1_EAX~0_25) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~main$tmp_guard1~0_21 0) (= 0 v_~__unbuffered_p0_EAX~0_35) (= |v_ULTIMATE.start_main_#t~ite40_42| v_~z$r_buff1_thd0~0_71) (= 1 v_~__unbuffered_p2_EAX~0_35) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_21 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_42|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_41|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_71, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:19:51,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:19:51 BasicIcfg [2019-12-26 22:19:51,358 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:19:51,361 INFO L168 Benchmark]: Toolchain (without parser) took 13116.12 ms. Allocated memory was 144.7 MB in the beginning and 543.7 MB in the end (delta: 399.0 MB). Free memory was 101.2 MB in the beginning and 229.1 MB in the end (delta: -128.0 MB). Peak memory consumption was 271.0 MB. Max. memory is 7.1 GB. [2019-12-26 22:19:51,362 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-26 22:19:51,365 INFO L168 Benchmark]: CACSL2BoogieTranslator took 812.28 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.7 MB in the beginning and 156.1 MB in the end (delta: -55.3 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-26 22:19:51,366 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.34 ms. Allocated memory is still 201.9 MB. Free memory was 156.1 MB in the beginning and 153.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 22:19:51,366 INFO L168 Benchmark]: Boogie Preprocessor took 54.09 ms. Allocated memory is still 201.9 MB. Free memory was 153.3 MB in the beginning and 151.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-26 22:19:51,367 INFO L168 Benchmark]: RCFGBuilder took 921.50 ms. Allocated memory is still 201.9 MB. Free memory was 151.2 MB in the beginning and 106.4 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. [2019-12-26 22:19:51,368 INFO L168 Benchmark]: TraceAbstraction took 11232.17 ms. Allocated memory was 201.9 MB in the beginning and 543.7 MB in the end (delta: 341.8 MB). Free memory was 106.4 MB in the beginning and 229.1 MB in the end (delta: -122.7 MB). Peak memory consumption was 219.1 MB. Max. memory is 7.1 GB. [2019-12-26 22:19:51,377 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 812.28 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.7 MB in the beginning and 156.1 MB in the end (delta: -55.3 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 88.34 ms. Allocated memory is still 201.9 MB. Free memory was 156.1 MB in the beginning and 153.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.09 ms. Allocated memory is still 201.9 MB. Free memory was 153.3 MB in the beginning and 151.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 921.50 ms. Allocated memory is still 201.9 MB. Free memory was 151.2 MB in the beginning and 106.4 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11232.17 ms. Allocated memory was 201.9 MB in the beginning and 543.7 MB in the end (delta: 341.8 MB). Free memory was 106.4 MB in the beginning and 229.1 MB in the end (delta: -122.7 MB). Peak memory consumption was 219.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.9s, 156 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 85 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 19 ChoiceCompositions, 4667 VarBasedMoverChecksPositive, 145 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 167 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 50265 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t852, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L834] FCALL, FORK 0 pthread_create(&t853, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L836] FCALL, FORK 0 pthread_create(&t854, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L793] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L794] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L795] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L796] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L797] 3 z$r_buff0_thd3 = (_Bool)1 [L800] 3 a = 1 [L803] 3 __unbuffered_p2_EAX = a [L806] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L809] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L754] 2 x = 1 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 z$flush_delayed = weak$$choice2 [L766] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L767] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L809] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L767] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L768] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L768] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L769] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L770] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L770] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L771] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L773] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L842] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 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 [L845] 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 4 procedures, 147 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.9s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1307 SDtfs, 986 SDslu, 2131 SDs, 0 SdLazy, 531 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14534occurred 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.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 2404 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 261 ConstructedInterpolants, 0 QuantifiedInterpolants, 39747 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...