/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:05:47,955 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:05:47,958 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:05:47,977 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:05:47,977 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:05:47,979 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:05:47,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:05:47,994 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:05:47,998 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:05:47,998 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:05:47,999 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:05:48,001 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:05:48,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:05:48,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:05:48,006 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:05:48,007 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:05:48,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:05:48,011 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:05:48,015 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:05:48,018 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:05:48,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:05:48,024 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:05:48,025 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:05:48,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:05:48,030 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:05:48,030 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:05:48,030 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:05:48,032 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:05:48,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:05:48,035 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:05:48,035 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:05:48,035 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:05:48,036 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:05:48,037 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:05:48,038 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:05:48,038 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:05:48,039 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:05:48,039 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:05:48,039 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:05:48,040 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:05:48,041 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:05:48,041 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:05:48,055 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:05:48,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:05:48,056 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:05:48,056 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:05:48,056 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:05:48,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:05:48,057 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:05:48,057 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:05:48,057 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:05:48,057 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:05:48,058 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:05:48,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:05:48,058 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:05:48,058 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:05:48,058 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:05:48,059 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:05:48,059 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:05:48,059 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:05:48,059 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:05:48,059 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:05:48,060 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:05:48,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:05:48,060 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:05:48,060 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:05:48,060 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:05:48,061 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:05:48,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:05:48,061 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:05:48,061 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:05:48,061 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:05:48,339 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:05:48,358 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:05:48,361 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:05:48,363 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:05:48,363 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:05:48,364 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_rmo.opt.i [2019-12-26 23:05:48,434 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4a04cdbb/d08481abf2354274900711ebe222857c/FLAG96e97c03e [2019-12-26 23:05:48,976 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:05:48,977 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_rmo.opt.i [2019-12-26 23:05:48,996 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4a04cdbb/d08481abf2354274900711ebe222857c/FLAG96e97c03e [2019-12-26 23:05:49,261 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4a04cdbb/d08481abf2354274900711ebe222857c [2019-12-26 23:05:49,270 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:05:49,272 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:05:49,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:05:49,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:05:49,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:05:49,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:05:49" (1/1) ... [2019-12-26 23:05:49,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23a66491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:49, skipping insertion in model container [2019-12-26 23:05:49,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:05:49" (1/1) ... [2019-12-26 23:05:49,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:05:49,358 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:05:49,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:05:49,886 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:05:49,950 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:05:50,024 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:05:50,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:50 WrapperNode [2019-12-26 23:05:50,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:05:50,026 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:05:50,026 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:05:50,026 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:05:50,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:50" (1/1) ... [2019-12-26 23:05:50,058 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:50" (1/1) ... [2019-12-26 23:05:50,100 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:05:50,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:05:50,101 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:05:50,101 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:05:50,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:50" (1/1) ... [2019-12-26 23:05:50,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:50" (1/1) ... [2019-12-26 23:05:50,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:50" (1/1) ... [2019-12-26 23:05:50,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:50" (1/1) ... [2019-12-26 23:05:50,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:50" (1/1) ... [2019-12-26 23:05:50,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:50" (1/1) ... [2019-12-26 23:05:50,134 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:50" (1/1) ... [2019-12-26 23:05:50,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:05:50,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:05:50,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:05:50,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:05:50,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:05:50,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:05:50,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:05:50,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:05:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:05:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:05:50,218 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:05:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:05:50,219 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:05:50,220 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:05:50,220 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:05:50,221 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-26 23:05:50,221 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-26 23:05:50,221 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:05:50,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:05:50,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:05:50,224 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:05:50,986 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:05:50,987 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:05:50,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:05:50 BoogieIcfgContainer [2019-12-26 23:05:50,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:05:50,990 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:05:50,990 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:05:50,993 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:05:50,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:05:49" (1/3) ... [2019-12-26 23:05:50,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e3bd0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:05:50, skipping insertion in model container [2019-12-26 23:05:50,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:50" (2/3) ... [2019-12-26 23:05:50,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e3bd0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:05:50, skipping insertion in model container [2019-12-26 23:05:50,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:05:50" (3/3) ... [2019-12-26 23:05:50,999 INFO L109 eAbstractionObserver]: Analyzing ICFG mix057_rmo.opt.i [2019-12-26 23:05:51,010 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:05:51,010 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:05:51,020 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:05:51,021 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:05:51,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,066 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,066 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,068 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,068 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,070 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,070 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,078 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,078 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,078 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,078 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,079 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,079 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,079 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,079 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,080 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,080 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,080 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,081 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,081 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,081 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,081 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,082 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,082 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,082 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,082 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,083 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,083 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,083 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,084 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,084 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,084 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,103 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,103 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,103 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,108 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,108 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,113 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,113 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,116 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,116 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,116 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,116 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,116 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,117 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,117 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,117 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,117 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,117 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,118 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,118 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,120 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,121 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:51,135 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-26 23:05:51,151 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:05:51,152 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:05:51,152 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:05:51,152 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:05:51,152 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:05:51,152 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:05:51,152 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:05:51,152 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:05:51,170 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 206 transitions [2019-12-26 23:05:51,172 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 206 transitions [2019-12-26 23:05:51,274 INFO L132 PetriNetUnfolder]: 41/202 cut-off events. [2019-12-26 23:05:51,274 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:05:51,288 INFO L76 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 202 events. 41/202 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 275 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 23:05:51,309 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 206 transitions [2019-12-26 23:05:51,362 INFO L132 PetriNetUnfolder]: 41/202 cut-off events. [2019-12-26 23:05:51,362 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:05:51,368 INFO L76 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 202 events. 41/202 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 275 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 23:05:51,383 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-26 23:05:51,385 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:05:56,200 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-26 23:05:56,303 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-26 23:05:56,579 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-26 23:05:56,718 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-26 23:05:56,743 INFO L206 etLargeBlockEncoding]: Checked pairs total: 56276 [2019-12-26 23:05:56,743 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-26 23:05:56,747 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 100 transitions [2019-12-26 23:05:58,825 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32878 states. [2019-12-26 23:05:58,826 INFO L276 IsEmpty]: Start isEmpty. Operand 32878 states. [2019-12-26 23:05:58,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-26 23:05:58,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:58,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:05:58,833 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-26 23:05:58,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:58,838 INFO L82 PathProgramCache]: Analyzing trace with hash -667351009, now seen corresponding path program 1 times [2019-12-26 23:05:58,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:58,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852946780] [2019-12-26 23:05:58,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:59,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:59,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852946780] [2019-12-26 23:05:59,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:59,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:05:59,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771723201] [2019-12-26 23:05:59,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:05:59,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:59,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:05:59,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:05:59,752 INFO L87 Difference]: Start difference. First operand 32878 states. Second operand 3 states. [2019-12-26 23:06:00,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:00,491 INFO L93 Difference]: Finished difference Result 32686 states and 139960 transitions. [2019-12-26 23:06:00,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:06:00,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-26 23:06:00,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:00,862 INFO L225 Difference]: With dead ends: 32686 [2019-12-26 23:06:00,862 INFO L226 Difference]: Without dead ends: 32062 [2019-12-26 23:06:00,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:06:01,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32062 states. [2019-12-26 23:06:02,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32062 to 32062. [2019-12-26 23:06:02,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32062 states. [2019-12-26 23:06:02,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32062 states to 32062 states and 137412 transitions. [2019-12-26 23:06:02,710 INFO L78 Accepts]: Start accepts. Automaton has 32062 states and 137412 transitions. Word has length 9 [2019-12-26 23:06:02,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:02,711 INFO L462 AbstractCegarLoop]: Abstraction has 32062 states and 137412 transitions. [2019-12-26 23:06:02,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:06:02,712 INFO L276 IsEmpty]: Start isEmpty. Operand 32062 states and 137412 transitions. [2019-12-26 23:06:02,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 23:06:02,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:02,727 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:06:02,728 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-26 23:06:02,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:02,728 INFO L82 PathProgramCache]: Analyzing trace with hash -139405083, now seen corresponding path program 1 times [2019-12-26 23:06:02,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:02,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799234164] [2019-12-26 23:06:02,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:02,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:06:02,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799234164] [2019-12-26 23:06:02,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:02,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:06:02,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986397269] [2019-12-26 23:06:02,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:06:02,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:02,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:06:02,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:06:02,900 INFO L87 Difference]: Start difference. First operand 32062 states and 137412 transitions. Second operand 4 states. [2019-12-26 23:06:05,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:05,110 INFO L93 Difference]: Finished difference Result 51166 states and 211740 transitions. [2019-12-26 23:06:05,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:06:05,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-26 23:06:05,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:05,405 INFO L225 Difference]: With dead ends: 51166 [2019-12-26 23:06:05,405 INFO L226 Difference]: Without dead ends: 51138 [2019-12-26 23:06:05,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:06:05,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51138 states. [2019-12-26 23:06:07,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51138 to 46670. [2019-12-26 23:06:07,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46670 states. [2019-12-26 23:06:07,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46670 states to 46670 states and 195108 transitions. [2019-12-26 23:06:07,505 INFO L78 Accepts]: Start accepts. Automaton has 46670 states and 195108 transitions. Word has length 15 [2019-12-26 23:06:07,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:07,506 INFO L462 AbstractCegarLoop]: Abstraction has 46670 states and 195108 transitions. [2019-12-26 23:06:07,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:06:07,506 INFO L276 IsEmpty]: Start isEmpty. Operand 46670 states and 195108 transitions. [2019-12-26 23:06:07,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 23:06:07,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:07,509 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:06:07,510 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-26 23:06:07,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:07,510 INFO L82 PathProgramCache]: Analyzing trace with hash 2113277815, now seen corresponding path program 1 times [2019-12-26 23:06:07,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:07,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006466711] [2019-12-26 23:06:07,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:07,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:06:07,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006466711] [2019-12-26 23:06:07,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:07,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:06:07,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145307905] [2019-12-26 23:06:07,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:06:07,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:07,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:06:07,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:06:07,574 INFO L87 Difference]: Start difference. First operand 46670 states and 195108 transitions. Second operand 3 states. [2019-12-26 23:06:07,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:07,743 INFO L93 Difference]: Finished difference Result 36669 states and 141744 transitions. [2019-12-26 23:06:07,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:06:07,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-26 23:06:07,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:07,861 INFO L225 Difference]: With dead ends: 36669 [2019-12-26 23:06:07,861 INFO L226 Difference]: Without dead ends: 36669 [2019-12-26 23:06:07,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:06:10,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36669 states. [2019-12-26 23:06:10,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36669 to 36669. [2019-12-26 23:06:10,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36669 states. [2019-12-26 23:06:11,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36669 states to 36669 states and 141744 transitions. [2019-12-26 23:06:11,017 INFO L78 Accepts]: Start accepts. Automaton has 36669 states and 141744 transitions. Word has length 15 [2019-12-26 23:06:11,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:11,018 INFO L462 AbstractCegarLoop]: Abstraction has 36669 states and 141744 transitions. [2019-12-26 23:06:11,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:06:11,018 INFO L276 IsEmpty]: Start isEmpty. Operand 36669 states and 141744 transitions. [2019-12-26 23:06:11,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 23:06:11,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:11,022 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:06:11,022 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-26 23:06:11,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:11,022 INFO L82 PathProgramCache]: Analyzing trace with hash -456655226, now seen corresponding path program 1 times [2019-12-26 23:06:11,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:11,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243291147] [2019-12-26 23:06:11,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:11,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:06:11,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243291147] [2019-12-26 23:06:11,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:11,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:06:11,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754816236] [2019-12-26 23:06:11,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:06:11,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:11,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:06:11,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:06:11,085 INFO L87 Difference]: Start difference. First operand 36669 states and 141744 transitions. Second operand 4 states. [2019-12-26 23:06:11,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:11,166 INFO L93 Difference]: Finished difference Result 15339 states and 49236 transitions. [2019-12-26 23:06:11,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:06:11,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 23:06:11,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:11,196 INFO L225 Difference]: With dead ends: 15339 [2019-12-26 23:06:11,197 INFO L226 Difference]: Without dead ends: 15339 [2019-12-26 23:06:11,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:06:11,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15339 states. [2019-12-26 23:06:11,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15339 to 15339. [2019-12-26 23:06:11,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15339 states. [2019-12-26 23:06:11,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15339 states to 15339 states and 49236 transitions. [2019-12-26 23:06:11,510 INFO L78 Accepts]: Start accepts. Automaton has 15339 states and 49236 transitions. Word has length 16 [2019-12-26 23:06:11,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:11,510 INFO L462 AbstractCegarLoop]: Abstraction has 15339 states and 49236 transitions. [2019-12-26 23:06:11,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:06:11,510 INFO L276 IsEmpty]: Start isEmpty. Operand 15339 states and 49236 transitions. [2019-12-26 23:06:11,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 23:06:11,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:11,512 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:06:11,512 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-26 23:06:11,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:11,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1764835742, now seen corresponding path program 1 times [2019-12-26 23:06:11,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:11,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860722815] [2019-12-26 23:06:11,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:11,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:06:11,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860722815] [2019-12-26 23:06:11,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:11,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:06:11,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064969324] [2019-12-26 23:06:11,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:06:11,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:11,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:06:11,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:06:11,566 INFO L87 Difference]: Start difference. First operand 15339 states and 49236 transitions. Second operand 5 states. [2019-12-26 23:06:11,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:11,625 INFO L93 Difference]: Finished difference Result 2638 states and 6819 transitions. [2019-12-26 23:06:11,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:06:11,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-26 23:06:11,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:11,630 INFO L225 Difference]: With dead ends: 2638 [2019-12-26 23:06:11,630 INFO L226 Difference]: Without dead ends: 2638 [2019-12-26 23:06:11,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:06:11,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2638 states. [2019-12-26 23:06:11,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2638. [2019-12-26 23:06:11,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2638 states. [2019-12-26 23:06:11,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2638 states to 2638 states and 6819 transitions. [2019-12-26 23:06:11,669 INFO L78 Accepts]: Start accepts. Automaton has 2638 states and 6819 transitions. Word has length 17 [2019-12-26 23:06:11,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:11,669 INFO L462 AbstractCegarLoop]: Abstraction has 2638 states and 6819 transitions. [2019-12-26 23:06:11,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:06:11,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2638 states and 6819 transitions. [2019-12-26 23:06:11,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 23:06:11,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:11,674 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:06:11,674 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-26 23:06:11,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:11,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1144833891, now seen corresponding path program 1 times [2019-12-26 23:06:11,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:11,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012660165] [2019-12-26 23:06:11,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:11,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:11,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:06:11,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012660165] [2019-12-26 23:06:11,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:11,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:06:11,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682420054] [2019-12-26 23:06:11,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:06:11,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:11,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:06:11,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:06:11,780 INFO L87 Difference]: Start difference. First operand 2638 states and 6819 transitions. Second operand 6 states. [2019-12-26 23:06:11,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:11,831 INFO L93 Difference]: Finished difference Result 1222 states and 3487 transitions. [2019-12-26 23:06:11,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:06:11,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-26 23:06:11,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:11,834 INFO L225 Difference]: With dead ends: 1222 [2019-12-26 23:06:11,834 INFO L226 Difference]: Without dead ends: 1222 [2019-12-26 23:06:11,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:06:11,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2019-12-26 23:06:11,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1110. [2019-12-26 23:06:11,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110 states. [2019-12-26 23:06:11,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 3167 transitions. [2019-12-26 23:06:11,849 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 3167 transitions. Word has length 29 [2019-12-26 23:06:11,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:11,850 INFO L462 AbstractCegarLoop]: Abstraction has 1110 states and 3167 transitions. [2019-12-26 23:06:11,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:06:11,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 3167 transitions. [2019-12-26 23:06:11,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 23:06:11,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:11,853 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:06:11,853 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-26 23:06:11,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:11,854 INFO L82 PathProgramCache]: Analyzing trace with hash -275883304, now seen corresponding path program 1 times [2019-12-26 23:06:11,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:11,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020170891] [2019-12-26 23:06:11,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:11,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:06:11,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020170891] [2019-12-26 23:06:11,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:11,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:06:11,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525826869] [2019-12-26 23:06:11,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:06:11,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:11,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:06:11,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:06:11,941 INFO L87 Difference]: Start difference. First operand 1110 states and 3167 transitions. Second operand 3 states. [2019-12-26 23:06:11,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:11,996 INFO L93 Difference]: Finished difference Result 1120 states and 3182 transitions. [2019-12-26 23:06:11,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:06:11,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-26 23:06:11,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:11,998 INFO L225 Difference]: With dead ends: 1120 [2019-12-26 23:06:11,999 INFO L226 Difference]: Without dead ends: 1120 [2019-12-26 23:06:11,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:06:12,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-12-26 23:06:12,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1114. [2019-12-26 23:06:12,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1114 states. [2019-12-26 23:06:12,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 3175 transitions. [2019-12-26 23:06:12,012 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 3175 transitions. Word has length 58 [2019-12-26 23:06:12,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:12,012 INFO L462 AbstractCegarLoop]: Abstraction has 1114 states and 3175 transitions. [2019-12-26 23:06:12,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:06:12,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 3175 transitions. [2019-12-26 23:06:12,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 23:06:12,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:12,017 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:06:12,017 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-26 23:06:12,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:12,017 INFO L82 PathProgramCache]: Analyzing trace with hash -791070951, now seen corresponding path program 1 times [2019-12-26 23:06:12,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:12,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502473902] [2019-12-26 23:06:12,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:12,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:06:12,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502473902] [2019-12-26 23:06:12,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:12,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:06:12,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578896399] [2019-12-26 23:06:12,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:06:12,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:12,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:06:12,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:06:12,126 INFO L87 Difference]: Start difference. First operand 1114 states and 3175 transitions. Second operand 5 states. [2019-12-26 23:06:12,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:12,410 INFO L93 Difference]: Finished difference Result 1623 states and 4613 transitions. [2019-12-26 23:06:12,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:06:12,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-26 23:06:12,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:12,414 INFO L225 Difference]: With dead ends: 1623 [2019-12-26 23:06:12,414 INFO L226 Difference]: Without dead ends: 1623 [2019-12-26 23:06:12,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:06:12,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2019-12-26 23:06:12,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1210. [2019-12-26 23:06:12,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-12-26 23:06:12,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 3463 transitions. [2019-12-26 23:06:12,432 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 3463 transitions. Word has length 58 [2019-12-26 23:06:12,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:12,432 INFO L462 AbstractCegarLoop]: Abstraction has 1210 states and 3463 transitions. [2019-12-26 23:06:12,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:06:12,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 3463 transitions. [2019-12-26 23:06:12,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 23:06:12,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:12,435 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:06:12,435 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-26 23:06:12,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:12,435 INFO L82 PathProgramCache]: Analyzing trace with hash 867176459, now seen corresponding path program 2 times [2019-12-26 23:06:12,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:12,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199475790] [2019-12-26 23:06:12,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:12,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:06:12,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199475790] [2019-12-26 23:06:12,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:12,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:06:12,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706229563] [2019-12-26 23:06:12,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:06:12,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:12,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:06:12,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:06:12,554 INFO L87 Difference]: Start difference. First operand 1210 states and 3463 transitions. Second operand 6 states. [2019-12-26 23:06:13,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:13,322 INFO L93 Difference]: Finished difference Result 1488 states and 4124 transitions. [2019-12-26 23:06:13,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:06:13,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-26 23:06:13,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:13,327 INFO L225 Difference]: With dead ends: 1488 [2019-12-26 23:06:13,327 INFO L226 Difference]: Without dead ends: 1488 [2019-12-26 23:06:13,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:06:13,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2019-12-26 23:06:13,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1266. [2019-12-26 23:06:13,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2019-12-26 23:06:13,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 3555 transitions. [2019-12-26 23:06:13,356 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 3555 transitions. Word has length 58 [2019-12-26 23:06:13,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:13,356 INFO L462 AbstractCegarLoop]: Abstraction has 1266 states and 3555 transitions. [2019-12-26 23:06:13,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:06:13,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 3555 transitions. [2019-12-26 23:06:13,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 23:06:13,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:13,363 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:06:13,363 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-26 23:06:13,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:13,364 INFO L82 PathProgramCache]: Analyzing trace with hash -2105802411, now seen corresponding path program 3 times [2019-12-26 23:06:13,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:13,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900262039] [2019-12-26 23:06:13,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:13,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:06:13,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900262039] [2019-12-26 23:06:13,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:13,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:06:13,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369855723] [2019-12-26 23:06:13,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:06:13,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:13,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:06:13,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:06:13,549 INFO L87 Difference]: Start difference. First operand 1266 states and 3555 transitions. Second operand 3 states. [2019-12-26 23:06:13,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:13,602 INFO L93 Difference]: Finished difference Result 1265 states and 3553 transitions. [2019-12-26 23:06:13,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:06:13,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-26 23:06:13,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:13,605 INFO L225 Difference]: With dead ends: 1265 [2019-12-26 23:06:13,605 INFO L226 Difference]: Without dead ends: 1265 [2019-12-26 23:06:13,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:06:13,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2019-12-26 23:06:13,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 952. [2019-12-26 23:06:13,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2019-12-26 23:06:13,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 2683 transitions. [2019-12-26 23:06:13,625 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 2683 transitions. Word has length 58 [2019-12-26 23:06:13,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:13,626 INFO L462 AbstractCegarLoop]: Abstraction has 952 states and 2683 transitions. [2019-12-26 23:06:13,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:06:13,626 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 2683 transitions. [2019-12-26 23:06:13,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 23:06:13,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:13,629 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:06:13,629 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-26 23:06:13,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:13,629 INFO L82 PathProgramCache]: Analyzing trace with hash 654382096, now seen corresponding path program 1 times [2019-12-26 23:06:13,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:13,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856399126] [2019-12-26 23:06:13,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:13,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:06:13,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856399126] [2019-12-26 23:06:13,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:13,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:06:13,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586244474] [2019-12-26 23:06:13,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 23:06:13,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:13,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 23:06:13,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:06:13,959 INFO L87 Difference]: Start difference. First operand 952 states and 2683 transitions. Second operand 12 states. [2019-12-26 23:06:14,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:14,948 INFO L93 Difference]: Finished difference Result 2470 states and 6380 transitions. [2019-12-26 23:06:14,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 23:06:14,951 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-26 23:06:14,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:14,954 INFO L225 Difference]: With dead ends: 2470 [2019-12-26 23:06:14,954 INFO L226 Difference]: Without dead ends: 1479 [2019-12-26 23:06:14,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2019-12-26 23:06:14,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2019-12-26 23:06:14,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 808. [2019-12-26 23:06:14,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2019-12-26 23:06:14,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 2196 transitions. [2019-12-26 23:06:14,967 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 2196 transitions. Word has length 59 [2019-12-26 23:06:14,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:14,967 INFO L462 AbstractCegarLoop]: Abstraction has 808 states and 2196 transitions. [2019-12-26 23:06:14,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 23:06:14,967 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 2196 transitions. [2019-12-26 23:06:14,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 23:06:14,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:14,969 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:06:14,969 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-26 23:06:14,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:14,970 INFO L82 PathProgramCache]: Analyzing trace with hash -516800392, now seen corresponding path program 2 times [2019-12-26 23:06:14,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:14,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061973238] [2019-12-26 23:06:14,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:15,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:06:15,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061973238] [2019-12-26 23:06:15,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:15,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:06:15,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379637133] [2019-12-26 23:06:15,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:06:15,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:15,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:06:15,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:06:15,046 INFO L87 Difference]: Start difference. First operand 808 states and 2196 transitions. Second operand 3 states. [2019-12-26 23:06:15,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:15,060 INFO L93 Difference]: Finished difference Result 796 states and 2144 transitions. [2019-12-26 23:06:15,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:06:15,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-26 23:06:15,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:15,062 INFO L225 Difference]: With dead ends: 796 [2019-12-26 23:06:15,062 INFO L226 Difference]: Without dead ends: 796 [2019-12-26 23:06:15,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:06:15,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2019-12-26 23:06:15,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 796. [2019-12-26 23:06:15,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2019-12-26 23:06:15,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 2144 transitions. [2019-12-26 23:06:15,075 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 2144 transitions. Word has length 59 [2019-12-26 23:06:15,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:15,075 INFO L462 AbstractCegarLoop]: Abstraction has 796 states and 2144 transitions. [2019-12-26 23:06:15,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:06:15,075 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 2144 transitions. [2019-12-26 23:06:15,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 23:06:15,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:15,077 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:06:15,077 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-26 23:06:15,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:15,078 INFO L82 PathProgramCache]: Analyzing trace with hash -92263015, now seen corresponding path program 1 times [2019-12-26 23:06:15,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:15,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360084324] [2019-12-26 23:06:15,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:15,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:06:15,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360084324] [2019-12-26 23:06:15,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:15,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:06:15,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564996325] [2019-12-26 23:06:15,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:06:15,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:15,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:06:15,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:06:15,287 INFO L87 Difference]: Start difference. First operand 796 states and 2144 transitions. Second operand 6 states. [2019-12-26 23:06:15,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:15,365 INFO L93 Difference]: Finished difference Result 1501 states and 3804 transitions. [2019-12-26 23:06:15,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:06:15,366 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-26 23:06:15,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:15,367 INFO L225 Difference]: With dead ends: 1501 [2019-12-26 23:06:15,367 INFO L226 Difference]: Without dead ends: 611 [2019-12-26 23:06:15,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:06:15,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-12-26 23:06:15,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 449. [2019-12-26 23:06:15,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-12-26 23:06:15,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 979 transitions. [2019-12-26 23:06:15,374 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 979 transitions. Word has length 60 [2019-12-26 23:06:15,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:15,374 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 979 transitions. [2019-12-26 23:06:15,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:06:15,374 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 979 transitions. [2019-12-26 23:06:15,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 23:06:15,376 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:15,376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:06:15,376 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-26 23:06:15,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:15,376 INFO L82 PathProgramCache]: Analyzing trace with hash -837634653, now seen corresponding path program 2 times [2019-12-26 23:06:15,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:15,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762959560] [2019-12-26 23:06:15,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:15,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:06:15,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762959560] [2019-12-26 23:06:15,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:15,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:06:15,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042017525] [2019-12-26 23:06:15,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:06:15,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:15,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:06:15,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:06:15,496 INFO L87 Difference]: Start difference. First operand 449 states and 979 transitions. Second operand 5 states. [2019-12-26 23:06:15,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:15,539 INFO L93 Difference]: Finished difference Result 631 states and 1298 transitions. [2019-12-26 23:06:15,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:06:15,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-12-26 23:06:15,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:15,540 INFO L225 Difference]: With dead ends: 631 [2019-12-26 23:06:15,540 INFO L226 Difference]: Without dead ends: 213 [2019-12-26 23:06:15,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:06:15,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-12-26 23:06:15,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-12-26 23:06:15,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-12-26 23:06:15,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 368 transitions. [2019-12-26 23:06:15,544 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 368 transitions. Word has length 60 [2019-12-26 23:06:15,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:15,545 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 368 transitions. [2019-12-26 23:06:15,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:06:15,545 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 368 transitions. [2019-12-26 23:06:15,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 23:06:15,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:15,547 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:06:15,547 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-26 23:06:15,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:15,547 INFO L82 PathProgramCache]: Analyzing trace with hash -524819563, now seen corresponding path program 3 times [2019-12-26 23:06:15,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:15,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477145693] [2019-12-26 23:06:15,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:06:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:06:15,724 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:06:15,725 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:06:15,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] ULTIMATE.startENTRY-->L821: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= v_~weak$$choice2~0_146 0) (= v_~z$w_buff0_used~0_885 0) (= v_~z$mem_tmp~0_22 0) (= v_~z$r_buff1_thd0~0_298 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1533~0.base_24| 1) |v_#valid_73|) (= 0 v_~z$r_buff1_thd2~0_83) (= 0 v_~z$r_buff1_thd4~0_140) (= 0 v_~z$r_buff1_thd1~0_83) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1533~0.base_24| 4)) (= 0 v_~z$flush_delayed~0_36) (= v_~z$r_buff0_thd3~0_92 0) (= v_~z$read_delayed_var~0.offset_7 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~__unbuffered_p3_EAX~0_100 0) (= v_~z$w_buff0~0_503 0) (= v_~z$w_buff1_used~0_515 0) (= v_~a~0_48 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1533~0.base_24| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1533~0.base_24|) |v_ULTIMATE.start_main_~#t1533~0.offset_18| 0)) |v_#memory_int_25|) (= v_~x~0_57 0) (= v_~z$read_delayed_var~0.base_7 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1533~0.base_24|) 0) (= v_~z$read_delayed~0_7 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1533~0.base_24|) (= v_~z~0_155 0) (= v_~main$tmp_guard1~0_32 0) (= 0 v_~weak$$choice0~0_16) (= v_~__unbuffered_cnt~0_141 0) (= 0 v_~z$r_buff1_thd3~0_146) (= v_~z$w_buff1~0_306 0) (= v_~z$r_buff0_thd0~0_394 0) (= |v_#NULL.offset_5| 0) (= v_~z$r_buff0_thd2~0_32 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff0_thd4~0_161) (= v_~y~0_76 0) (= v_~z$r_buff0_thd1~0_32 0) (= 0 |v_#NULL.base_5|) (= 0 |v_ULTIMATE.start_main_~#t1533~0.offset_18|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t1534~0.offset=|v_ULTIMATE.start_main_~#t1534~0.offset_17|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_59|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_83, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_41|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_32|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_35|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_30|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_45|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_60|, ~a~0=v_~a~0_48, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_394, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_161, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_100, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_22, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_48|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_114|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_515, ULTIMATE.start_main_~#t1535~0.offset=|v_ULTIMATE.start_main_~#t1535~0.offset_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_191|, ~z$flush_delayed~0=v_~z$flush_delayed~0_36, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_35|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_44|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_38|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ULTIMATE.start_main_~#t1536~0.offset=|v_ULTIMATE.start_main_~#t1536~0.offset_17|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_92, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ~x~0=v_~x~0_57, ULTIMATE.start_main_~#t1533~0.base=|v_ULTIMATE.start_main_~#t1533~0.base_24|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_140, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_40|, ULTIMATE.start_main_~#t1536~0.base=|v_ULTIMATE.start_main_~#t1536~0.base_21|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_57|, ~z$w_buff1~0=v_~z$w_buff1~0_306, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_43|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_31|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_29|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_31|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_51|, ULTIMATE.start_main_~#t1533~0.offset=|v_ULTIMATE.start_main_~#t1533~0.offset_18|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_44|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_298, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_25|, ~y~0=v_~y~0_76, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_32, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_885, ~z$w_buff0~0=v_~z$w_buff0~0_503, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_39|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_25|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_146, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_122|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_44|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_36|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_35|, ULTIMATE.start_main_~#t1535~0.base=|v_ULTIMATE.start_main_~#t1535~0.base_20|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ULTIMATE.start_main_~#t1534~0.base=|v_ULTIMATE.start_main_~#t1534~0.base_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_23|, ~z~0=v_~z~0_155, ~weak$$choice2~0=v_~weak$$choice2~0_146, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_32} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1534~0.offset, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t1535~0.offset, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1536~0.offset, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1533~0.base, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1536~0.base, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1533~0.offset, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t1535~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1534~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:06:15,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L821-1-->L823: Formula: (and (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1534~0.base_10|) 0) (not (= |v_ULTIMATE.start_main_~#t1534~0.base_10| 0)) (= |v_ULTIMATE.start_main_~#t1534~0.offset_9| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1534~0.base_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1534~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1534~0.base_10|) |v_ULTIMATE.start_main_~#t1534~0.offset_9| 1)) |v_#memory_int_13|) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1534~0.base_10| 1) |v_#valid_35|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1534~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1534~0.offset=|v_ULTIMATE.start_main_~#t1534~0.offset_9|, ULTIMATE.start_main_~#t1534~0.base=|v_ULTIMATE.start_main_~#t1534~0.base_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1534~0.offset, ULTIMATE.start_main_~#t1534~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-26 23:06:15,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L823-1-->L825: Formula: (and (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1535~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t1535~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1535~0.base_12|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1535~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1535~0.base_12|) |v_ULTIMATE.start_main_~#t1535~0.offset_10| 2)) |v_#memory_int_17|) (= (store |v_#valid_46| |v_ULTIMATE.start_main_~#t1535~0.base_12| 1) |v_#valid_45|) (not (= |v_ULTIMATE.start_main_~#t1535~0.base_12| 0)) (= 0 (select |v_#valid_46| |v_ULTIMATE.start_main_~#t1535~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ULTIMATE.start_main_~#t1535~0.offset=|v_ULTIMATE.start_main_~#t1535~0.offset_10|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1535~0.base=|v_ULTIMATE.start_main_~#t1535~0.base_12|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1535~0.offset, #length, ULTIMATE.start_main_~#t1535~0.base] because there is no mapped edge [2019-12-26 23:06:15,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L825-1-->L827: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1536~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1536~0.base_11|) |v_ULTIMATE.start_main_~#t1536~0.offset_10| 3)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1536~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1536~0.base_11|)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1536~0.base_11| 1)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1536~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1536~0.base_11|) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1536~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1536~0.base=|v_ULTIMATE.start_main_~#t1536~0.base_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1536~0.offset=|v_ULTIMATE.start_main_~#t1536~0.offset_10|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1536~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1536~0.offset, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-26 23:06:15,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P3ENTRY-->L4-3: Formula: (and (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_11| 1) (= v_P3Thread1of1ForFork2_~arg.offset_11 |v_P3Thread1of1ForFork2_#in~arg.offset_11|) (= (mod v_~z$w_buff1_used~0_99 256) 0) (= |v_P3Thread1of1ForFork2_#in~arg.base_11| v_P3Thread1of1ForFork2_~arg.base_11) (= v_~z$w_buff0_used~0_218 1) (= v_~z$w_buff0~0_48 v_~z$w_buff1~0_32) (= 2 v_~z$w_buff0~0_47) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_13 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_11|) (= v_~z$w_buff0_used~0_219 v_~z$w_buff1_used~0_99)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_219, ~z$w_buff0~0=v_~z$w_buff0~0_48, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_11|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_11|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_13, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_11, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_218, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_99, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_11|, ~z$w_buff1~0=v_~z$w_buff1~0_32, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_11|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_11, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_11|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-26 23:06:15,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_19 |v_P0Thread1of1ForFork3_#in~arg.base_19|) (= v_~x~0_44 1) (= 0 |v_P0Thread1of1ForFork3_#res.base_11|) (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= |v_P0Thread1of1ForFork3_#in~arg.offset_19| v_P0Thread1of1ForFork3_~arg.offset_19) (= 0 |v_P0Thread1of1ForFork3_#res.offset_11|) (= v_~a~0_40 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_19|} OutVars{~a~0=v_~a~0_40, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_19|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_19, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_11|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_19, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_19|, ~x~0=v_~x~0_44} AuxVars[] AssignedVars[~a~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-26 23:06:15,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] P1ENTRY-->P1EXIT: Formula: (and (= v_~x~0_39 2) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= v_~y~0_50 1) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_10| v_P1Thread1of1ForFork0_~arg.offset_10) (= v_P1Thread1of1ForFork0_~arg.base_10 |v_P1Thread1of1ForFork0_#in~arg.base_10|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_10|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_10, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_10, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_10|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_50, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-26 23:06:15,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L768-2-->L768-5: Formula: (let ((.cse2 (= |P2Thread1of1ForFork1_#t~ite4_Out346392755| |P2Thread1of1ForFork1_#t~ite3_Out346392755|)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In346392755 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In346392755 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In346392755 |P2Thread1of1ForFork1_#t~ite3_Out346392755|)) (and .cse2 (not .cse0) (= ~z$w_buff1~0_In346392755 |P2Thread1of1ForFork1_#t~ite3_Out346392755|) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In346392755, ~z$w_buff1_used~0=~z$w_buff1_used~0_In346392755, ~z$w_buff1~0=~z$w_buff1~0_In346392755, ~z~0=~z~0_In346392755} OutVars{P2Thread1of1ForFork1_#t~ite4=|P2Thread1of1ForFork1_#t~ite4_Out346392755|, P2Thread1of1ForFork1_#t~ite3=|P2Thread1of1ForFork1_#t~ite3_Out346392755|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In346392755, ~z$w_buff1_used~0=~z$w_buff1_used~0_In346392755, ~z$w_buff1~0=~z$w_buff1~0_In346392755, ~z~0=~z~0_In346392755} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite4, P2Thread1of1ForFork1_#t~ite3] because there is no mapped edge [2019-12-26 23:06:15,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In79179452 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In79179452 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite5_Out79179452| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In79179452 |P2Thread1of1ForFork1_#t~ite5_Out79179452|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In79179452, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In79179452} OutVars{P2Thread1of1ForFork1_#t~ite5=|P2Thread1of1ForFork1_#t~ite5_Out79179452|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In79179452, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In79179452} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-26 23:06:15,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L770-->L770-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-754848808 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-754848808 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-754848808 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-754848808 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite6_Out-754848808| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite6_Out-754848808| ~z$w_buff1_used~0_In-754848808) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-754848808, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-754848808, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-754848808, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-754848808} OutVars{P2Thread1of1ForFork1_#t~ite6=|P2Thread1of1ForFork1_#t~ite6_Out-754848808|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-754848808, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-754848808, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-754848808, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-754848808} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-26 23:06:15,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In272174321 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In272174321 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite7_Out272174321| ~z$r_buff0_thd3~0_In272174321) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite7_Out272174321| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In272174321, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In272174321} OutVars{P2Thread1of1ForFork1_#t~ite7=|P2Thread1of1ForFork1_#t~ite7_Out272174321|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In272174321, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In272174321} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite7] because there is no mapped edge [2019-12-26 23:06:15,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-849867830 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-849867830 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-849867830 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-849867830 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite8_Out-849867830| ~z$r_buff1_thd3~0_In-849867830) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite8_Out-849867830| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-849867830, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-849867830, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-849867830, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-849867830} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-849867830, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-849867830, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-849867830, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-849867830, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out-849867830|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 23:06:15,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L772-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= v_~z$r_buff1_thd3~0_127 |v_P2Thread1of1ForFork1_#t~ite8_46|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P2Thread1of1ForFork1_#t~ite8=|v_P2Thread1of1ForFork1_#t~ite8_46|} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_127, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|, P2Thread1of1ForFork1_#t~ite8=|v_P2Thread1of1ForFork1_#t~ite8_45|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 23:06:15,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In481651089 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In481651089 256) 0))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork2_#t~ite11_Out481651089|) (not .cse1)) (and (= |P3Thread1of1ForFork2_#t~ite11_Out481651089| ~z$w_buff0_used~0_In481651089) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In481651089, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In481651089} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In481651089, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In481651089, P3Thread1of1ForFork2_#t~ite11=|P3Thread1of1ForFork2_#t~ite11_Out481651089|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 23:06:15,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In910316702 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In910316702 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In910316702 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In910316702 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite12_Out910316702|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork2_#t~ite12_Out910316702| ~z$w_buff1_used~0_In910316702) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In910316702, ~z$w_buff0_used~0=~z$w_buff0_used~0_In910316702, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In910316702, ~z$w_buff1_used~0=~z$w_buff1_used~0_In910316702} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In910316702, ~z$w_buff0_used~0=~z$w_buff0_used~0_In910316702, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In910316702, ~z$w_buff1_used~0=~z$w_buff1_used~0_In910316702, P3Thread1of1ForFork2_#t~ite12=|P3Thread1of1ForFork2_#t~ite12_Out910316702|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-26 23:06:15,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L801-->L802: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In1951197663 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1951197663 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out1951197663 ~z$r_buff0_thd4~0_In1951197663)) (and (= ~z$r_buff0_thd4~0_Out1951197663 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1951197663, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1951197663} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1951197663, P3Thread1of1ForFork2_#t~ite13=|P3Thread1of1ForFork2_#t~ite13_Out1951197663|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1951197663} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite13, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-26 23:06:15,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1820935429 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1820935429 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-1820935429 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1820935429 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite14_Out-1820935429| ~z$r_buff1_thd4~0_In-1820935429) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite14_Out-1820935429| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1820935429, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1820935429, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1820935429, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1820935429} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1820935429, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1820935429, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1820935429, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1820935429, P3Thread1of1ForFork2_#t~ite14=|P3Thread1of1ForFork2_#t~ite14_Out-1820935429|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 23:06:15,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L802-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#t~ite14_56| v_~z$r_buff1_thd4~0_130) (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_126 (+ v_~__unbuffered_cnt~0_127 1))) InVars {P3Thread1of1ForFork2_#t~ite14=|v_P3Thread1of1ForFork2_#t~ite14_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_130, P3Thread1of1ForFork2_#t~ite14=|v_P3Thread1of1ForFork2_#t~ite14_55|, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#t~ite14, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 23:06:15,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L827-1-->L833: Formula: (and (= 4 v_~__unbuffered_cnt~0_21) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-26 23:06:15,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L833-2-->L833-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-1540672662 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1540672662 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In-1540672662 |ULTIMATE.start_main_#t~ite19_Out-1540672662|) (not .cse1)) (and (or .cse1 .cse0) (= ~z~0_In-1540672662 |ULTIMATE.start_main_#t~ite19_Out-1540672662|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1540672662, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1540672662, ~z$w_buff1~0=~z$w_buff1~0_In-1540672662, ~z~0=~z~0_In-1540672662} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1540672662|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1540672662, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1540672662, ~z$w_buff1~0=~z$w_buff1~0_In-1540672662, ~z~0=~z~0_In-1540672662} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-26 23:06:15,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L833-4-->L834: Formula: (= v_~z~0_31 |v_ULTIMATE.start_main_#t~ite19_8|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_8|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|, ~z~0=v_~z~0_31, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-26 23:06:15,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1460893707 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1460893707 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-1460893707| 0)) (and (= |ULTIMATE.start_main_#t~ite21_Out-1460893707| ~z$w_buff0_used~0_In-1460893707) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1460893707, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1460893707} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1460893707, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1460893707, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1460893707|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-26 23:06:15,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L835-->L835-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1675930239 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1675930239 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1675930239 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-1675930239 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1675930239 |ULTIMATE.start_main_#t~ite22_Out-1675930239|)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-1675930239|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1675930239, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1675930239, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1675930239, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1675930239} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1675930239, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1675930239, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1675930239, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1675930239, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1675930239|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-26 23:06:15,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L836-->L836-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1850582892 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1850582892 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite23_Out1850582892| ~z$r_buff0_thd0~0_In1850582892) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite23_Out1850582892| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1850582892, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1850582892} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1850582892, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1850582892, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1850582892|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-26 23:06:15,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L837-->L837-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1745997577 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1745997577 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1745997577 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1745997577 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite24_Out-1745997577|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-1745997577 |ULTIMATE.start_main_#t~ite24_Out-1745997577|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1745997577, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1745997577, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1745997577, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1745997577} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1745997577, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1745997577, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1745997577, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1745997577|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1745997577} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-26 23:06:15,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L849-->L850: Formula: (and (= v_~z$r_buff0_thd0~0_119 v_~z$r_buff0_thd0~0_120) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_120, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_29, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 23:06:15,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L850-->L850-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In821910137 256)))) (or (and (= ~z$r_buff1_thd0~0_In821910137 |ULTIMATE.start_main_#t~ite45_Out821910137|) (= |ULTIMATE.start_main_#t~ite46_Out821910137| |ULTIMATE.start_main_#t~ite45_Out821910137|) (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In821910137 256) 0))) (or (and (= (mod ~z$r_buff1_thd0~0_In821910137 256) 0) .cse0) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In821910137 256))) (= (mod ~z$w_buff0_used~0_In821910137 256) 0))) .cse1) (and (= |ULTIMATE.start_main_#t~ite45_In821910137| |ULTIMATE.start_main_#t~ite45_Out821910137|) (= ~z$r_buff1_thd0~0_In821910137 |ULTIMATE.start_main_#t~ite46_Out821910137|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In821910137, ~z$w_buff0_used~0=~z$w_buff0_used~0_In821910137, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In821910137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In821910137, ~weak$$choice2~0=~weak$$choice2~0_In821910137, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In821910137|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In821910137, ~z$w_buff0_used~0=~z$w_buff0_used~0_In821910137, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In821910137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In821910137, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out821910137|, ~weak$$choice2~0=~weak$$choice2~0_In821910137, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out821910137|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 23:06:15,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L852-->L855-1: Formula: (and (= v_~z$mem_tmp~0_13 v_~z~0_120) (= 0 v_~z$flush_delayed~0_24) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (not (= 0 (mod v_~z$flush_delayed~0_25 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~z$flush_delayed~0=v_~z$flush_delayed~0_25} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~z$flush_delayed~0=v_~z$flush_delayed~0_24, ~z~0=v_~z~0_120, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:06:15,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L855-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 23:06:15,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:06:15 BasicIcfg [2019-12-26 23:06:15,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:06:15,902 INFO L168 Benchmark]: Toolchain (without parser) took 26630.66 ms. Allocated memory was 138.9 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 101.8 MB in the beginning and 653.2 MB in the end (delta: -551.4 MB). Peak memory consumption was 491.4 MB. Max. memory is 7.1 GB. [2019-12-26 23:06:15,903 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-26 23:06:15,904 INFO L168 Benchmark]: CACSL2BoogieTranslator took 752.09 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.4 MB in the beginning and 157.0 MB in the end (delta: -55.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-12-26 23:06:15,907 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.79 ms. Allocated memory is still 203.4 MB. Free memory was 157.0 MB in the beginning and 153.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-26 23:06:15,907 INFO L168 Benchmark]: Boogie Preprocessor took 39.05 ms. Allocated memory is still 203.4 MB. Free memory was 153.7 MB in the beginning and 151.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 23:06:15,908 INFO L168 Benchmark]: RCFGBuilder took 848.19 ms. Allocated memory is still 203.4 MB. Free memory was 151.1 MB in the beginning and 102.8 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 7.1 GB. [2019-12-26 23:06:15,909 INFO L168 Benchmark]: TraceAbstraction took 24910.49 ms. Allocated memory was 203.4 MB in the beginning and 1.2 GB in the end (delta: 978.3 MB). Free memory was 102.1 MB in the beginning and 653.2 MB in the end (delta: -551.1 MB). Peak memory consumption was 427.2 MB. Max. memory is 7.1 GB. [2019-12-26 23:06:15,916 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 752.09 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.4 MB in the beginning and 157.0 MB in the end (delta: -55.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.79 ms. Allocated memory is still 203.4 MB. Free memory was 157.0 MB in the beginning and 153.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.05 ms. Allocated memory is still 203.4 MB. Free memory was 153.7 MB in the beginning and 151.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 848.19 ms. Allocated memory is still 203.4 MB. Free memory was 151.1 MB in the beginning and 102.8 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24910.49 ms. Allocated memory was 203.4 MB in the beginning and 1.2 GB in the end (delta: 978.3 MB). Free memory was 102.1 MB in the beginning and 653.2 MB in the end (delta: -551.1 MB). Peak memory consumption was 427.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 178 ProgramPointsBefore, 91 ProgramPointsAfterwards, 206 TransitionsBefore, 100 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 24 ChoiceCompositions, 4617 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 231 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 56276 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L821] FCALL, FORK 0 pthread_create(&t1533, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] FCALL, FORK 0 pthread_create(&t1534, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] FCALL, FORK 0 pthread_create(&t1535, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t1536, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L788] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L789] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L790] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L791] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L792] 4 z$r_buff0_thd4 = (_Bool)1 [L795] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 3 y = 2 [L765] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L769] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L770] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L771] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] 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}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] 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) [L799] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L800] 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 [L833] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L835] 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 [L836] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L837] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L840] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L841] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L842] 0 z$flush_delayed = weak$$choice2 [L843] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L845] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L846] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L847] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L848] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 24.5s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1551 SDtfs, 1572 SDslu, 2973 SDs, 0 SdLazy, 1458 SolverSat, 139 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 19 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46670occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 6367 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 631 NumberOfCodeBlocks, 631 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 557 ConstructedInterpolants, 0 QuantifiedInterpolants, 112366 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...