/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/mix037_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:21:26,981 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:21:26,983 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:21:26,996 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:21:26,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:21:26,997 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:21:26,999 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:21:27,000 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:21:27,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:21:27,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:21:27,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:21:27,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:21:27,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:21:27,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:21:27,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:21:27,009 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:21:27,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:21:27,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:21:27,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:21:27,015 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:21:27,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:21:27,024 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:21:27,025 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:21:27,027 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:21:27,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:21:27,032 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:21:27,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:21:27,033 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:21:27,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:21:27,036 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:21:27,036 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:21:27,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:21:27,040 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:21:27,042 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:21:27,045 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:21:27,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:21:27,046 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:21:27,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:21:27,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:21:27,049 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:21:27,050 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:21:27,051 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:21:27,074 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:21:27,075 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:21:27,077 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:21:27,077 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:21:27,078 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:21:27,078 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:21:27,078 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:21:27,078 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:21:27,078 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:21:27,079 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:21:27,080 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:21:27,080 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:21:27,080 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:21:27,080 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:21:27,081 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:21:27,081 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:21:27,081 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:21:27,081 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:21:27,081 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:21:27,082 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:21:27,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:21:27,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:21:27,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:21:27,082 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:21:27,082 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:21:27,083 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:21:27,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:21:27,083 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:21:27,083 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:21:27,349 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:21:27,359 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:21:27,363 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:21:27,365 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:21:27,365 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:21:27,366 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_power.opt.i [2019-12-27 02:21:27,432 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dc2b9896/7ef938ba51784dcfabd19000560d6a63/FLAG649748e64 [2019-12-27 02:21:28,013 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:21:28,014 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_power.opt.i [2019-12-27 02:21:28,038 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dc2b9896/7ef938ba51784dcfabd19000560d6a63/FLAG649748e64 [2019-12-27 02:21:28,277 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dc2b9896/7ef938ba51784dcfabd19000560d6a63 [2019-12-27 02:21:28,287 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:21:28,289 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:21:28,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:21:28,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:21:28,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:21:28,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:21:28" (1/1) ... [2019-12-27 02:21:28,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17a48cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:21:28, skipping insertion in model container [2019-12-27 02:21:28,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:21:28" (1/1) ... [2019-12-27 02:21:28,306 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:21:28,371 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:21:28,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:21:28,915 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:21:28,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:21:29,065 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:21:29,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:21:29 WrapperNode [2019-12-27 02:21:29,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:21:29,068 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:21:29,068 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:21:29,068 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:21:29,078 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:21:29" (1/1) ... [2019-12-27 02:21:29,124 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:21:29" (1/1) ... [2019-12-27 02:21:29,177 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:21:29,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:21:29,179 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:21:29,179 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:21:29,189 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:21:29" (1/1) ... [2019-12-27 02:21:29,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:21:29" (1/1) ... [2019-12-27 02:21:29,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:21:29" (1/1) ... [2019-12-27 02:21:29,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:21:29" (1/1) ... [2019-12-27 02:21:29,218 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:21:29" (1/1) ... [2019-12-27 02:21:29,222 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:21:29" (1/1) ... [2019-12-27 02:21:29,226 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:21:29" (1/1) ... [2019-12-27 02:21:29,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:21:29,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:21:29,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:21:29,232 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:21:29,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:21:29" (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:21:29,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:21:29,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:21:29,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:21:29,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:21:29,313 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:21:29,313 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:21:29,313 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:21:29,313 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:21:29,313 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:21:29,313 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:21:29,314 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 02:21:29,314 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 02:21:29,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:21:29,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:21:29,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:21:29,316 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:21:30,027 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:21:30,028 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:21:30,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:21:30 BoogieIcfgContainer [2019-12-27 02:21:30,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:21:30,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:21:30,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:21:30,035 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:21:30,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:21:28" (1/3) ... [2019-12-27 02:21:30,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6324e071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:21:30, skipping insertion in model container [2019-12-27 02:21:30,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:21:29" (2/3) ... [2019-12-27 02:21:30,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6324e071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:21:30, skipping insertion in model container [2019-12-27 02:21:30,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:21:30" (3/3) ... [2019-12-27 02:21:30,039 INFO L109 eAbstractionObserver]: Analyzing ICFG mix037_power.opt.i [2019-12-27 02:21:30,050 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:21:30,050 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:21:30,058 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:21:30,059 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:21:30,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,101 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,101 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,103 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,103 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,106 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,106 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,145 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,145 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,145 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,146 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,146 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,146 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,146 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,146 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,147 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,147 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,147 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,148 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,148 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,148 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,148 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,148 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,149 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,149 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,149 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,149 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,149 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,150 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,150 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,150 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,150 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,150 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,151 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,151 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,151 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,151 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,151 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,152 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,152 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,152 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,155 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,156 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,160 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,162 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,166 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,166 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,167 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,167 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,167 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,167 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,167 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,168 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,171 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,172 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:21:30,186 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 02:21:30,207 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:21:30,207 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:21:30,207 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:21:30,208 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:21:30,208 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:21:30,208 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:21:30,208 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:21:30,208 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:21:30,225 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-27 02:21:30,227 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-27 02:21:30,322 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-27 02:21:30,323 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:21:30,335 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:21:30,356 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-27 02:21:30,403 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-27 02:21:30,404 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:21:30,410 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:21:30,425 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-27 02:21:30,427 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:21:35,376 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 02:21:35,488 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 02:21:36,027 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-27 02:21:36,206 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-27 02:21:36,223 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44168 [2019-12-27 02:21:36,224 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-27 02:21:36,227 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 78 transitions [2019-12-27 02:21:37,575 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 21398 states. [2019-12-27 02:21:37,577 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states. [2019-12-27 02:21:37,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 02:21:37,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:37,585 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:37,586 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:21:37,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:37,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1244651740, now seen corresponding path program 1 times [2019-12-27 02:21:37,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:37,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37199354] [2019-12-27 02:21:37,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:37,973 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:21:37,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37199354] [2019-12-27 02:21:37,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:37,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:21:37,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112273923] [2019-12-27 02:21:37,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:21:37,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:37,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:21:37,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:21:37,996 INFO L87 Difference]: Start difference. First operand 21398 states. Second operand 3 states. [2019-12-27 02:21:38,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:38,540 INFO L93 Difference]: Finished difference Result 20958 states and 90416 transitions. [2019-12-27 02:21:38,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:21:38,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 02:21:38,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:38,835 INFO L225 Difference]: With dead ends: 20958 [2019-12-27 02:21:38,835 INFO L226 Difference]: Without dead ends: 19662 [2019-12-27 02:21:38,837 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:21:39,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2019-12-27 02:21:40,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 19662. [2019-12-27 02:21:40,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19662 states. [2019-12-27 02:21:40,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19662 states to 19662 states and 84692 transitions. [2019-12-27 02:21:40,667 INFO L78 Accepts]: Start accepts. Automaton has 19662 states and 84692 transitions. Word has length 9 [2019-12-27 02:21:40,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:40,669 INFO L462 AbstractCegarLoop]: Abstraction has 19662 states and 84692 transitions. [2019-12-27 02:21:40,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:21:40,669 INFO L276 IsEmpty]: Start isEmpty. Operand 19662 states and 84692 transitions. [2019-12-27 02:21:40,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 02:21:40,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:40,684 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:40,685 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:21:40,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:40,685 INFO L82 PathProgramCache]: Analyzing trace with hash -6792795, now seen corresponding path program 1 times [2019-12-27 02:21:40,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:40,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41766212] [2019-12-27 02:21:40,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:40,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:21:40,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41766212] [2019-12-27 02:21:40,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:40,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:21:40,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945404515] [2019-12-27 02:21:40,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:21:40,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:40,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:21:40,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:21:40,855 INFO L87 Difference]: Start difference. First operand 19662 states and 84692 transitions. Second operand 4 states. [2019-12-27 02:21:41,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:41,657 INFO L93 Difference]: Finished difference Result 30494 states and 126452 transitions. [2019-12-27 02:21:41,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:21:41,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 02:21:41,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:41,815 INFO L225 Difference]: With dead ends: 30494 [2019-12-27 02:21:41,815 INFO L226 Difference]: Without dead ends: 30438 [2019-12-27 02:21:41,816 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:21:42,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30438 states. [2019-12-27 02:21:43,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30438 to 27742. [2019-12-27 02:21:43,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-12-27 02:21:44,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 116300 transitions. [2019-12-27 02:21:44,044 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 116300 transitions. Word has length 15 [2019-12-27 02:21:44,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:44,044 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 116300 transitions. [2019-12-27 02:21:44,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:21:44,044 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 116300 transitions. [2019-12-27 02:21:44,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 02:21:44,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:44,051 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:21:44,051 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:21:44,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:44,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1479332799, now seen corresponding path program 1 times [2019-12-27 02:21:44,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:44,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787320156] [2019-12-27 02:21:44,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:44,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:44,183 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:21:44,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787320156] [2019-12-27 02:21:44,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:44,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:21:44,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878045412] [2019-12-27 02:21:44,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:21:44,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:44,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:21:44,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:21:44,185 INFO L87 Difference]: Start difference. First operand 27742 states and 116300 transitions. Second operand 4 states. [2019-12-27 02:21:44,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:44,761 INFO L93 Difference]: Finished difference Result 35230 states and 146308 transitions. [2019-12-27 02:21:44,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:21:44,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 02:21:44,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:44,928 INFO L225 Difference]: With dead ends: 35230 [2019-12-27 02:21:44,928 INFO L226 Difference]: Without dead ends: 35182 [2019-12-27 02:21:44,928 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:21:45,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35182 states. [2019-12-27 02:21:46,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35182 to 30378. [2019-12-27 02:21:46,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30378 states. [2019-12-27 02:21:46,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30378 states to 30378 states and 127172 transitions. [2019-12-27 02:21:46,419 INFO L78 Accepts]: Start accepts. Automaton has 30378 states and 127172 transitions. Word has length 18 [2019-12-27 02:21:46,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:46,419 INFO L462 AbstractCegarLoop]: Abstraction has 30378 states and 127172 transitions. [2019-12-27 02:21:46,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:21:46,420 INFO L276 IsEmpty]: Start isEmpty. Operand 30378 states and 127172 transitions. [2019-12-27 02:21:46,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 02:21:46,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:46,429 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:46,429 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:21:46,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:46,430 INFO L82 PathProgramCache]: Analyzing trace with hash -45820751, now seen corresponding path program 1 times [2019-12-27 02:21:46,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:46,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290228717] [2019-12-27 02:21:46,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:46,486 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:21:46,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290228717] [2019-12-27 02:21:46,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:46,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:21:46,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58725951] [2019-12-27 02:21:46,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:21:46,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:46,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:21:46,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:21:46,490 INFO L87 Difference]: Start difference. First operand 30378 states and 127172 transitions. Second operand 3 states. [2019-12-27 02:21:46,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:46,633 INFO L93 Difference]: Finished difference Result 29747 states and 123892 transitions. [2019-12-27 02:21:46,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:21:46,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 02:21:46,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:46,738 INFO L225 Difference]: With dead ends: 29747 [2019-12-27 02:21:46,739 INFO L226 Difference]: Without dead ends: 29747 [2019-12-27 02:21:46,739 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:21:46,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29747 states. [2019-12-27 02:21:49,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29747 to 29747. [2019-12-27 02:21:49,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29747 states. [2019-12-27 02:21:49,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29747 states to 29747 states and 123892 transitions. [2019-12-27 02:21:49,122 INFO L78 Accepts]: Start accepts. Automaton has 29747 states and 123892 transitions. Word has length 20 [2019-12-27 02:21:49,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:49,123 INFO L462 AbstractCegarLoop]: Abstraction has 29747 states and 123892 transitions. [2019-12-27 02:21:49,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:21:49,123 INFO L276 IsEmpty]: Start isEmpty. Operand 29747 states and 123892 transitions. [2019-12-27 02:21:49,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 02:21:49,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:49,137 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:21:49,138 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:21:49,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:49,138 INFO L82 PathProgramCache]: Analyzing trace with hash -129088173, now seen corresponding path program 1 times [2019-12-27 02:21:49,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:49,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583756822] [2019-12-27 02:21:49,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:49,200 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:21:49,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583756822] [2019-12-27 02:21:49,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:49,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:21:49,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060829423] [2019-12-27 02:21:49,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:21:49,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:49,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:21:49,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:21:49,202 INFO L87 Difference]: Start difference. First operand 29747 states and 123892 transitions. Second operand 3 states. [2019-12-27 02:21:49,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:49,711 INFO L93 Difference]: Finished difference Result 36709 states and 144810 transitions. [2019-12-27 02:21:49,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:21:49,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 02:21:49,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:49,789 INFO L225 Difference]: With dead ends: 36709 [2019-12-27 02:21:49,789 INFO L226 Difference]: Without dead ends: 30167 [2019-12-27 02:21:49,789 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:21:49,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30167 states. [2019-12-27 02:21:50,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30167 to 29499. [2019-12-27 02:21:50,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29499 states. [2019-12-27 02:21:50,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29499 states to 29499 states and 115623 transitions. [2019-12-27 02:21:50,847 INFO L78 Accepts]: Start accepts. Automaton has 29499 states and 115623 transitions. Word has length 21 [2019-12-27 02:21:50,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:50,847 INFO L462 AbstractCegarLoop]: Abstraction has 29499 states and 115623 transitions. [2019-12-27 02:21:50,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:21:50,847 INFO L276 IsEmpty]: Start isEmpty. Operand 29499 states and 115623 transitions. [2019-12-27 02:21:50,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 02:21:50,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:50,858 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:21:50,858 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:21:50,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:50,858 INFO L82 PathProgramCache]: Analyzing trace with hash 484267595, now seen corresponding path program 1 times [2019-12-27 02:21:50,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:50,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180805197] [2019-12-27 02:21:50,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:50,901 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:21:50,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180805197] [2019-12-27 02:21:50,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:50,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:21:50,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686293770] [2019-12-27 02:21:50,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:21:50,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:50,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:21:50,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:21:50,903 INFO L87 Difference]: Start difference. First operand 29499 states and 115623 transitions. Second operand 3 states. [2019-12-27 02:21:51,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:51,062 INFO L93 Difference]: Finished difference Result 29289 states and 114842 transitions. [2019-12-27 02:21:51,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:21:51,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 02:21:51,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:51,129 INFO L225 Difference]: With dead ends: 29289 [2019-12-27 02:21:51,129 INFO L226 Difference]: Without dead ends: 29289 [2019-12-27 02:21:51,130 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:21:51,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29289 states. [2019-12-27 02:21:53,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29289 to 29205. [2019-12-27 02:21:53,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29205 states. [2019-12-27 02:21:53,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29205 states to 29205 states and 114644 transitions. [2019-12-27 02:21:53,244 INFO L78 Accepts]: Start accepts. Automaton has 29205 states and 114644 transitions. Word has length 21 [2019-12-27 02:21:53,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:53,245 INFO L462 AbstractCegarLoop]: Abstraction has 29205 states and 114644 transitions. [2019-12-27 02:21:53,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:21:53,245 INFO L276 IsEmpty]: Start isEmpty. Operand 29205 states and 114644 transitions. [2019-12-27 02:21:53,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 02:21:53,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:53,255 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:21:53,256 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:21:53,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:53,256 INFO L82 PathProgramCache]: Analyzing trace with hash 291958640, now seen corresponding path program 1 times [2019-12-27 02:21:53,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:53,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798364338] [2019-12-27 02:21:53,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:53,325 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:21:53,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798364338] [2019-12-27 02:21:53,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:53,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:21:53,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282865057] [2019-12-27 02:21:53,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:21:53,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:53,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:21:53,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:21:53,328 INFO L87 Difference]: Start difference. First operand 29205 states and 114644 transitions. Second operand 3 states. [2019-12-27 02:21:53,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:53,463 INFO L93 Difference]: Finished difference Result 29205 states and 113300 transitions. [2019-12-27 02:21:53,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:21:53,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-27 02:21:53,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:53,526 INFO L225 Difference]: With dead ends: 29205 [2019-12-27 02:21:53,526 INFO L226 Difference]: Without dead ends: 29205 [2019-12-27 02:21:53,526 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:21:53,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29205 states. [2019-12-27 02:21:54,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29205 to 28805. [2019-12-27 02:21:54,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28805 states. [2019-12-27 02:21:54,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28805 states to 28805 states and 111840 transitions. [2019-12-27 02:21:54,314 INFO L78 Accepts]: Start accepts. Automaton has 28805 states and 111840 transitions. Word has length 22 [2019-12-27 02:21:54,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:54,314 INFO L462 AbstractCegarLoop]: Abstraction has 28805 states and 111840 transitions. [2019-12-27 02:21:54,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:21:54,315 INFO L276 IsEmpty]: Start isEmpty. Operand 28805 states and 111840 transitions. [2019-12-27 02:21:54,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 02:21:54,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:54,326 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:21:54,326 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:21:54,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:54,327 INFO L82 PathProgramCache]: Analyzing trace with hash -9241093, now seen corresponding path program 1 times [2019-12-27 02:21:54,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:54,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502166879] [2019-12-27 02:21:54,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:54,410 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:21:54,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502166879] [2019-12-27 02:21:54,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:54,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:21:54,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128261900] [2019-12-27 02:21:54,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:21:54,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:54,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:21:54,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:21:54,412 INFO L87 Difference]: Start difference. First operand 28805 states and 111840 transitions. Second operand 5 states. [2019-12-27 02:21:54,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:54,534 INFO L93 Difference]: Finished difference Result 12329 states and 39554 transitions. [2019-12-27 02:21:54,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:21:54,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 02:21:54,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:54,560 INFO L225 Difference]: With dead ends: 12329 [2019-12-27 02:21:54,560 INFO L226 Difference]: Without dead ends: 10557 [2019-12-27 02:21:54,561 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:21:54,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10557 states. [2019-12-27 02:21:54,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10557 to 10557. [2019-12-27 02:21:54,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10557 states. [2019-12-27 02:21:54,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10557 states to 10557 states and 32994 transitions. [2019-12-27 02:21:54,792 INFO L78 Accepts]: Start accepts. Automaton has 10557 states and 32994 transitions. Word has length 23 [2019-12-27 02:21:54,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:54,793 INFO L462 AbstractCegarLoop]: Abstraction has 10557 states and 32994 transitions. [2019-12-27 02:21:54,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:21:54,793 INFO L276 IsEmpty]: Start isEmpty. Operand 10557 states and 32994 transitions. [2019-12-27 02:21:54,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 02:21:54,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:54,799 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:21:54,800 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:21:54,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:54,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1862087193, now seen corresponding path program 1 times [2019-12-27 02:21:54,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:54,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300609550] [2019-12-27 02:21:54,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:54,868 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:21:54,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300609550] [2019-12-27 02:21:54,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:54,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:21:54,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479113401] [2019-12-27 02:21:54,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:21:54,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:54,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:21:54,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:21:54,870 INFO L87 Difference]: Start difference. First operand 10557 states and 32994 transitions. Second operand 4 states. [2019-12-27 02:21:54,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:54,941 INFO L93 Difference]: Finished difference Result 15941 states and 50535 transitions. [2019-12-27 02:21:54,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:21:54,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-27 02:21:54,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:54,954 INFO L225 Difference]: With dead ends: 15941 [2019-12-27 02:21:54,954 INFO L226 Difference]: Without dead ends: 8445 [2019-12-27 02:21:54,954 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:21:54,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8445 states. [2019-12-27 02:21:55,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8445 to 8146. [2019-12-27 02:21:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8146 states. [2019-12-27 02:21:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8146 states to 8146 states and 25593 transitions. [2019-12-27 02:21:55,077 INFO L78 Accepts]: Start accepts. Automaton has 8146 states and 25593 transitions. Word has length 24 [2019-12-27 02:21:55,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:55,078 INFO L462 AbstractCegarLoop]: Abstraction has 8146 states and 25593 transitions. [2019-12-27 02:21:55,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:21:55,078 INFO L276 IsEmpty]: Start isEmpty. Operand 8146 states and 25593 transitions. [2019-12-27 02:21:55,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 02:21:55,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:55,081 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:21:55,082 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:21:55,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:55,082 INFO L82 PathProgramCache]: Analyzing trace with hash -417737333, now seen corresponding path program 2 times [2019-12-27 02:21:55,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:55,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081309492] [2019-12-27 02:21:55,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:55,169 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:21:55,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081309492] [2019-12-27 02:21:55,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:55,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:21:55,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339804024] [2019-12-27 02:21:55,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:21:55,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:55,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:21:55,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:21:55,171 INFO L87 Difference]: Start difference. First operand 8146 states and 25593 transitions. Second operand 6 states. [2019-12-27 02:21:55,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:55,277 INFO L93 Difference]: Finished difference Result 3111 states and 8924 transitions. [2019-12-27 02:21:55,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:21:55,278 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 02:21:55,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:55,283 INFO L225 Difference]: With dead ends: 3111 [2019-12-27 02:21:55,283 INFO L226 Difference]: Without dead ends: 2590 [2019-12-27 02:21:55,284 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:21:55,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2590 states. [2019-12-27 02:21:55,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590 to 2590. [2019-12-27 02:21:55,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2590 states. [2019-12-27 02:21:55,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 7335 transitions. [2019-12-27 02:21:55,326 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 7335 transitions. Word has length 24 [2019-12-27 02:21:55,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:55,327 INFO L462 AbstractCegarLoop]: Abstraction has 2590 states and 7335 transitions. [2019-12-27 02:21:55,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:21:55,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 7335 transitions. [2019-12-27 02:21:55,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 02:21:55,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:55,333 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:21:55,333 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:21:55,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:55,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1619810495, now seen corresponding path program 1 times [2019-12-27 02:21:55,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:55,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303676653] [2019-12-27 02:21:55,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:55,518 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:21:55,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303676653] [2019-12-27 02:21:55,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:55,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:21:55,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416839249] [2019-12-27 02:21:55,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:21:55,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:55,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:21:55,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:21:55,521 INFO L87 Difference]: Start difference. First operand 2590 states and 7335 transitions. Second operand 3 states. [2019-12-27 02:21:55,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:55,574 INFO L93 Difference]: Finished difference Result 3908 states and 10998 transitions. [2019-12-27 02:21:55,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:21:55,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-27 02:21:55,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:55,582 INFO L225 Difference]: With dead ends: 3908 [2019-12-27 02:21:55,582 INFO L226 Difference]: Without dead ends: 3908 [2019-12-27 02:21:55,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:21:55,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3908 states. [2019-12-27 02:21:55,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3908 to 3066. [2019-12-27 02:21:55,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3066 states. [2019-12-27 02:21:55,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3066 states to 3066 states and 8797 transitions. [2019-12-27 02:21:55,646 INFO L78 Accepts]: Start accepts. Automaton has 3066 states and 8797 transitions. Word has length 32 [2019-12-27 02:21:55,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:55,647 INFO L462 AbstractCegarLoop]: Abstraction has 3066 states and 8797 transitions. [2019-12-27 02:21:55,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:21:55,647 INFO L276 IsEmpty]: Start isEmpty. Operand 3066 states and 8797 transitions. [2019-12-27 02:21:55,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 02:21:55,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:55,652 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:21:55,652 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:21:55,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:55,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1082300219, now seen corresponding path program 1 times [2019-12-27 02:21:55,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:55,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842945975] [2019-12-27 02:21:55,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:55,816 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:21:55,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842945975] [2019-12-27 02:21:55,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:55,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:21:55,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268020066] [2019-12-27 02:21:55,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:21:55,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:55,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:21:55,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:21:55,819 INFO L87 Difference]: Start difference. First operand 3066 states and 8797 transitions. Second operand 6 states. [2019-12-27 02:21:56,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:56,292 INFO L93 Difference]: Finished difference Result 6462 states and 17612 transitions. [2019-12-27 02:21:56,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:21:56,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-27 02:21:56,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:56,302 INFO L225 Difference]: With dead ends: 6462 [2019-12-27 02:21:56,303 INFO L226 Difference]: Without dead ends: 6324 [2019-12-27 02:21:56,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:21:56,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6324 states. [2019-12-27 02:21:56,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6324 to 3196. [2019-12-27 02:21:56,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3196 states. [2019-12-27 02:21:56,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3196 states to 3196 states and 9125 transitions. [2019-12-27 02:21:56,356 INFO L78 Accepts]: Start accepts. Automaton has 3196 states and 9125 transitions. Word has length 32 [2019-12-27 02:21:56,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:56,356 INFO L462 AbstractCegarLoop]: Abstraction has 3196 states and 9125 transitions. [2019-12-27 02:21:56,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:21:56,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3196 states and 9125 transitions. [2019-12-27 02:21:56,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 02:21:56,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:56,362 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:21:56,362 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:21:56,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:56,362 INFO L82 PathProgramCache]: Analyzing trace with hash -345264620, now seen corresponding path program 1 times [2019-12-27 02:21:56,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:56,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523425282] [2019-12-27 02:21:56,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:56,453 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:21:56,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523425282] [2019-12-27 02:21:56,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:56,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:21:56,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981695081] [2019-12-27 02:21:56,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:21:56,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:56,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:21:56,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:21:56,456 INFO L87 Difference]: Start difference. First operand 3196 states and 9125 transitions. Second operand 6 states. [2019-12-27 02:21:56,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:56,904 INFO L93 Difference]: Finished difference Result 6123 states and 16579 transitions. [2019-12-27 02:21:56,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:21:56,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 02:21:56,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:56,916 INFO L225 Difference]: With dead ends: 6123 [2019-12-27 02:21:56,916 INFO L226 Difference]: Without dead ends: 5979 [2019-12-27 02:21:56,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:21:56,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5979 states. [2019-12-27 02:21:56,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5979 to 3000. [2019-12-27 02:21:56,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3000 states. [2019-12-27 02:21:56,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3000 states to 3000 states and 8617 transitions. [2019-12-27 02:21:56,970 INFO L78 Accepts]: Start accepts. Automaton has 3000 states and 8617 transitions. Word has length 33 [2019-12-27 02:21:56,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:56,970 INFO L462 AbstractCegarLoop]: Abstraction has 3000 states and 8617 transitions. [2019-12-27 02:21:56,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:21:56,970 INFO L276 IsEmpty]: Start isEmpty. Operand 3000 states and 8617 transitions. [2019-12-27 02:21:56,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 02:21:56,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:56,974 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:21:56,974 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:21:56,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:56,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1231616427, now seen corresponding path program 1 times [2019-12-27 02:21:56,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:56,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148817824] [2019-12-27 02:21:56,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:57,113 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:21:57,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148817824] [2019-12-27 02:21:57,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:57,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:21:57,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707015149] [2019-12-27 02:21:57,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:21:57,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:57,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:21:57,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:21:57,116 INFO L87 Difference]: Start difference. First operand 3000 states and 8617 transitions. Second operand 7 states. [2019-12-27 02:21:57,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:57,297 INFO L93 Difference]: Finished difference Result 2263 states and 6813 transitions. [2019-12-27 02:21:57,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:21:57,298 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 02:21:57,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:57,301 INFO L225 Difference]: With dead ends: 2263 [2019-12-27 02:21:57,301 INFO L226 Difference]: Without dead ends: 1607 [2019-12-27 02:21:57,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:21:57,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2019-12-27 02:21:57,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1553. [2019-12-27 02:21:57,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1553 states. [2019-12-27 02:21:57,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 4536 transitions. [2019-12-27 02:21:57,320 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 4536 transitions. Word has length 33 [2019-12-27 02:21:57,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:57,320 INFO L462 AbstractCegarLoop]: Abstraction has 1553 states and 4536 transitions. [2019-12-27 02:21:57,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:21:57,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 4536 transitions. [2019-12-27 02:21:57,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 02:21:57,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:57,323 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:21:57,323 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:21:57,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:57,323 INFO L82 PathProgramCache]: Analyzing trace with hash -978641481, now seen corresponding path program 1 times [2019-12-27 02:21:57,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:57,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414561510] [2019-12-27 02:21:57,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:57,385 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:21:57,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414561510] [2019-12-27 02:21:57,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:57,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:21:57,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523793769] [2019-12-27 02:21:57,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:21:57,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:57,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:21:57,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:21:57,387 INFO L87 Difference]: Start difference. First operand 1553 states and 4536 transitions. Second operand 6 states. [2019-12-27 02:21:57,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:57,575 INFO L93 Difference]: Finished difference Result 4702 states and 13602 transitions. [2019-12-27 02:21:57,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:21:57,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-12-27 02:21:57,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:57,581 INFO L225 Difference]: With dead ends: 4702 [2019-12-27 02:21:57,581 INFO L226 Difference]: Without dead ends: 3062 [2019-12-27 02:21:57,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:21:57,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2019-12-27 02:21:57,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 1755. [2019-12-27 02:21:57,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1755 states. [2019-12-27 02:21:57,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 5105 transitions. [2019-12-27 02:21:57,618 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 5105 transitions. Word has length 48 [2019-12-27 02:21:57,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:57,619 INFO L462 AbstractCegarLoop]: Abstraction has 1755 states and 5105 transitions. [2019-12-27 02:21:57,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:21:57,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 5105 transitions. [2019-12-27 02:21:57,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 02:21:57,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:57,623 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:21:57,623 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:21:57,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:57,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1923718495, now seen corresponding path program 2 times [2019-12-27 02:21:57,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:57,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405136785] [2019-12-27 02:21:57,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:57,676 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:21:57,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405136785] [2019-12-27 02:21:57,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:57,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:21:57,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419997930] [2019-12-27 02:21:57,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:21:57,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:57,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:21:57,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:21:57,678 INFO L87 Difference]: Start difference. First operand 1755 states and 5105 transitions. Second operand 4 states. [2019-12-27 02:21:57,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:57,699 INFO L93 Difference]: Finished difference Result 2211 states and 6131 transitions. [2019-12-27 02:21:57,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:21:57,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-27 02:21:57,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:57,700 INFO L225 Difference]: With dead ends: 2211 [2019-12-27 02:21:57,700 INFO L226 Difference]: Without dead ends: 504 [2019-12-27 02:21:57,701 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:21:57,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-12-27 02:21:57,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-12-27 02:21:57,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-12-27 02:21:57,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1111 transitions. [2019-12-27 02:21:57,708 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1111 transitions. Word has length 48 [2019-12-27 02:21:57,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:57,708 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 1111 transitions. [2019-12-27 02:21:57,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:21:57,708 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1111 transitions. [2019-12-27 02:21:57,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 02:21:57,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:57,709 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:21:57,709 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:21:57,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:57,710 INFO L82 PathProgramCache]: Analyzing trace with hash -126758993, now seen corresponding path program 3 times [2019-12-27 02:21:57,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:57,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86346028] [2019-12-27 02:21:57,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:57,789 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:21:57,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86346028] [2019-12-27 02:21:57,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:57,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:21:57,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494099335] [2019-12-27 02:21:57,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:21:57,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:57,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:21:57,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:21:57,791 INFO L87 Difference]: Start difference. First operand 504 states and 1111 transitions. Second operand 7 states. [2019-12-27 02:21:57,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:57,925 INFO L93 Difference]: Finished difference Result 892 states and 1938 transitions. [2019-12-27 02:21:57,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:21:57,925 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-27 02:21:57,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:57,926 INFO L225 Difference]: With dead ends: 892 [2019-12-27 02:21:57,926 INFO L226 Difference]: Without dead ends: 594 [2019-12-27 02:21:57,927 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:21:57,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-12-27 02:21:57,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 536. [2019-12-27 02:21:57,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-27 02:21:57,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1171 transitions. [2019-12-27 02:21:57,935 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1171 transitions. Word has length 48 [2019-12-27 02:21:57,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:57,936 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1171 transitions. [2019-12-27 02:21:57,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:21:57,937 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1171 transitions. [2019-12-27 02:21:57,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 02:21:57,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:57,938 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:21:57,938 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:21:57,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:57,938 INFO L82 PathProgramCache]: Analyzing trace with hash 24927743, now seen corresponding path program 4 times [2019-12-27 02:21:57,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:57,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559782346] [2019-12-27 02:21:57,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:21:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:21:58,058 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:21:58,058 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:21:58,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_107| 0 0))) (and (= v_~x~0_71 0) (= 0 v_~weak$$choice0~0_10) (= v_~z$w_buff0_used~0_514 0) (= 0 v_~z$r_buff1_thd3~0_207) (= v_~main$tmp_guard0~0_30 0) (= v_~main$tmp_guard1~0_44 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= 0 v_~z$flush_delayed~0_37) (= v_~z$mem_tmp~0_16 0) (= |v_ULTIMATE.start_main_~#t973~0.offset_37| 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (= v_~y~0_19 0) (= v_~z$w_buff0~0_183 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t973~0.base_59|) (= 0 v_~z$r_buff1_thd1~0_59) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t973~0.base_59| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t973~0.base_59|) |v_ULTIMATE.start_main_~#t973~0.offset_37| 0)) |v_#memory_int_27|) (= 0 v_~z$r_buff0_thd4~0_166) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t973~0.base_59|)) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p3_EAX~0_87) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (= v_~z$r_buff0_thd2~0_57 0) (= |v_#valid_105| (store .cse0 |v_ULTIMATE.start_main_~#t973~0.base_59| 1)) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd0~0_132 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_116 0) (= 0 v_~__unbuffered_p2_EAX~0_54) (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~z$r_buff0_thd3~0_266) (= 0 v_~__unbuffered_p3_EBX~0_88) (= 0 v_~weak$$choice2~0_95) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t973~0.base_59| 4) |v_#length_31|) (= v_~z$w_buff1_used~0_298 0) (= 0 |v_#NULL.base_5|) (= v_~z$w_buff1~0_123 0) (= v_~b~0_79 0) (= v_~__unbuffered_cnt~0_126 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_107|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t974~0.base=|v_ULTIMATE.start_main_~#t974~0.base_56|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ULTIMATE.start_main_~#t974~0.offset=|v_ULTIMATE.start_main_~#t974~0.offset_35|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_87, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_81|, ULTIMATE.start_main_~#t976~0.offset=|v_ULTIMATE.start_main_~#t976~0.offset_22|, ~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_37, ~weak$$choice0~0=v_~weak$$choice0~0_10, #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_71, ~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|, ULTIMATE.start_main_~#t975~0.offset=|v_ULTIMATE.start_main_~#t975~0.offset_23|, ULTIMATE.start_main_~#t973~0.base=|v_ULTIMATE.start_main_~#t973~0.base_59|, ~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_44, ~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_132, ULTIMATE.start_main_~#t976~0.base=|v_ULTIMATE.start_main_~#t976~0.base_32|, ~y~0=v_~y~0_19, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ULTIMATE.start_main_~#t973~0.offset=|v_ULTIMATE.start_main_~#t973~0.offset_37|, ULTIMATE.start_main_~#t975~0.base=|v_ULTIMATE.start_main_~#t975~0.base_32|, ~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_207, 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_88, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_91|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_38|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_116, ~weak$$choice2~0=v_~weak$$choice2~0_95, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t974~0.base, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t974~0.offset, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t976~0.offset, ~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, ULTIMATE.start_main_~#t975~0.offset, ULTIMATE.start_main_~#t973~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t976~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t973~0.offset, ULTIMATE.start_main_~#t975~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:21:58,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t974~0.base_11|) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t974~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t974~0.base_11| 0)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t974~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t974~0.offset_10|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t974~0.base_11| 4)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t974~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t974~0.base_11|) |v_ULTIMATE.start_main_~#t974~0.offset_10| 1)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t974~0.offset=|v_ULTIMATE.start_main_~#t974~0.offset_10|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|, ULTIMATE.start_main_~#t974~0.base=|v_ULTIMATE.start_main_~#t974~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t974~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t974~0.base] because there is no mapped edge [2019-12-27 02:21:58,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t975~0.base_12| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t975~0.base_12|)) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t975~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t975~0.offset_11|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t975~0.base_12| 1)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t975~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t975~0.base_12|) |v_ULTIMATE.start_main_~#t975~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t975~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t975~0.base=|v_ULTIMATE.start_main_~#t975~0.base_12|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t975~0.offset=|v_ULTIMATE.start_main_~#t975~0.offset_11|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t975~0.base, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t975~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 02:21:58,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t976~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t976~0.base_12|) |v_ULTIMATE.start_main_~#t976~0.offset_10| 3)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t976~0.base_12| 0)) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t976~0.base_12| 1)) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t976~0.base_12|)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t976~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t976~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t976~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|, ULTIMATE.start_main_~#t976~0.offset=|v_ULTIMATE.start_main_~#t976~0.offset_10|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t976~0.base=|v_ULTIMATE.start_main_~#t976~0.base_12|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t976~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t976~0.base, #length] because there is no mapped edge [2019-12-27 02:21:58,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= 1 ~a~0_Out417698938) (= ~__unbuffered_p3_EBX~0_Out417698938 ~b~0_In417698938) (= ~__unbuffered_p3_EAX~0_Out417698938 ~a~0_Out417698938) (= ~z$r_buff0_thd1~0_In417698938 ~z$r_buff1_thd1~0_Out417698938) (= ~z$r_buff0_thd3~0_In417698938 ~z$r_buff1_thd3~0_Out417698938) (= ~z$r_buff1_thd0~0_Out417698938 ~z$r_buff0_thd0~0_In417698938) (= ~z$r_buff0_thd4~0_Out417698938 1) (= ~z$r_buff1_thd2~0_Out417698938 ~z$r_buff0_thd2~0_In417698938) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In417698938)) (= ~z$r_buff1_thd4~0_Out417698938 ~z$r_buff0_thd4~0_In417698938)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In417698938, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In417698938, ~b~0=~b~0_In417698938, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In417698938, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In417698938, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In417698938, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In417698938} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In417698938, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out417698938, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out417698938, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out417698938, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out417698938, ~a~0=~a~0_Out417698938, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In417698938, ~b~0=~b~0_In417698938, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out417698938, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out417698938, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out417698938, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out417698938, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In417698938, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In417698938, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In417698938} 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:21:58,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_~x~0_36 1) (= 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|} OutVars{~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_36} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-27 02:21:58,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_7|) (= v_~y~0_15 v_~__unbuffered_p1_EAX~0_14) (= v_P1Thread1of1ForFork0_~arg.base_11 |v_P1Thread1of1ForFork0_#in~arg.base_11|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x~0_23 2) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_11) (= 0 |v_P1Thread1of1ForFork0_#res.offset_7|)) 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, ~y~0=v_~y~0_15} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, 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_15, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-27 02:21:58,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-269624722 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite8_In-269624722| |P2Thread1of1ForFork1_#t~ite8_Out-269624722|) (= ~z$w_buff0~0_In-269624722 |P2Thread1of1ForFork1_#t~ite9_Out-269624722|)) (and (= |P2Thread1of1ForFork1_#t~ite8_Out-269624722| |P2Thread1of1ForFork1_#t~ite9_Out-269624722|) (= |P2Thread1of1ForFork1_#t~ite8_Out-269624722| ~z$w_buff0~0_In-269624722) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-269624722 256)))) (or (and (= (mod ~z$r_buff1_thd3~0_In-269624722 256) 0) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In-269624722 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-269624722 256))))))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-269624722, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-269624722, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-269624722, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-269624722, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-269624722, ~weak$$choice2~0=~weak$$choice2~0_In-269624722, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In-269624722|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-269624722, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-269624722, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-269624722, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-269624722, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-269624722, ~weak$$choice2~0=~weak$$choice2~0_In-269624722, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out-269624722|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out-269624722|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 02:21:58,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In745011690 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite12_Out745011690| |P2Thread1of1ForFork1_#t~ite11_Out745011690|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In745011690 256) 0))) (or (= (mod ~z$w_buff0_used~0_In745011690 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In745011690 256)) .cse1) (and (= (mod ~z$r_buff1_thd3~0_In745011690 256) 0) .cse1))) (= ~z$w_buff1~0_In745011690 |P2Thread1of1ForFork1_#t~ite11_Out745011690|)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite11_In745011690| |P2Thread1of1ForFork1_#t~ite11_Out745011690|) (= |P2Thread1of1ForFork1_#t~ite12_Out745011690| ~z$w_buff1~0_In745011690)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In745011690, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In745011690, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In745011690|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In745011690, ~z$w_buff1~0=~z$w_buff1~0_In745011690, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In745011690, ~weak$$choice2~0=~weak$$choice2~0_In745011690} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In745011690, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out745011690|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In745011690, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out745011690|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In745011690, ~z$w_buff1~0=~z$w_buff1~0_In745011690, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In745011690, ~weak$$choice2~0=~weak$$choice2~0_In745011690} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 02:21:58,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1217169614 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite15_Out-1217169614| ~z$w_buff0_used~0_In-1217169614) (= |P2Thread1of1ForFork1_#t~ite14_In-1217169614| |P2Thread1of1ForFork1_#t~ite14_Out-1217169614|) (not .cse0)) (and (= |P2Thread1of1ForFork1_#t~ite15_Out-1217169614| |P2Thread1of1ForFork1_#t~ite14_Out-1217169614|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1217169614 256) 0))) (or (and (= (mod ~z$r_buff1_thd3~0_In-1217169614 256) 0) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In-1217169614 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-1217169614 256)))) (= |P2Thread1of1ForFork1_#t~ite14_Out-1217169614| ~z$w_buff0_used~0_In-1217169614)))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In-1217169614|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1217169614, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1217169614, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1217169614, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1217169614, ~weak$$choice2~0=~weak$$choice2~0_In-1217169614} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out-1217169614|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out-1217169614|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1217169614, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1217169614, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1217169614, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1217169614, ~weak$$choice2~0=~weak$$choice2~0_In-1217169614} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-27 02:21:58,079 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:21:58,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-219617483 256)))) (or (and .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-219617483 256) 0))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In-219617483 256)) .cse1) (= (mod ~z$w_buff0_used~0_In-219617483 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In-219617483 256)) .cse1))) (= ~z$r_buff1_thd3~0_In-219617483 |P2Thread1of1ForFork1_#t~ite23_Out-219617483|) (= |P2Thread1of1ForFork1_#t~ite24_Out-219617483| |P2Thread1of1ForFork1_#t~ite23_Out-219617483|)) (and (= |P2Thread1of1ForFork1_#t~ite23_In-219617483| |P2Thread1of1ForFork1_#t~ite23_Out-219617483|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite24_Out-219617483| ~z$r_buff1_thd3~0_In-219617483)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-219617483, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-219617483, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In-219617483|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-219617483, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-219617483, ~weak$$choice2~0=~weak$$choice2~0_In-219617483} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out-219617483|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-219617483, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-219617483, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out-219617483|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-219617483, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-219617483, ~weak$$choice2~0=~weak$$choice2~0_In-219617483} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-27 02:21:58,081 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:21:58,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1896915338 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1896915338 256) 0))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out-1896915338| 0)) (and (= |P3Thread1of1ForFork2_#t~ite28_Out-1896915338| ~z$w_buff0_used~0_In-1896915338) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1896915338, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1896915338} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1896915338|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1896915338, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1896915338} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 02:21:58,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In-2128192340 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-2128192340 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2128192340 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-2128192340 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-2128192340 |P3Thread1of1ForFork2_#t~ite29_Out-2128192340|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite29_Out-2128192340|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2128192340, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2128192340, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2128192340, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2128192340} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-2128192340|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2128192340, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2128192340, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2128192340, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2128192340} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 02:21:58,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In1704822040 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1704822040 256) 0))) (or (and (= ~z$r_buff0_thd4~0_Out1704822040 ~z$r_buff0_thd4~0_In1704822040) (or .cse0 .cse1)) (and (= 0 ~z$r_buff0_thd4~0_Out1704822040) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1704822040, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1704822040} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1704822040, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1704822040, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out1704822040|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-27 02:21:58,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In532062056 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd4~0_In532062056 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In532062056 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In532062056 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite31_Out532062056| ~z$r_buff1_thd4~0_In532062056) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P3Thread1of1ForFork2_#t~ite31_Out532062056| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In532062056, ~z$w_buff0_used~0=~z$w_buff0_used~0_In532062056, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In532062056, ~z$w_buff1_used~0=~z$w_buff1_used~0_In532062056} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In532062056, ~z$w_buff0_used~0=~z$w_buff0_used~0_In532062056, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In532062056, ~z$w_buff1_used~0=~z$w_buff1_used~0_In532062056, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out532062056|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 02:21:58,085 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:21:58,087 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:21:58,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite37_Out-1535573481| |ULTIMATE.start_main_#t~ite36_Out-1535573481|)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1535573481 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1535573481 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~z~0_In-1535573481 |ULTIMATE.start_main_#t~ite36_Out-1535573481|)) (and .cse0 (not .cse1) (= ~z$w_buff1~0_In-1535573481 |ULTIMATE.start_main_#t~ite36_Out-1535573481|) (not .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1535573481, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1535573481, ~z$w_buff1~0=~z$w_buff1~0_In-1535573481, ~z~0=~z~0_In-1535573481} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1535573481, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1535573481, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1535573481|, ~z$w_buff1~0=~z$w_buff1~0_In-1535573481, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1535573481|, ~z~0=~z~0_In-1535573481} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 02:21:58,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In275593152 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In275593152 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out275593152| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In275593152 |ULTIMATE.start_main_#t~ite38_Out275593152|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In275593152, ~z$w_buff0_used~0=~z$w_buff0_used~0_In275593152} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In275593152, ~z$w_buff0_used~0=~z$w_buff0_used~0_In275593152, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out275593152|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 02:21:58,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In957112704 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In957112704 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In957112704 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In957112704 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite39_Out957112704|)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In957112704 |ULTIMATE.start_main_#t~ite39_Out957112704|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In957112704, ~z$w_buff0_used~0=~z$w_buff0_used~0_In957112704, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In957112704, ~z$w_buff1_used~0=~z$w_buff1_used~0_In957112704} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In957112704, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out957112704|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In957112704, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In957112704, ~z$w_buff1_used~0=~z$w_buff1_used~0_In957112704} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 02:21:58,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In612247587 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In612247587 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In612247587 |ULTIMATE.start_main_#t~ite40_Out612247587|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite40_Out612247587|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In612247587, ~z$w_buff0_used~0=~z$w_buff0_used~0_In612247587} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In612247587, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out612247587|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In612247587} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 02:21:58,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1953267218 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1953267218 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1953267218 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1953267218 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out-1953267218| ~z$r_buff1_thd0~0_In-1953267218) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite41_Out-1953267218| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1953267218, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1953267218, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1953267218, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1953267218} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1953267218|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1953267218, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1953267218, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1953267218, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1953267218} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 02:21:58,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= |v_ULTIMATE.start_main_#t~ite41_31| v_~z$r_buff1_thd0~0_73) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_13 0) (= v_~x~0_41 2) (= 0 v_~__unbuffered_p2_EAX~0_17)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~x~0=v_~x~0_41} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~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_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~x~0=v_~x~0_41, 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:21:58,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:21:58 BasicIcfg [2019-12-27 02:21:58,199 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:21:58,202 INFO L168 Benchmark]: Toolchain (without parser) took 29911.95 ms. Allocated memory was 138.4 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 101.4 MB in the beginning and 574.6 MB in the end (delta: -473.2 MB). Peak memory consumption was 906.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:21:58,203 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 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:21:58,203 INFO L168 Benchmark]: CACSL2BoogieTranslator took 777.45 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.0 MB in the beginning and 155.0 MB in the end (delta: -54.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:21:58,204 INFO L168 Benchmark]: Boogie Procedure Inliner took 110.38 ms. Allocated memory is still 202.9 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:21:58,204 INFO L168 Benchmark]: Boogie Preprocessor took 52.66 ms. Allocated memory is still 202.9 MB. Free memory was 152.3 MB in the beginning and 149.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:21:58,206 INFO L168 Benchmark]: RCFGBuilder took 798.21 ms. Allocated memory is still 202.9 MB. Free memory was 149.6 MB in the beginning and 103.4 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. [2019-12-27 02:21:58,207 INFO L168 Benchmark]: TraceAbstraction took 28167.72 ms. Allocated memory was 202.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 102.7 MB in the beginning and 574.6 MB in the end (delta: -471.9 MB). Peak memory consumption was 843.5 MB. Max. memory is 7.1 GB. [2019-12-27 02:21:58,212 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.21 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 777.45 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.0 MB in the beginning and 155.0 MB in the end (delta: -54.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 110.38 ms. Allocated memory is still 202.9 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.66 ms. Allocated memory is still 202.9 MB. Free memory was 152.3 MB in the beginning and 149.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 798.21 ms. Allocated memory is still 202.9 MB. Free memory was 149.6 MB in the beginning and 103.4 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28167.72 ms. Allocated memory was 202.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 102.7 MB in the beginning and 574.6 MB in the end (delta: -471.9 MB). Peak memory consumption was 843.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 170 ProgramPointsBefore, 74 ProgramPointsAfterwards, 192 TransitionsBefore, 78 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 23 ChoiceCompositions, 5751 VarBasedMoverChecksPositive, 155 VarBasedMoverChecksNegative, 25 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(&t973, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t974, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t975, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t976, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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 = 1 [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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1_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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [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: 27.8s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1949 SDtfs, 2797 SDslu, 3296 SDs, 0 SdLazy, 1115 SolverSat, 177 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30378occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 17319 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 519 NumberOfCodeBlocks, 519 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 454 ConstructedInterpolants, 0 QuantifiedInterpolants, 38568 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...