/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix039_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:26:23,962 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:26:23,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:26:23,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:26:23,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:26:23,980 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:26:23,982 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:26:23,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:26:23,985 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:26:23,986 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:26:23,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:26:23,988 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:26:23,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:26:23,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:26:23,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:26:23,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:26:23,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:26:23,993 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:26:23,995 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:26:23,998 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:26:24,002 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:26:24,003 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:26:24,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:26:24,006 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:26:24,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:26:24,008 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:26:24,009 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:26:24,011 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:26:24,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:26:24,015 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:26:24,015 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:26:24,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:26:24,017 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:26:24,019 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:26:24,021 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:26:24,022 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:26:24,023 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:26:24,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:26:24,024 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:26:24,026 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:26:24,028 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:26:24,029 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:26:24,049 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:26:24,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:26:24,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:26:24,052 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:26:24,052 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:26:24,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:26:24,052 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:26:24,052 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:26:24,053 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:26:24,053 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:26:24,054 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:26:24,054 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:26:24,054 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:26:24,055 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:26:24,055 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:26:24,055 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:26:24,055 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:26:24,056 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:26:24,056 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:26:24,056 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:26:24,056 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:26:24,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:26:24,057 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:26:24,057 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:26:24,057 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:26:24,057 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:26:24,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:26:24,058 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:26:24,058 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:26:24,319 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:26:24,338 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:26:24,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:26:24,344 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:26:24,345 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:26:24,345 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix039_power.opt.i [2019-12-27 02:26:24,419 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b87593c1c/9affda9f74084400b30d6ada6275b1ca/FLAG53d9d2f84 [2019-12-27 02:26:25,000 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:26:25,001 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039_power.opt.i [2019-12-27 02:26:25,019 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b87593c1c/9affda9f74084400b30d6ada6275b1ca/FLAG53d9d2f84 [2019-12-27 02:26:25,250 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b87593c1c/9affda9f74084400b30d6ada6275b1ca [2019-12-27 02:26:25,259 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:26:25,261 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:26:25,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:26:25,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:26:25,266 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:26:25,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:26:25" (1/1) ... [2019-12-27 02:26:25,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c1335d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:26:25, skipping insertion in model container [2019-12-27 02:26:25,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:26:25" (1/1) ... [2019-12-27 02:26:25,278 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:26:25,345 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:26:25,868 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:26:25,880 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:26:25,979 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:26:26,052 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:26:26,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:26:26 WrapperNode [2019-12-27 02:26:26,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:26:26,054 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:26:26,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:26:26,054 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:26:26,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:26:26" (1/1) ... [2019-12-27 02:26:26,082 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:26:26" (1/1) ... [2019-12-27 02:26:26,114 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:26:26,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:26:26,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:26:26,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:26:26,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:26:26" (1/1) ... [2019-12-27 02:26:26,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:26:26" (1/1) ... [2019-12-27 02:26:26,129 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:26:26" (1/1) ... [2019-12-27 02:26:26,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:26:26" (1/1) ... [2019-12-27 02:26:26,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:26:26" (1/1) ... [2019-12-27 02:26:26,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:26:26" (1/1) ... [2019-12-27 02:26:26,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:26:26" (1/1) ... [2019-12-27 02:26:26,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:26:26,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:26:26,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:26:26,153 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:26:26,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:26:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:26:26,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:26:26,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:26:26,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:26:26,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:26:26,243 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:26:26,244 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:26:26,245 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:26:26,245 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:26:26,246 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:26:26,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:26:26,249 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 02:26:26,249 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 02:26:26,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:26:26,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:26:26,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:26:26,251 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:26:27,005 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:26:27,006 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:26:27,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:26:27 BoogieIcfgContainer [2019-12-27 02:26:27,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:26:27,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:26:27,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:26:27,014 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:26:27,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:26:25" (1/3) ... [2019-12-27 02:26:27,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cda5f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:26:27, skipping insertion in model container [2019-12-27 02:26:27,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:26:26" (2/3) ... [2019-12-27 02:26:27,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cda5f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:26:27, skipping insertion in model container [2019-12-27 02:26:27,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:26:27" (3/3) ... [2019-12-27 02:26:27,020 INFO L109 eAbstractionObserver]: Analyzing ICFG mix039_power.opt.i [2019-12-27 02:26:27,031 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:26:27,031 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:26:27,043 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:26:27,044 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:26:27,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,085 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,086 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,087 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,088 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,093 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,093 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,149 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,149 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,149 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,149 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,150 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,150 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,150 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,150 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,151 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,151 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,151 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,151 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,151 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,152 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,152 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,152 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,152 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,152 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,153 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,153 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,153 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,153 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,154 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,154 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,154 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,154 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,154 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,155 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,155 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,155 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,155 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,155 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,156 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,156 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,159 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,159 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,164 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,165 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,169 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,169 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,170 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,170 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,170 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,170 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,170 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,170 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,171 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,171 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,171 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,171 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,173 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,174 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:27,188 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 02:26:27,209 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:26:27,209 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:26:27,209 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:26:27,209 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:26:27,209 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:26:27,210 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:26:27,210 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:26:27,210 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:26:27,229 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-27 02:26:27,231 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-27 02:26:27,360 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-27 02:26:27,360 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:26:27,378 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 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/151 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 02:26:27,396 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-27 02:26:27,461 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-27 02:26:27,461 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:26:27,470 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 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/151 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 02:26:27,484 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-27 02:26:27,485 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:26:32,083 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-12-27 02:26:32,554 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 02:26:32,679 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 02:26:33,171 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-27 02:26:33,320 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-27 02:26:33,336 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44168 [2019-12-27 02:26:33,336 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-27 02:26:33,340 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 78 transitions [2019-12-27 02:26:34,527 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 21398 states. [2019-12-27 02:26:34,529 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states. [2019-12-27 02:26:34,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 02:26:34,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:34,536 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:26:34,537 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:34,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:34,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1244651740, now seen corresponding path program 1 times [2019-12-27 02:26:34,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:34,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574193036] [2019-12-27 02:26:34,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:26:34,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574193036] [2019-12-27 02:26:34,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:34,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:26:34,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989172087] [2019-12-27 02:26:34,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:26:34,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:34,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:26:34,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:26:34,832 INFO L87 Difference]: Start difference. First operand 21398 states. Second operand 3 states. [2019-12-27 02:26:35,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:35,245 INFO L93 Difference]: Finished difference Result 20958 states and 90416 transitions. [2019-12-27 02:26:35,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:26:35,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 02:26:35,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:35,448 INFO L225 Difference]: With dead ends: 20958 [2019-12-27 02:26:35,448 INFO L226 Difference]: Without dead ends: 19662 [2019-12-27 02:26:35,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:26:36,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2019-12-27 02:26:37,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 19662. [2019-12-27 02:26:37,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19662 states. [2019-12-27 02:26:37,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19662 states to 19662 states and 84692 transitions. [2019-12-27 02:26:37,470 INFO L78 Accepts]: Start accepts. Automaton has 19662 states and 84692 transitions. Word has length 9 [2019-12-27 02:26:37,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:37,471 INFO L462 AbstractCegarLoop]: Abstraction has 19662 states and 84692 transitions. [2019-12-27 02:26:37,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:26:37,471 INFO L276 IsEmpty]: Start isEmpty. Operand 19662 states and 84692 transitions. [2019-12-27 02:26:37,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 02:26:37,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:37,493 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:26:37,494 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:37,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:37,494 INFO L82 PathProgramCache]: Analyzing trace with hash -6792795, now seen corresponding path program 1 times [2019-12-27 02:26:37,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:37,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650178851] [2019-12-27 02:26:37,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:37,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:26:37,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650178851] [2019-12-27 02:26:37,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:37,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:26:37,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377013476] [2019-12-27 02:26:37,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:26:37,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:37,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:26:37,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:26:37,622 INFO L87 Difference]: Start difference. First operand 19662 states and 84692 transitions. Second operand 4 states. [2019-12-27 02:26:38,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:38,075 INFO L93 Difference]: Finished difference Result 30494 states and 126452 transitions. [2019-12-27 02:26:38,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:26:38,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 02:26:38,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:38,237 INFO L225 Difference]: With dead ends: 30494 [2019-12-27 02:26:38,237 INFO L226 Difference]: Without dead ends: 30438 [2019-12-27 02:26:38,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:26:38,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30438 states. [2019-12-27 02:26:40,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30438 to 27742. [2019-12-27 02:26:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-12-27 02:26:40,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 116300 transitions. [2019-12-27 02:26:40,707 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 116300 transitions. Word has length 15 [2019-12-27 02:26:40,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:40,707 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 116300 transitions. [2019-12-27 02:26:40,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:26:40,707 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 116300 transitions. [2019-12-27 02:26:40,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 02:26:40,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:40,714 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:26:40,714 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:40,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:40,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1479332799, now seen corresponding path program 1 times [2019-12-27 02:26:40,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:40,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812910009] [2019-12-27 02:26:40,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:40,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:26:40,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812910009] [2019-12-27 02:26:40,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:40,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:26:40,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838743850] [2019-12-27 02:26:40,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:26:40,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:40,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:26:40,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:26:40,802 INFO L87 Difference]: Start difference. First operand 27742 states and 116300 transitions. Second operand 4 states. [2019-12-27 02:26:41,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:41,183 INFO L93 Difference]: Finished difference Result 35230 states and 146308 transitions. [2019-12-27 02:26:41,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:26:41,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 02:26:41,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:41,307 INFO L225 Difference]: With dead ends: 35230 [2019-12-27 02:26:41,307 INFO L226 Difference]: Without dead ends: 35182 [2019-12-27 02:26:41,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:26:41,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35182 states. [2019-12-27 02:26:42,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35182 to 30378. [2019-12-27 02:26:42,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30378 states. [2019-12-27 02:26:42,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30378 states to 30378 states and 127172 transitions. [2019-12-27 02:26:42,719 INFO L78 Accepts]: Start accepts. Automaton has 30378 states and 127172 transitions. Word has length 18 [2019-12-27 02:26:42,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:42,720 INFO L462 AbstractCegarLoop]: Abstraction has 30378 states and 127172 transitions. [2019-12-27 02:26:42,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:26:42,720 INFO L276 IsEmpty]: Start isEmpty. Operand 30378 states and 127172 transitions. [2019-12-27 02:26:42,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 02:26:42,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:42,731 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] [2019-12-27 02:26:42,731 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:42,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:42,731 INFO L82 PathProgramCache]: Analyzing trace with hash -45820751, now seen corresponding path program 1 times [2019-12-27 02:26:42,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:42,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567259670] [2019-12-27 02:26:42,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:42,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:26:42,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567259670] [2019-12-27 02:26:42,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:42,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:26:42,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973369013] [2019-12-27 02:26:42,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:26:42,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:42,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:26:42,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:26:42,785 INFO L87 Difference]: Start difference. First operand 30378 states and 127172 transitions. Second operand 3 states. [2019-12-27 02:26:44,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:44,351 INFO L93 Difference]: Finished difference Result 30328 states and 126949 transitions. [2019-12-27 02:26:44,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:26:44,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 02:26:44,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:44,468 INFO L225 Difference]: With dead ends: 30328 [2019-12-27 02:26:44,468 INFO L226 Difference]: Without dead ends: 30328 [2019-12-27 02:26:44,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:26:44,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30328 states. [2019-12-27 02:26:45,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30328 to 30328. [2019-12-27 02:26:45,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30328 states. [2019-12-27 02:26:45,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30328 states to 30328 states and 126949 transitions. [2019-12-27 02:26:45,493 INFO L78 Accepts]: Start accepts. Automaton has 30328 states and 126949 transitions. Word has length 20 [2019-12-27 02:26:45,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:45,494 INFO L462 AbstractCegarLoop]: Abstraction has 30328 states and 126949 transitions. [2019-12-27 02:26:45,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:26:45,494 INFO L276 IsEmpty]: Start isEmpty. Operand 30328 states and 126949 transitions. [2019-12-27 02:26:45,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 02:26:45,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:45,509 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] [2019-12-27 02:26:45,509 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:45,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:45,510 INFO L82 PathProgramCache]: Analyzing trace with hash 484267595, now seen corresponding path program 1 times [2019-12-27 02:26:45,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:45,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586927618] [2019-12-27 02:26:45,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:45,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:26:45,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586927618] [2019-12-27 02:26:45,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:45,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:26:45,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799490953] [2019-12-27 02:26:45,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:26:45,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:45,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:26:45,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:26:45,572 INFO L87 Difference]: Start difference. First operand 30328 states and 126949 transitions. Second operand 3 states. [2019-12-27 02:26:45,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:45,815 INFO L93 Difference]: Finished difference Result 44924 states and 179717 transitions. [2019-12-27 02:26:45,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:26:45,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 02:26:45,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:45,892 INFO L225 Difference]: With dead ends: 44924 [2019-12-27 02:26:45,893 INFO L226 Difference]: Without dead ends: 32296 [2019-12-27 02:26:45,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:26:46,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32296 states. [2019-12-27 02:26:46,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32296 to 31012. [2019-12-27 02:26:46,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31012 states. [2019-12-27 02:26:46,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31012 states to 31012 states and 116299 transitions. [2019-12-27 02:26:46,871 INFO L78 Accepts]: Start accepts. Automaton has 31012 states and 116299 transitions. Word has length 21 [2019-12-27 02:26:46,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:46,871 INFO L462 AbstractCegarLoop]: Abstraction has 31012 states and 116299 transitions. [2019-12-27 02:26:46,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:26:46,871 INFO L276 IsEmpty]: Start isEmpty. Operand 31012 states and 116299 transitions. [2019-12-27 02:26:46,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 02:26:46,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:46,886 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] [2019-12-27 02:26:46,886 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:46,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:46,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1131875471, now seen corresponding path program 1 times [2019-12-27 02:26:46,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:46,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976772097] [2019-12-27 02:26:46,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:46,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:26:46,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976772097] [2019-12-27 02:26:46,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:46,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:26:46,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647312805] [2019-12-27 02:26:46,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:26:46,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:46,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:26:46,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:26:46,981 INFO L87 Difference]: Start difference. First operand 31012 states and 116299 transitions. Second operand 3 states. [2019-12-27 02:26:47,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:47,107 INFO L93 Difference]: Finished difference Result 30604 states and 114575 transitions. [2019-12-27 02:26:47,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:26:47,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 02:26:47,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:47,180 INFO L225 Difference]: With dead ends: 30604 [2019-12-27 02:26:47,180 INFO L226 Difference]: Without dead ends: 30604 [2019-12-27 02:26:47,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:26:47,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30604 states. [2019-12-27 02:26:47,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30604 to 30436. [2019-12-27 02:26:47,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30436 states. [2019-12-27 02:26:48,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30436 states to 30436 states and 114095 transitions. [2019-12-27 02:26:48,069 INFO L78 Accepts]: Start accepts. Automaton has 30436 states and 114095 transitions. Word has length 21 [2019-12-27 02:26:48,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:48,069 INFO L462 AbstractCegarLoop]: Abstraction has 30436 states and 114095 transitions. [2019-12-27 02:26:48,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:26:48,069 INFO L276 IsEmpty]: Start isEmpty. Operand 30436 states and 114095 transitions. [2019-12-27 02:26:48,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 02:26:48,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:48,085 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] [2019-12-27 02:26:48,085 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:48,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:48,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1107033684, now seen corresponding path program 1 times [2019-12-27 02:26:48,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:48,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977111906] [2019-12-27 02:26:48,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:48,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:26:48,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977111906] [2019-12-27 02:26:48,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:48,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:26:48,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566321554] [2019-12-27 02:26:48,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:26:48,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:48,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:26:48,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:26:48,143 INFO L87 Difference]: Start difference. First operand 30436 states and 114095 transitions. Second operand 3 states. [2019-12-27 02:26:48,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:48,288 INFO L93 Difference]: Finished difference Result 30436 states and 112751 transitions. [2019-12-27 02:26:48,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:26:48,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-27 02:26:48,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:48,611 INFO L225 Difference]: With dead ends: 30436 [2019-12-27 02:26:48,611 INFO L226 Difference]: Without dead ends: 30436 [2019-12-27 02:26:48,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:26:48,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30436 states. [2019-12-27 02:26:49,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30436 to 30036. [2019-12-27 02:26:49,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30036 states. [2019-12-27 02:26:49,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30036 states to 30036 states and 111391 transitions. [2019-12-27 02:26:49,229 INFO L78 Accepts]: Start accepts. Automaton has 30036 states and 111391 transitions. Word has length 22 [2019-12-27 02:26:49,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:49,230 INFO L462 AbstractCegarLoop]: Abstraction has 30036 states and 111391 transitions. [2019-12-27 02:26:49,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:26:49,230 INFO L276 IsEmpty]: Start isEmpty. Operand 30036 states and 111391 transitions. [2019-12-27 02:26:49,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 02:26:49,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:49,242 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] [2019-12-27 02:26:49,243 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:49,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:49,243 INFO L82 PathProgramCache]: Analyzing trace with hash -428330177, now seen corresponding path program 1 times [2019-12-27 02:26:49,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:49,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475147248] [2019-12-27 02:26:49,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:49,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:26:49,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475147248] [2019-12-27 02:26:49,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:49,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:26:49,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309332952] [2019-12-27 02:26:49,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:26:49,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:49,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:26:49,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:26:49,309 INFO L87 Difference]: Start difference. First operand 30036 states and 111391 transitions. Second operand 4 states. [2019-12-27 02:26:49,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:49,481 INFO L93 Difference]: Finished difference Result 25667 states and 89340 transitions. [2019-12-27 02:26:49,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:26:49,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-27 02:26:49,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:49,546 INFO L225 Difference]: With dead ends: 25667 [2019-12-27 02:26:49,546 INFO L226 Difference]: Without dead ends: 23877 [2019-12-27 02:26:49,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:26:49,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23877 states. [2019-12-27 02:26:50,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23877 to 23877. [2019-12-27 02:26:50,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23877 states. [2019-12-27 02:26:50,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23877 states to 23877 states and 83947 transitions. [2019-12-27 02:26:50,212 INFO L78 Accepts]: Start accepts. Automaton has 23877 states and 83947 transitions. Word has length 23 [2019-12-27 02:26:50,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:50,212 INFO L462 AbstractCegarLoop]: Abstraction has 23877 states and 83947 transitions. [2019-12-27 02:26:50,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:26:50,213 INFO L276 IsEmpty]: Start isEmpty. Operand 23877 states and 83947 transitions. [2019-12-27 02:26:50,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 02:26:50,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:50,222 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] [2019-12-27 02:26:50,222 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:50,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:50,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1442998109, now seen corresponding path program 1 times [2019-12-27 02:26:50,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:50,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466097570] [2019-12-27 02:26:50,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:50,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:26:50,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466097570] [2019-12-27 02:26:50,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:50,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:26:50,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097007884] [2019-12-27 02:26:50,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:26:50,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:50,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:26:50,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:26:50,282 INFO L87 Difference]: Start difference. First operand 23877 states and 83947 transitions. Second operand 4 states. [2019-12-27 02:26:50,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:50,440 INFO L93 Difference]: Finished difference Result 34038 states and 116336 transitions. [2019-12-27 02:26:50,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:26:50,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-27 02:26:50,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:50,480 INFO L225 Difference]: With dead ends: 34038 [2019-12-27 02:26:50,481 INFO L226 Difference]: Without dead ends: 21154 [2019-12-27 02:26:50,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:26:50,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21154 states. [2019-12-27 02:26:50,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21154 to 20871. [2019-12-27 02:26:50,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20871 states. [2019-12-27 02:26:51,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20871 states to 20871 states and 73508 transitions. [2019-12-27 02:26:51,159 INFO L78 Accepts]: Start accepts. Automaton has 20871 states and 73508 transitions. Word has length 24 [2019-12-27 02:26:51,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:51,159 INFO L462 AbstractCegarLoop]: Abstraction has 20871 states and 73508 transitions. [2019-12-27 02:26:51,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:26:51,160 INFO L276 IsEmpty]: Start isEmpty. Operand 20871 states and 73508 transitions. [2019-12-27 02:26:51,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 02:26:51,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:51,168 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] [2019-12-27 02:26:51,168 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:51,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:51,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1161161883, now seen corresponding path program 1 times [2019-12-27 02:26:51,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:51,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214019527] [2019-12-27 02:26:51,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:51,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:26:51,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214019527] [2019-12-27 02:26:51,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:51,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:26:51,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589264844] [2019-12-27 02:26:51,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:26:51,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:51,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:26:51,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:26:51,243 INFO L87 Difference]: Start difference. First operand 20871 states and 73508 transitions. Second operand 5 states. [2019-12-27 02:26:51,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:51,350 INFO L93 Difference]: Finished difference Result 9585 states and 29775 transitions. [2019-12-27 02:26:51,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:26:51,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-27 02:26:51,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:51,368 INFO L225 Difference]: With dead ends: 9585 [2019-12-27 02:26:51,368 INFO L226 Difference]: Without dead ends: 8268 [2019-12-27 02:26:51,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:26:51,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8268 states. [2019-12-27 02:26:51,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8268 to 8268. [2019-12-27 02:26:51,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8268 states. [2019-12-27 02:26:51,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8268 states to 8268 states and 25567 transitions. [2019-12-27 02:26:51,564 INFO L78 Accepts]: Start accepts. Automaton has 8268 states and 25567 transitions. Word has length 24 [2019-12-27 02:26:51,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:51,565 INFO L462 AbstractCegarLoop]: Abstraction has 8268 states and 25567 transitions. [2019-12-27 02:26:51,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:26:51,565 INFO L276 IsEmpty]: Start isEmpty. Operand 8268 states and 25567 transitions. [2019-12-27 02:26:51,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 02:26:51,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:51,573 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:26:51,573 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:51,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:51,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1743073835, now seen corresponding path program 1 times [2019-12-27 02:26:51,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:51,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898246304] [2019-12-27 02:26:51,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:51,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:26:51,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898246304] [2019-12-27 02:26:51,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:51,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:26:51,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587327942] [2019-12-27 02:26:51,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:26:51,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:51,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:26:51,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:26:51,644 INFO L87 Difference]: Start difference. First operand 8268 states and 25567 transitions. Second operand 4 states. [2019-12-27 02:26:51,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:51,713 INFO L93 Difference]: Finished difference Result 12230 states and 37956 transitions. [2019-12-27 02:26:51,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:26:51,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 02:26:51,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:51,728 INFO L225 Difference]: With dead ends: 12230 [2019-12-27 02:26:51,728 INFO L226 Difference]: Without dead ends: 7682 [2019-12-27 02:26:51,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:26:51,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7682 states. [2019-12-27 02:26:51,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7682 to 7209. [2019-12-27 02:26:51,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7209 states. [2019-12-27 02:26:51,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7209 states to 7209 states and 21269 transitions. [2019-12-27 02:26:51,833 INFO L78 Accepts]: Start accepts. Automaton has 7209 states and 21269 transitions. Word has length 25 [2019-12-27 02:26:51,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:51,833 INFO L462 AbstractCegarLoop]: Abstraction has 7209 states and 21269 transitions. [2019-12-27 02:26:51,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:26:51,833 INFO L276 IsEmpty]: Start isEmpty. Operand 7209 states and 21269 transitions. [2019-12-27 02:26:51,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 02:26:51,836 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:51,837 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:26:51,837 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:51,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:51,837 INFO L82 PathProgramCache]: Analyzing trace with hash -82285579, now seen corresponding path program 2 times [2019-12-27 02:26:51,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:51,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430143982] [2019-12-27 02:26:51,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:51,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:26:51,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430143982] [2019-12-27 02:26:51,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:51,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:26:51,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551152784] [2019-12-27 02:26:51,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:26:51,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:51,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:26:51,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:26:51,927 INFO L87 Difference]: Start difference. First operand 7209 states and 21269 transitions. Second operand 6 states. [2019-12-27 02:26:52,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:52,058 INFO L93 Difference]: Finished difference Result 2913 states and 7585 transitions. [2019-12-27 02:26:52,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:26:52,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 02:26:52,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:52,063 INFO L225 Difference]: With dead ends: 2913 [2019-12-27 02:26:52,063 INFO L226 Difference]: Without dead ends: 2472 [2019-12-27 02:26:52,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:26:52,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2019-12-27 02:26:52,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 2472. [2019-12-27 02:26:52,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2019-12-27 02:26:52,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 6301 transitions. [2019-12-27 02:26:52,101 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 6301 transitions. Word has length 25 [2019-12-27 02:26:52,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:52,101 INFO L462 AbstractCegarLoop]: Abstraction has 2472 states and 6301 transitions. [2019-12-27 02:26:52,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:26:52,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 6301 transitions. [2019-12-27 02:26:52,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 02:26:52,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:52,106 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:26:52,106 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:52,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:52,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1619810495, now seen corresponding path program 1 times [2019-12-27 02:26:52,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:52,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236282603] [2019-12-27 02:26:52,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:52,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:26:52,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236282603] [2019-12-27 02:26:52,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:52,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:26:52,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019684996] [2019-12-27 02:26:52,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:26:52,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:52,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:26:52,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:26:52,163 INFO L87 Difference]: Start difference. First operand 2472 states and 6301 transitions. Second operand 3 states. [2019-12-27 02:26:52,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:52,239 INFO L93 Difference]: Finished difference Result 3752 states and 9516 transitions. [2019-12-27 02:26:52,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:26:52,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-27 02:26:52,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:52,245 INFO L225 Difference]: With dead ends: 3752 [2019-12-27 02:26:52,245 INFO L226 Difference]: Without dead ends: 3752 [2019-12-27 02:26:52,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:26:52,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2019-12-27 02:26:52,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 2928. [2019-12-27 02:26:52,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2928 states. [2019-12-27 02:26:52,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 7542 transitions. [2019-12-27 02:26:52,292 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 7542 transitions. Word has length 32 [2019-12-27 02:26:52,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:52,292 INFO L462 AbstractCegarLoop]: Abstraction has 2928 states and 7542 transitions. [2019-12-27 02:26:52,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:26:52,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 7542 transitions. [2019-12-27 02:26:52,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 02:26:52,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:52,295 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:26:52,296 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:52,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:52,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1082300219, now seen corresponding path program 1 times [2019-12-27 02:26:52,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:52,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126461516] [2019-12-27 02:26:52,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:52,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:26:52,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126461516] [2019-12-27 02:26:52,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:52,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:26:52,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748667005] [2019-12-27 02:26:52,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:26:52,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:52,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:26:52,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:26:52,379 INFO L87 Difference]: Start difference. First operand 2928 states and 7542 transitions. Second operand 6 states. [2019-12-27 02:26:52,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:52,815 INFO L93 Difference]: Finished difference Result 5425 states and 13386 transitions. [2019-12-27 02:26:52,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:26:52,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-27 02:26:52,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:52,823 INFO L225 Difference]: With dead ends: 5425 [2019-12-27 02:26:52,824 INFO L226 Difference]: Without dead ends: 5242 [2019-12-27 02:26:52,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:26:52,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5242 states. [2019-12-27 02:26:52,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5242 to 2952. [2019-12-27 02:26:52,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2019-12-27 02:26:52,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 7548 transitions. [2019-12-27 02:26:52,871 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 7548 transitions. Word has length 32 [2019-12-27 02:26:52,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:52,871 INFO L462 AbstractCegarLoop]: Abstraction has 2952 states and 7548 transitions. [2019-12-27 02:26:52,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:26:52,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 7548 transitions. [2019-12-27 02:26:52,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 02:26:52,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:52,875 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] [2019-12-27 02:26:52,875 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:52,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:52,875 INFO L82 PathProgramCache]: Analyzing trace with hash -345264620, now seen corresponding path program 1 times [2019-12-27 02:26:52,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:52,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486824298] [2019-12-27 02:26:52,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:52,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:26:52,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486824298] [2019-12-27 02:26:52,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:52,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:26:52,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445577894] [2019-12-27 02:26:52,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:26:52,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:52,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:26:52,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:26:52,996 INFO L87 Difference]: Start difference. First operand 2952 states and 7548 transitions. Second operand 6 states. [2019-12-27 02:26:53,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:53,420 INFO L93 Difference]: Finished difference Result 5331 states and 12930 transitions. [2019-12-27 02:26:53,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:26:53,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 02:26:53,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:53,427 INFO L225 Difference]: With dead ends: 5331 [2019-12-27 02:26:53,428 INFO L226 Difference]: Without dead ends: 5133 [2019-12-27 02:26:53,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:26:53,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5133 states. [2019-12-27 02:26:53,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5133 to 2837. [2019-12-27 02:26:53,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2837 states. [2019-12-27 02:26:53,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2837 states to 2837 states and 7139 transitions. [2019-12-27 02:26:53,471 INFO L78 Accepts]: Start accepts. Automaton has 2837 states and 7139 transitions. Word has length 33 [2019-12-27 02:26:53,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:53,471 INFO L462 AbstractCegarLoop]: Abstraction has 2837 states and 7139 transitions. [2019-12-27 02:26:53,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:26:53,471 INFO L276 IsEmpty]: Start isEmpty. Operand 2837 states and 7139 transitions. [2019-12-27 02:26:53,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 02:26:53,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:53,475 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] [2019-12-27 02:26:53,475 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:53,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:53,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1104473775, now seen corresponding path program 1 times [2019-12-27 02:26:53,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:53,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968572642] [2019-12-27 02:26:53,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:53,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:26:53,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968572642] [2019-12-27 02:26:53,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:53,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:26:53,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339776119] [2019-12-27 02:26:53,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:26:53,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:53,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:26:53,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:26:53,569 INFO L87 Difference]: Start difference. First operand 2837 states and 7139 transitions. Second operand 7 states. [2019-12-27 02:26:53,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:53,687 INFO L93 Difference]: Finished difference Result 2153 states and 5477 transitions. [2019-12-27 02:26:53,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:26:53,688 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 02:26:53,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:53,689 INFO L225 Difference]: With dead ends: 2153 [2019-12-27 02:26:53,689 INFO L226 Difference]: Without dead ends: 476 [2019-12-27 02:26:53,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:26:53,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-12-27 02:26:53,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 470. [2019-12-27 02:26:53,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-12-27 02:26:53,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1059 transitions. [2019-12-27 02:26:53,695 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1059 transitions. Word has length 34 [2019-12-27 02:26:53,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:53,695 INFO L462 AbstractCegarLoop]: Abstraction has 470 states and 1059 transitions. [2019-12-27 02:26:53,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:26:53,695 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1059 transitions. [2019-12-27 02:26:53,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 02:26:53,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:53,697 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:26:53,697 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:53,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:53,697 INFO L82 PathProgramCache]: Analyzing trace with hash -126758993, now seen corresponding path program 1 times [2019-12-27 02:26:53,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:53,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325316462] [2019-12-27 02:26:53,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:53,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:26:53,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325316462] [2019-12-27 02:26:53,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:53,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:26:53,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952949889] [2019-12-27 02:26:53,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:26:53,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:53,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:26:53,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:26:53,782 INFO L87 Difference]: Start difference. First operand 470 states and 1059 transitions. Second operand 7 states. [2019-12-27 02:26:53,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:53,939 INFO L93 Difference]: Finished difference Result 892 states and 1966 transitions. [2019-12-27 02:26:53,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:26:53,940 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-27 02:26:53,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:53,941 INFO L225 Difference]: With dead ends: 892 [2019-12-27 02:26:53,941 INFO L226 Difference]: Without dead ends: 594 [2019-12-27 02:26:53,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:26:53,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-12-27 02:26:53,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 536. [2019-12-27 02:26:53,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-27 02:26:53,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1171 transitions. [2019-12-27 02:26:53,949 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1171 transitions. Word has length 48 [2019-12-27 02:26:53,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:53,951 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1171 transitions. [2019-12-27 02:26:53,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:26:53,951 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1171 transitions. [2019-12-27 02:26:53,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 02:26:53,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:53,952 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:26:53,953 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:53,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:53,953 INFO L82 PathProgramCache]: Analyzing trace with hash 24927743, now seen corresponding path program 2 times [2019-12-27 02:26:53,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:53,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144838682] [2019-12-27 02:26:53,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:26:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:26:54,165 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:26:54,166 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:26:54,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_119| 0 0))) (and (= v_~z~0_122 0) (= v_~z$w_buff0_used~0_514 0) (= v_~z$mem_tmp~0_32 0) (= v_~main$tmp_guard0~0_30 0) (= v_~main$tmp_guard1~0_50 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= 0 v_~__unbuffered_p3_EBX~0_94) (= |v_#valid_117| (store .cse0 |v_ULTIMATE.start_main_~#t1029~0.base_71| 1)) (= 0 v_~__unbuffered_p3_EAX~0_93) (= 0 v_~weak$$choice0~0_26) (< 0 |v_#StackHeapBarrier_19|) (= 0 |v_ULTIMATE.start_main_~#t1029~0.offset_43|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (= v_~z$w_buff0~0_183 0) (= 0 v_~z$r_buff1_thd3~0_197) (= 0 v_~z$flush_delayed~0_53) (= 0 v_~z$r_buff1_thd1~0_59) (= (select .cse0 |v_ULTIMATE.start_main_~#t1029~0.base_71|) 0) (= 0 v_~z$r_buff0_thd4~0_166) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff1_thd0~0_138 0) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1029~0.base_71|) (= v_~z$r_buff0_thd2~0_57 0) (= v_~z$read_delayed~0_7 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1029~0.base_71| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1029~0.base_71|) |v_ULTIMATE.start_main_~#t1029~0.offset_43| 0)) |v_#memory_int_27|) (= |v_#NULL.offset_5| 0) (= v_~weak$$choice2~0_111 0) (= 0 v_~z$r_buff0_thd3~0_266) (= v_~x~0_36 0) (= v_~y~0_68 0) (= v_~z$w_buff1_used~0_298 0) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_p0_EAX~0_66) (= v_~z$w_buff1~0_123 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t1029~0.base_71| 4)) (= v_~b~0_79 0) (= v_~__unbuffered_cnt~0_126 0) (= 0 v_~__unbuffered_p2_EAX~0_55))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_119|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t1030~0.offset=|v_ULTIMATE.start_main_~#t1030~0.offset_41|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ULTIMATE.start_main_~#t1029~0.base=|v_ULTIMATE.start_main_~#t1029~0.base_71|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, #NULL.offset=|v_#NULL.offset_5|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_~#t1032~0.base=|v_ULTIMATE.start_main_~#t1032~0.base_36|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_93, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ~z$mem_tmp~0=v_~z$mem_tmp~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_81|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_298, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_72|, ~z$flush_delayed~0=v_~z$flush_delayed~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_26, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_59, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_266, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_36, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_110, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_18|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_138, ~y~0=v_~y~0_68, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_514, ~z$w_buff0~0=v_~z$w_buff0~0_183, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_197, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_45|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_141|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_94, ULTIMATE.start_main_~#t1032~0.offset=|v_ULTIMATE.start_main_~#t1032~0.offset_24|, ULTIMATE.start_main_~#t1030~0.base=|v_ULTIMATE.start_main_~#t1030~0.base_68|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t1031~0.offset=|v_ULTIMATE.start_main_~#t1031~0.offset_25|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_103|, ULTIMATE.start_main_~#t1031~0.base=|v_ULTIMATE.start_main_~#t1031~0.base_36|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_44|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_122, ULTIMATE.start_main_~#t1029~0.offset=|v_ULTIMATE.start_main_~#t1029~0.offset_43|, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1030~0.offset, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1029~0.base, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1032~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t1032~0.offset, ULTIMATE.start_main_~#t1030~0.base, #NULL.base, ULTIMATE.start_main_~#t1031~0.offset, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1031~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t1029~0.offset, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:26:54,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1030~0.base_11| 0)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1030~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1030~0.offset_10| 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1030~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1030~0.base_11|) |v_ULTIMATE.start_main_~#t1030~0.offset_10| 1)) |v_#memory_int_19|) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1030~0.base_11| 1) |v_#valid_48|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1030~0.base_11|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1030~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1030~0.offset=|v_ULTIMATE.start_main_~#t1030~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1030~0.base=|v_ULTIMATE.start_main_~#t1030~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1030~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1030~0.base] because there is no mapped edge [2019-12-27 02:26:54,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1031~0.base_12| 1)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1031~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t1031~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t1031~0.offset_11| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1031~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1031~0.base_12|) |v_ULTIMATE.start_main_~#t1031~0.offset_11| 2)) |v_#memory_int_17|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1031~0.base_12| 4) |v_#length_21|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1031~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1031~0.offset=|v_ULTIMATE.start_main_~#t1031~0.offset_11|, ULTIMATE.start_main_~#t1031~0.base=|v_ULTIMATE.start_main_~#t1031~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1031~0.offset, ULTIMATE.start_main_~#t1031~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 02:26:54,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1032~0.base_12|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1032~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1032~0.base_12|) |v_ULTIMATE.start_main_~#t1032~0.offset_10| 3)) |v_#memory_int_15|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1032~0.base_12| 4)) (= |v_ULTIMATE.start_main_~#t1032~0.offset_10| 0) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1032~0.base_12|)) (= (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1032~0.base_12| 1) |v_#valid_42|) (not (= 0 |v_ULTIMATE.start_main_~#t1032~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1032~0.base=|v_ULTIMATE.start_main_~#t1032~0.base_12|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1032~0.offset=|v_ULTIMATE.start_main_~#t1032~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1032~0.base, #length, ULTIMATE.start_main_~#t1032~0.offset] because there is no mapped edge [2019-12-27 02:26:54,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= ~__unbuffered_p3_EAX~0_Out1417846853 ~a~0_Out1417846853) (= 1 ~z$r_buff0_thd4~0_Out1417846853) (= ~z$r_buff0_thd1~0_In1417846853 ~z$r_buff1_thd1~0_Out1417846853) (= ~z$r_buff1_thd4~0_Out1417846853 ~z$r_buff0_thd4~0_In1417846853) (= ~z$r_buff1_thd3~0_Out1417846853 ~z$r_buff0_thd3~0_In1417846853) (= ~z$r_buff1_thd0~0_Out1417846853 ~z$r_buff0_thd0~0_In1417846853) (= ~z$r_buff0_thd2~0_In1417846853 ~z$r_buff1_thd2~0_Out1417846853) (= 1 ~a~0_Out1417846853) (= ~b~0_In1417846853 ~__unbuffered_p3_EBX~0_Out1417846853) (not (= P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1417846853 0))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1417846853, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1417846853, ~b~0=~b~0_In1417846853, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1417846853, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1417846853, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1417846853, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1417846853} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1417846853, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out1417846853, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1417846853, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1417846853, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out1417846853, ~a~0=~a~0_Out1417846853, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1417846853, ~b~0=~b~0_In1417846853, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1417846853, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1417846853, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out1417846853, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1417846853, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1417846853, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1417846853, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1417846853} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 02:26:54,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_~x~0_30 v_~__unbuffered_p0_EAX~0_26) (= v_P0Thread1of1ForFork3_~arg.base_22 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_22) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= v_~b~0_48 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~b~0=v_~b~0_48, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_22, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_22, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-27 02:26:54,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_7|) (= v_P1Thread1of1ForFork0_~arg.base_11 |v_P1Thread1of1ForFork0_#in~arg.base_11|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_11) (= v_~x~0_19 1) (= 0 |v_P1Thread1of1ForFork0_#res.offset_7|) (= v_~y~0_18 1)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_11, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_11, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, ~y~0=v_~y~0_18, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-27 02:26:54,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1479744684 256) 0))) (or (and (not .cse0) (= ~z$w_buff0~0_In1479744684 |P2Thread1of1ForFork1_#t~ite9_Out1479744684|) (= |P2Thread1of1ForFork1_#t~ite8_In1479744684| |P2Thread1of1ForFork1_#t~ite8_Out1479744684|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1479744684 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1479744684 256)) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In1479744684 256) 0)) (and (= (mod ~z$w_buff1_used~0_In1479744684 256) 0) .cse1))) (= |P2Thread1of1ForFork1_#t~ite9_Out1479744684| |P2Thread1of1ForFork1_#t~ite8_Out1479744684|) (= ~z$w_buff0~0_In1479744684 |P2Thread1of1ForFork1_#t~ite8_Out1479744684|) .cse0))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1479744684, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1479744684, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1479744684, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1479744684, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1479744684, ~weak$$choice2~0=~weak$$choice2~0_In1479744684, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In1479744684|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In1479744684, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1479744684, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1479744684, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1479744684, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1479744684, ~weak$$choice2~0=~weak$$choice2~0_In1479744684, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out1479744684|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out1479744684|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 02:26:54,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1686993384 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite11_In1686993384| |P2Thread1of1ForFork1_#t~ite11_Out1686993384|) (= |P2Thread1of1ForFork1_#t~ite12_Out1686993384| ~z$w_buff1~0_In1686993384) (not .cse0)) (and (= |P2Thread1of1ForFork1_#t~ite12_Out1686993384| |P2Thread1of1ForFork1_#t~ite11_Out1686993384|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1686993384 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In1686993384 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In1686993384 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In1686993384 256)) .cse1))) (= ~z$w_buff1~0_In1686993384 |P2Thread1of1ForFork1_#t~ite11_Out1686993384|) .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1686993384, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1686993384, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In1686993384|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1686993384, ~z$w_buff1~0=~z$w_buff1~0_In1686993384, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1686993384, ~weak$$choice2~0=~weak$$choice2~0_In1686993384} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1686993384, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out1686993384|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1686993384, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out1686993384|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1686993384, ~z$w_buff1~0=~z$w_buff1~0_In1686993384, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1686993384, ~weak$$choice2~0=~weak$$choice2~0_In1686993384} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 02:26:54,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In765441993 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite14_Out765441993| ~z$w_buff0_used~0_In765441993) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In765441993 256)))) (or (= (mod ~z$w_buff0_used~0_In765441993 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In765441993 256)) .cse1) (and (= (mod ~z$r_buff1_thd3~0_In765441993 256) 0) .cse1))) (= |P2Thread1of1ForFork1_#t~ite15_Out765441993| |P2Thread1of1ForFork1_#t~ite14_Out765441993|)) (and (= |P2Thread1of1ForFork1_#t~ite15_Out765441993| ~z$w_buff0_used~0_In765441993) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite14_In765441993| |P2Thread1of1ForFork1_#t~ite14_Out765441993|)))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In765441993|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In765441993, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In765441993, ~z$w_buff1_used~0=~z$w_buff1_used~0_In765441993, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In765441993, ~weak$$choice2~0=~weak$$choice2~0_In765441993} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out765441993|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out765441993|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In765441993, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In765441993, ~z$w_buff1_used~0=~z$w_buff1_used~0_In765441993, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In765441993, ~weak$$choice2~0=~weak$$choice2~0_In765441993} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-27 02:26:54,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_90 v_~z$r_buff0_thd3~0_89) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_11|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_89, ~weak$$choice2~0=v_~weak$$choice2~0_22, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 02:26:54,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In97042665 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite23_In97042665| |P2Thread1of1ForFork1_#t~ite23_Out97042665|) (not .cse0) (= ~z$r_buff1_thd3~0_In97042665 |P2Thread1of1ForFork1_#t~ite24_Out97042665|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In97042665 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In97042665 256))) (and (= (mod ~z$w_buff1_used~0_In97042665 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In97042665 256)))) (= |P2Thread1of1ForFork1_#t~ite24_Out97042665| |P2Thread1of1ForFork1_#t~ite23_Out97042665|) .cse0 (= ~z$r_buff1_thd3~0_In97042665 |P2Thread1of1ForFork1_#t~ite23_Out97042665|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In97042665, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In97042665, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In97042665|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In97042665, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In97042665, ~weak$$choice2~0=~weak$$choice2~0_In97042665} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out97042665|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In97042665, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In97042665, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out97042665|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In97042665, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In97042665, ~weak$$choice2~0=~weak$$choice2~0_In97042665} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-27 02:26:54,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_8) (= v_~z~0_22 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 02:26:54,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-729347557 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-729347557 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-729347557 |P3Thread1of1ForFork2_#t~ite28_Out-729347557|)) (and (not .cse1) (not .cse0) (= 0 |P3Thread1of1ForFork2_#t~ite28_Out-729347557|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-729347557, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-729347557} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-729347557|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-729347557, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-729347557} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 02:26:54,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1051375296 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1051375296 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-1051375296 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1051375296 256) 0))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite29_Out-1051375296|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-1051375296 |P3Thread1of1ForFork2_#t~ite29_Out-1051375296|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1051375296, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1051375296, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1051375296, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1051375296} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1051375296|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1051375296, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1051375296, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1051375296, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1051375296} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 02:26:54,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-2141069321 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-2141069321 256)))) (or (and (not .cse0) (= ~z$r_buff0_thd4~0_Out-2141069321 0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd4~0_Out-2141069321 ~z$r_buff0_thd4~0_In-2141069321)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2141069321, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2141069321} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2141069321, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-2141069321, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out-2141069321|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-27 02:26:54,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In681306 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd4~0_In681306 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In681306 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In681306 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite31_Out681306| 0)) (and (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite31_Out681306| ~z$r_buff1_thd4~0_In681306) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In681306, ~z$w_buff0_used~0=~z$w_buff0_used~0_In681306, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In681306, ~z$w_buff1_used~0=~z$w_buff1_used~0_In681306} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In681306, ~z$w_buff0_used~0=~z$w_buff0_used~0_In681306, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In681306, ~z$w_buff1_used~0=~z$w_buff1_used~0_In681306, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out681306|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 02:26:54,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L824-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= |v_P3Thread1of1ForFork2_#t~ite31_44| v_~z$r_buff1_thd4~0_62)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_44|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_62, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_43|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 02:26:54,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_93 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 02:26:54,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite37_Out-780944295| |ULTIMATE.start_main_#t~ite36_Out-780944295|)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-780944295 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-780944295 256) 0))) (or (and .cse0 (not .cse1) (= ~z$w_buff1~0_In-780944295 |ULTIMATE.start_main_#t~ite36_Out-780944295|) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= ~z~0_In-780944295 |ULTIMATE.start_main_#t~ite36_Out-780944295|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-780944295, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-780944295, ~z$w_buff1~0=~z$w_buff1~0_In-780944295, ~z~0=~z~0_In-780944295} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-780944295, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-780944295, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-780944295|, ~z$w_buff1~0=~z$w_buff1~0_In-780944295, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-780944295|, ~z~0=~z~0_In-780944295} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 02:26:54,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1767320567 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1767320567 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-1767320567| ~z$w_buff0_used~0_In-1767320567) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-1767320567| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1767320567, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1767320567} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1767320567, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1767320567, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1767320567|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 02:26:54,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1309310747 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1309310747 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1309310747 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1309310747 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out1309310747| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite39_Out1309310747| ~z$w_buff1_used~0_In1309310747) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1309310747, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1309310747, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1309310747, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1309310747} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1309310747, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1309310747|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1309310747, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1309310747, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1309310747} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 02:26:54,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In751229604 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In751229604 256)))) (or (and (= ~z$r_buff0_thd0~0_In751229604 |ULTIMATE.start_main_#t~ite40_Out751229604|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite40_Out751229604|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In751229604, ~z$w_buff0_used~0=~z$w_buff0_used~0_In751229604} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In751229604, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out751229604|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In751229604} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 02:26:54,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-187854922 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-187854922 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-187854922 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-187854922 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite41_Out-187854922|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd0~0_In-187854922 |ULTIMATE.start_main_#t~ite41_Out-187854922|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-187854922, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-187854922, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-187854922, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-187854922} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-187854922|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-187854922, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-187854922, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-187854922, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-187854922} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 02:26:54,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= v_~y~0_25 2) (= |v_ULTIMATE.start_main_#t~ite41_31| v_~z$r_buff1_thd0~0_73) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~__unbuffered_p0_EAX~0_32) (= 0 v_~__unbuffered_p2_EAX~0_16)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_73, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:26:54,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:26:54 BasicIcfg [2019-12-27 02:26:54,288 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:26:54,291 INFO L168 Benchmark]: Toolchain (without parser) took 29028.90 ms. Allocated memory was 138.9 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 100.4 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 02:26:54,292 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 02:26:54,292 INFO L168 Benchmark]: CACSL2BoogieTranslator took 791.11 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.2 MB in the beginning and 156.6 MB in the end (delta: -56.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:26:54,294 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.67 ms. Allocated memory is still 203.4 MB. Free memory was 156.6 MB in the beginning and 154.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:26:54,298 INFO L168 Benchmark]: Boogie Preprocessor took 38.04 ms. Allocated memory is still 203.4 MB. Free memory was 154.0 MB in the beginning and 151.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:26:54,298 INFO L168 Benchmark]: RCFGBuilder took 854.75 ms. Allocated memory is still 203.4 MB. Free memory was 151.3 MB in the beginning and 105.5 MB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:26:54,299 INFO L168 Benchmark]: TraceAbstraction took 27279.14 ms. Allocated memory was 203.4 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 104.9 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 02:26:54,307 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.48 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 791.11 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.2 MB in the beginning and 156.6 MB in the end (delta: -56.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.67 ms. Allocated memory is still 203.4 MB. Free memory was 156.6 MB in the beginning and 154.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.04 ms. Allocated memory is still 203.4 MB. Free memory was 154.0 MB in the beginning and 151.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 854.75 ms. Allocated memory is still 203.4 MB. Free memory was 151.3 MB in the beginning and 105.5 MB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27279.14 ms. Allocated memory was 203.4 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 104.9 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 170 ProgramPointsBefore, 74 ProgramPointsAfterwards, 192 TransitionsBefore, 78 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 23 ChoiceCompositions, 5707 VarBasedMoverChecksPositive, 158 VarBasedMoverChecksNegative, 28 SemBasedMoverChecksPositive, 169 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 44168 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t1029, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1030, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1031, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1032, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 1 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L820] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 2 [L773] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 3 z$flush_delayed = weak$$choice2 [L776] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L783] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L821] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L822] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 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 [L858] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 158 locations, 2 error locations. Result: UNSAFE, OverallTime: 26.9s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1800 SDtfs, 2563 SDslu, 2872 SDs, 0 SdLazy, 1049 SolverSat, 174 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31012occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 15582 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 474 NumberOfCodeBlocks, 474 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 409 ConstructedInterpolants, 0 QuantifiedInterpolants, 29991 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...