/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:59:26,137 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:59:26,140 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:59:26,158 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:59:26,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:59:26,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:59:26,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:59:26,172 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:59:26,176 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:59:26,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:59:26,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:59:26,183 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:59:26,183 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:59:26,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:59:26,187 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:59:26,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:59:26,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:59:26,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:59:26,192 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:59:26,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:59:26,201 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:59:26,206 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:59:26,207 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:59:26,208 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:59:26,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:59:26,210 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:59:26,210 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:59:26,212 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:59:26,213 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:59:26,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:59:26,214 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:59:26,216 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:59:26,217 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:59:26,218 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:59:26,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:59:26,219 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:59:26,220 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:59:26,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:59:26,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:59:26,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:59:26,222 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:59:26,223 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:59:26,256 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:59:26,258 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:59:26,259 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:59:26,259 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:59:26,260 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:59:26,262 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:59:26,262 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:59:26,262 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:59:26,263 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:59:26,263 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:59:26,263 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:59:26,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:59:26,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:59:26,263 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:59:26,264 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:59:26,264 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:59:26,264 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:59:26,264 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:59:26,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:59:26,265 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:59:26,265 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:59:26,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:59:26,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:59:26,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:59:26,266 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:59:26,267 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:59:26,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:59:26,268 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:59:26,268 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:59:26,268 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:59:26,547 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:59:26,562 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:59:26,567 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:59:26,569 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:59:26,569 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:59:26,570 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_rmo.opt.i [2019-12-18 21:59:26,645 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41de5fb81/bb69df1f079c4355ba9d4d3439412c11/FLAG7b60e3b85 [2019-12-18 21:59:27,236 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:59:27,237 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_rmo.opt.i [2019-12-18 21:59:27,252 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41de5fb81/bb69df1f079c4355ba9d4d3439412c11/FLAG7b60e3b85 [2019-12-18 21:59:27,464 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41de5fb81/bb69df1f079c4355ba9d4d3439412c11 [2019-12-18 21:59:27,475 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:59:27,477 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:59:27,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:59:27,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:59:27,486 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:59:27,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:59:27" (1/1) ... [2019-12-18 21:59:27,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f0f0d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:27, skipping insertion in model container [2019-12-18 21:59:27,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:59:27" (1/1) ... [2019-12-18 21:59:27,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:59:27,567 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:59:28,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:59:28,153 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:59:28,210 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:59:28,296 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:59:28,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:28 WrapperNode [2019-12-18 21:59:28,296 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:59:28,297 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:59:28,297 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:59:28,297 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:59:28,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:28" (1/1) ... [2019-12-18 21:59:28,326 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:28" (1/1) ... [2019-12-18 21:59:28,364 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:59:28,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:59:28,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:59:28,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:59:28,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:28" (1/1) ... [2019-12-18 21:59:28,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:28" (1/1) ... [2019-12-18 21:59:28,381 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:28" (1/1) ... [2019-12-18 21:59:28,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:28" (1/1) ... [2019-12-18 21:59:28,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:28" (1/1) ... [2019-12-18 21:59:28,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:28" (1/1) ... [2019-12-18 21:59:28,400 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:28" (1/1) ... [2019-12-18 21:59:28,405 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:59:28,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:59:28,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:59:28,406 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:59:28,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:59:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:59:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:59:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:59:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:59:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:59:28,474 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:59:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:59:28,474 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:59:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:59:28,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:59:28,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:59:28,477 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:59:29,187 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:59:29,187 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:59:29,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:59:29 BoogieIcfgContainer [2019-12-18 21:59:29,189 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:59:29,190 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:59:29,190 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:59:29,194 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:59:29,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:59:27" (1/3) ... [2019-12-18 21:59:29,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7edc9f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:59:29, skipping insertion in model container [2019-12-18 21:59:29,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:28" (2/3) ... [2019-12-18 21:59:29,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7edc9f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:59:29, skipping insertion in model container [2019-12-18 21:59:29,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:59:29" (3/3) ... [2019-12-18 21:59:29,198 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_rmo.opt.i [2019-12-18 21:59:29,209 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:59:29,209 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:59:29,218 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:59:29,219 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:59:29,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,254 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,254 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,262 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,262 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,263 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,263 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,263 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,277 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,277 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,280 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,281 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,281 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:29,297 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 21:59:29,314 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:59:29,315 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:59:29,315 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:59:29,315 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:59:29,315 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:59:29,315 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:59:29,316 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:59:29,316 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:59:29,332 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-18 21:59:29,335 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 21:59:29,462 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 21:59:29,463 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:59:29,485 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:59:29,504 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 21:59:29,557 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 21:59:29,557 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:59:29,562 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:59:29,575 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-18 21:59:29,576 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:59:32,454 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 21:59:32,561 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 21:59:32,579 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49437 [2019-12-18 21:59:32,580 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-18 21:59:32,583 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 94 transitions [2019-12-18 21:59:33,065 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9388 states. [2019-12-18 21:59:33,067 INFO L276 IsEmpty]: Start isEmpty. Operand 9388 states. [2019-12-18 21:59:33,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 21:59:33,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:33,073 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 21:59:33,074 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:33,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:33,079 INFO L82 PathProgramCache]: Analyzing trace with hash 694837997, now seen corresponding path program 1 times [2019-12-18 21:59:33,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:33,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062213436] [2019-12-18 21:59:33,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:33,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:33,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062213436] [2019-12-18 21:59:33,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:33,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:59:33,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462408414] [2019-12-18 21:59:33,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:59:33,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:33,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:59:33,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:33,307 INFO L87 Difference]: Start difference. First operand 9388 states. Second operand 3 states. [2019-12-18 21:59:33,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:33,759 INFO L93 Difference]: Finished difference Result 9298 states and 30527 transitions. [2019-12-18 21:59:33,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:59:33,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 21:59:33,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:33,868 INFO L225 Difference]: With dead ends: 9298 [2019-12-18 21:59:33,868 INFO L226 Difference]: Without dead ends: 9116 [2019-12-18 21:59:33,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:33,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9116 states. [2019-12-18 21:59:34,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9116 to 9116. [2019-12-18 21:59:34,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9116 states. [2019-12-18 21:59:34,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9116 states to 9116 states and 29968 transitions. [2019-12-18 21:59:34,332 INFO L78 Accepts]: Start accepts. Automaton has 9116 states and 29968 transitions. Word has length 5 [2019-12-18 21:59:34,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:34,332 INFO L462 AbstractCegarLoop]: Abstraction has 9116 states and 29968 transitions. [2019-12-18 21:59:34,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:59:34,333 INFO L276 IsEmpty]: Start isEmpty. Operand 9116 states and 29968 transitions. [2019-12-18 21:59:34,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:59:34,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:34,338 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:34,338 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:34,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:34,339 INFO L82 PathProgramCache]: Analyzing trace with hash -869232034, now seen corresponding path program 1 times [2019-12-18 21:59:34,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:34,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69585935] [2019-12-18 21:59:34,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:34,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:34,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69585935] [2019-12-18 21:59:34,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:34,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:59:34,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715120978] [2019-12-18 21:59:34,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:59:34,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:34,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:59:34,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:59:34,518 INFO L87 Difference]: Start difference. First operand 9116 states and 29968 transitions. Second operand 4 states. [2019-12-18 21:59:35,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:35,162 INFO L93 Difference]: Finished difference Result 14491 states and 45326 transitions. [2019-12-18 21:59:35,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:59:35,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:59:35,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:35,250 INFO L225 Difference]: With dead ends: 14491 [2019-12-18 21:59:35,251 INFO L226 Difference]: Without dead ends: 14484 [2019-12-18 21:59:35,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:59:35,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14484 states. [2019-12-18 21:59:35,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14484 to 13090. [2019-12-18 21:59:35,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13090 states. [2019-12-18 21:59:36,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13090 states to 13090 states and 41590 transitions. [2019-12-18 21:59:36,550 INFO L78 Accepts]: Start accepts. Automaton has 13090 states and 41590 transitions. Word has length 11 [2019-12-18 21:59:36,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:36,551 INFO L462 AbstractCegarLoop]: Abstraction has 13090 states and 41590 transitions. [2019-12-18 21:59:36,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:59:36,551 INFO L276 IsEmpty]: Start isEmpty. Operand 13090 states and 41590 transitions. [2019-12-18 21:59:36,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:59:36,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:36,554 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:36,554 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:36,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:36,554 INFO L82 PathProgramCache]: Analyzing trace with hash 256873832, now seen corresponding path program 1 times [2019-12-18 21:59:36,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:36,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639916782] [2019-12-18 21:59:36,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:36,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:36,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639916782] [2019-12-18 21:59:36,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:36,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:59:36,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626833669] [2019-12-18 21:59:36,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:59:36,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:36,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:59:36,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:59:36,623 INFO L87 Difference]: Start difference. First operand 13090 states and 41590 transitions. Second operand 4 states. [2019-12-18 21:59:36,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:36,891 INFO L93 Difference]: Finished difference Result 15862 states and 50069 transitions. [2019-12-18 21:59:36,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:59:36,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:59:36,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:36,946 INFO L225 Difference]: With dead ends: 15862 [2019-12-18 21:59:36,946 INFO L226 Difference]: Without dead ends: 15862 [2019-12-18 21:59:36,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:59:37,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15862 states. [2019-12-18 21:59:37,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15862 to 14086. [2019-12-18 21:59:37,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14086 states. [2019-12-18 21:59:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14086 states to 14086 states and 44814 transitions. [2019-12-18 21:59:37,492 INFO L78 Accepts]: Start accepts. Automaton has 14086 states and 44814 transitions. Word has length 11 [2019-12-18 21:59:37,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:37,493 INFO L462 AbstractCegarLoop]: Abstraction has 14086 states and 44814 transitions. [2019-12-18 21:59:37,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:59:37,493 INFO L276 IsEmpty]: Start isEmpty. Operand 14086 states and 44814 transitions. [2019-12-18 21:59:37,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 21:59:37,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:37,499 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:37,499 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:37,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:37,500 INFO L82 PathProgramCache]: Analyzing trace with hash -955684775, now seen corresponding path program 1 times [2019-12-18 21:59:37,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:37,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548063905] [2019-12-18 21:59:37,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:37,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:37,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548063905] [2019-12-18 21:59:37,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:37,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:59:37,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938903796] [2019-12-18 21:59:37,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:59:37,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:37,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:59:37,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:59:37,711 INFO L87 Difference]: Start difference. First operand 14086 states and 44814 transitions. Second operand 6 states. [2019-12-18 21:59:38,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:38,363 INFO L93 Difference]: Finished difference Result 21338 states and 66086 transitions. [2019-12-18 21:59:38,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:59:38,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-18 21:59:38,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:38,434 INFO L225 Difference]: With dead ends: 21338 [2019-12-18 21:59:38,435 INFO L226 Difference]: Without dead ends: 21331 [2019-12-18 21:59:38,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:59:38,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21331 states. [2019-12-18 21:59:39,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21331 to 13923. [2019-12-18 21:59:39,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13923 states. [2019-12-18 21:59:39,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13923 states to 13923 states and 44219 transitions. [2019-12-18 21:59:39,061 INFO L78 Accepts]: Start accepts. Automaton has 13923 states and 44219 transitions. Word has length 17 [2019-12-18 21:59:39,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:39,062 INFO L462 AbstractCegarLoop]: Abstraction has 13923 states and 44219 transitions. [2019-12-18 21:59:39,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:59:39,062 INFO L276 IsEmpty]: Start isEmpty. Operand 13923 states and 44219 transitions. [2019-12-18 21:59:39,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 21:59:39,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:39,070 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:39,070 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:39,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:39,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1704004507, now seen corresponding path program 1 times [2019-12-18 21:59:39,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:39,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978256823] [2019-12-18 21:59:39,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:39,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:39,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978256823] [2019-12-18 21:59:39,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:39,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:59:39,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607050575] [2019-12-18 21:59:39,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:59:39,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:39,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:59:39,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:59:39,161 INFO L87 Difference]: Start difference. First operand 13923 states and 44219 transitions. Second operand 4 states. [2019-12-18 21:59:39,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:39,195 INFO L93 Difference]: Finished difference Result 2045 states and 4753 transitions. [2019-12-18 21:59:39,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:59:39,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-18 21:59:39,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:39,202 INFO L225 Difference]: With dead ends: 2045 [2019-12-18 21:59:39,202 INFO L226 Difference]: Without dead ends: 1759 [2019-12-18 21:59:39,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:59:39,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2019-12-18 21:59:39,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1759. [2019-12-18 21:59:39,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1759 states. [2019-12-18 21:59:39,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 3962 transitions. [2019-12-18 21:59:39,231 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 3962 transitions. Word has length 21 [2019-12-18 21:59:39,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:39,232 INFO L462 AbstractCegarLoop]: Abstraction has 1759 states and 3962 transitions. [2019-12-18 21:59:39,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:59:39,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 3962 transitions. [2019-12-18 21:59:39,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 21:59:39,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:39,236 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:39,236 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:39,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:39,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1474097368, now seen corresponding path program 1 times [2019-12-18 21:59:39,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:39,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729258765] [2019-12-18 21:59:39,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:39,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:39,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729258765] [2019-12-18 21:59:39,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:39,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:59:39,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991451327] [2019-12-18 21:59:39,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:59:39,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:39,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:59:39,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:59:39,340 INFO L87 Difference]: Start difference. First operand 1759 states and 3962 transitions. Second operand 5 states. [2019-12-18 21:59:39,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:39,653 INFO L93 Difference]: Finished difference Result 2191 states and 4834 transitions. [2019-12-18 21:59:39,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:59:39,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-18 21:59:39,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:39,660 INFO L225 Difference]: With dead ends: 2191 [2019-12-18 21:59:39,660 INFO L226 Difference]: Without dead ends: 2191 [2019-12-18 21:59:39,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:59:39,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states. [2019-12-18 21:59:39,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 1971. [2019-12-18 21:59:39,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2019-12-18 21:59:39,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 4400 transitions. [2019-12-18 21:59:39,696 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 4400 transitions. Word has length 23 [2019-12-18 21:59:39,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:39,697 INFO L462 AbstractCegarLoop]: Abstraction has 1971 states and 4400 transitions. [2019-12-18 21:59:39,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:59:39,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 4400 transitions. [2019-12-18 21:59:39,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 21:59:39,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:39,701 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] [2019-12-18 21:59:39,701 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:39,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:39,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1342821607, now seen corresponding path program 1 times [2019-12-18 21:59:39,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:39,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742893129] [2019-12-18 21:59:39,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:39,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:39,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742893129] [2019-12-18 21:59:39,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:39,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:59:39,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028437791] [2019-12-18 21:59:39,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:59:39,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:39,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:59:39,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:39,774 INFO L87 Difference]: Start difference. First operand 1971 states and 4400 transitions. Second operand 3 states. [2019-12-18 21:59:39,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:39,833 INFO L93 Difference]: Finished difference Result 2321 states and 5242 transitions. [2019-12-18 21:59:39,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:59:39,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-18 21:59:39,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:39,843 INFO L225 Difference]: With dead ends: 2321 [2019-12-18 21:59:39,843 INFO L226 Difference]: Without dead ends: 2321 [2019-12-18 21:59:39,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:39,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2019-12-18 21:59:39,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2207. [2019-12-18 21:59:39,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2207 states. [2019-12-18 21:59:39,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 5011 transitions. [2019-12-18 21:59:39,896 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 5011 transitions. Word has length 37 [2019-12-18 21:59:39,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:39,896 INFO L462 AbstractCegarLoop]: Abstraction has 2207 states and 5011 transitions. [2019-12-18 21:59:39,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:59:39,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 5011 transitions. [2019-12-18 21:59:39,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 21:59:39,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:39,906 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] [2019-12-18 21:59:39,906 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:39,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:39,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1180281911, now seen corresponding path program 1 times [2019-12-18 21:59:39,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:39,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786937802] [2019-12-18 21:59:39,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:40,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:40,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786937802] [2019-12-18 21:59:40,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:40,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:59:40,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956540160] [2019-12-18 21:59:40,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:59:40,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:40,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:59:40,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:59:40,065 INFO L87 Difference]: Start difference. First operand 2207 states and 5011 transitions. Second operand 5 states. [2019-12-18 21:59:40,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:40,112 INFO L93 Difference]: Finished difference Result 431 states and 787 transitions. [2019-12-18 21:59:40,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:59:40,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 21:59:40,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:40,114 INFO L225 Difference]: With dead ends: 431 [2019-12-18 21:59:40,114 INFO L226 Difference]: Without dead ends: 385 [2019-12-18 21:59:40,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:59:40,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-12-18 21:59:40,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 350. [2019-12-18 21:59:40,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-12-18 21:59:40,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 632 transitions. [2019-12-18 21:59:40,120 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 632 transitions. Word has length 37 [2019-12-18 21:59:40,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:40,122 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 632 transitions. [2019-12-18 21:59:40,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:59:40,122 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 632 transitions. [2019-12-18 21:59:40,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:59:40,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:40,124 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] [2019-12-18 21:59:40,124 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:40,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:40,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1601104520, now seen corresponding path program 1 times [2019-12-18 21:59:40,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:40,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575878296] [2019-12-18 21:59:40,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:40,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:40,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575878296] [2019-12-18 21:59:40,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:40,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:59:40,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294872092] [2019-12-18 21:59:40,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:59:40,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:40,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:59:40,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:40,222 INFO L87 Difference]: Start difference. First operand 350 states and 632 transitions. Second operand 3 states. [2019-12-18 21:59:40,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:40,233 INFO L93 Difference]: Finished difference Result 350 states and 619 transitions. [2019-12-18 21:59:40,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:59:40,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 21:59:40,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:40,234 INFO L225 Difference]: With dead ends: 350 [2019-12-18 21:59:40,234 INFO L226 Difference]: Without dead ends: 350 [2019-12-18 21:59:40,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:40,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-12-18 21:59:40,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2019-12-18 21:59:40,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-12-18 21:59:40,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 619 transitions. [2019-12-18 21:59:40,240 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 619 transitions. Word has length 52 [2019-12-18 21:59:40,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:40,241 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 619 transitions. [2019-12-18 21:59:40,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:59:40,242 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 619 transitions. [2019-12-18 21:59:40,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 21:59:40,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:40,244 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] [2019-12-18 21:59:40,244 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:40,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:40,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1092657509, now seen corresponding path program 1 times [2019-12-18 21:59:40,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:40,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702827733] [2019-12-18 21:59:40,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:40,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:40,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702827733] [2019-12-18 21:59:40,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:40,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:59:40,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004149430] [2019-12-18 21:59:40,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:59:40,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:40,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:59:40,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:59:40,625 INFO L87 Difference]: Start difference. First operand 350 states and 619 transitions. Second operand 9 states. [2019-12-18 21:59:41,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:41,185 INFO L93 Difference]: Finished difference Result 588 states and 1027 transitions. [2019-12-18 21:59:41,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:59:41,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-18 21:59:41,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:41,186 INFO L225 Difference]: With dead ends: 588 [2019-12-18 21:59:41,187 INFO L226 Difference]: Without dead ends: 588 [2019-12-18 21:59:41,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-18 21:59:41,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-12-18 21:59:41,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 438. [2019-12-18 21:59:41,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-12-18 21:59:41,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 774 transitions. [2019-12-18 21:59:41,194 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 774 transitions. Word has length 53 [2019-12-18 21:59:41,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:41,195 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 774 transitions. [2019-12-18 21:59:41,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:59:41,195 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 774 transitions. [2019-12-18 21:59:41,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 21:59:41,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:41,197 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] [2019-12-18 21:59:41,197 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:41,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:41,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1194206821, now seen corresponding path program 2 times [2019-12-18 21:59:41,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:41,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250946687] [2019-12-18 21:59:41,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:41,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:41,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250946687] [2019-12-18 21:59:41,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:41,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:59:41,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807708163] [2019-12-18 21:59:41,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:59:41,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:41,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:59:41,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:41,269 INFO L87 Difference]: Start difference. First operand 438 states and 774 transitions. Second operand 3 states. [2019-12-18 21:59:41,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:41,318 INFO L93 Difference]: Finished difference Result 437 states and 772 transitions. [2019-12-18 21:59:41,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:59:41,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 21:59:41,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:41,320 INFO L225 Difference]: With dead ends: 437 [2019-12-18 21:59:41,320 INFO L226 Difference]: Without dead ends: 437 [2019-12-18 21:59:41,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:41,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-12-18 21:59:41,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 349. [2019-12-18 21:59:41,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-12-18 21:59:41,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 608 transitions. [2019-12-18 21:59:41,328 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 608 transitions. Word has length 53 [2019-12-18 21:59:41,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:41,328 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 608 transitions. [2019-12-18 21:59:41,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:59:41,328 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 608 transitions. [2019-12-18 21:59:41,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 21:59:41,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:41,330 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] [2019-12-18 21:59:41,330 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:41,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:41,330 INFO L82 PathProgramCache]: Analyzing trace with hash 36779083, now seen corresponding path program 1 times [2019-12-18 21:59:41,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:41,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929944892] [2019-12-18 21:59:41,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:41,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:41,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929944892] [2019-12-18 21:59:41,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:41,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:59:41,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795055039] [2019-12-18 21:59:41,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 21:59:41,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:41,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 21:59:41,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:59:41,619 INFO L87 Difference]: Start difference. First operand 349 states and 608 transitions. Second operand 13 states. [2019-12-18 21:59:42,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:42,223 INFO L93 Difference]: Finished difference Result 684 states and 1210 transitions. [2019-12-18 21:59:42,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 21:59:42,224 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-18 21:59:42,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:42,225 INFO L225 Difference]: With dead ends: 684 [2019-12-18 21:59:42,225 INFO L226 Difference]: Without dead ends: 296 [2019-12-18 21:59:42,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2019-12-18 21:59:42,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-12-18 21:59:42,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 267. [2019-12-18 21:59:42,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-12-18 21:59:42,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 458 transitions. [2019-12-18 21:59:42,230 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 458 transitions. Word has length 54 [2019-12-18 21:59:42,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:42,231 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 458 transitions. [2019-12-18 21:59:42,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 21:59:42,231 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 458 transitions. [2019-12-18 21:59:42,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 21:59:42,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:42,232 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] [2019-12-18 21:59:42,232 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:42,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:42,233 INFO L82 PathProgramCache]: Analyzing trace with hash -853828981, now seen corresponding path program 2 times [2019-12-18 21:59:42,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:42,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075953738] [2019-12-18 21:59:42,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:42,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:42,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075953738] [2019-12-18 21:59:42,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:42,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:59:42,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227588389] [2019-12-18 21:59:42,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 21:59:42,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:42,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 21:59:42,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:59:42,399 INFO L87 Difference]: Start difference. First operand 267 states and 458 transitions. Second operand 10 states. [2019-12-18 21:59:42,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:42,591 INFO L93 Difference]: Finished difference Result 385 states and 641 transitions. [2019-12-18 21:59:42,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:59:42,592 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-18 21:59:42,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:42,592 INFO L225 Difference]: With dead ends: 385 [2019-12-18 21:59:42,592 INFO L226 Difference]: Without dead ends: 222 [2019-12-18 21:59:42,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-12-18 21:59:42,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-12-18 21:59:42,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 198. [2019-12-18 21:59:42,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-12-18 21:59:42,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 342 transitions. [2019-12-18 21:59:42,597 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 342 transitions. Word has length 54 [2019-12-18 21:59:42,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:42,597 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 342 transitions. [2019-12-18 21:59:42,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 21:59:42,597 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 342 transitions. [2019-12-18 21:59:42,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 21:59:42,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:42,598 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] [2019-12-18 21:59:42,598 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:42,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:42,599 INFO L82 PathProgramCache]: Analyzing trace with hash -655778997, now seen corresponding path program 3 times [2019-12-18 21:59:42,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:42,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140265744] [2019-12-18 21:59:42,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:59:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:59:42,731 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:59:42,731 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:59:42,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] ULTIMATE.startENTRY-->L789: Formula: (let ((.cse0 (store |v_#valid_42| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~main$tmp_guard0~0_10 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1611~0.base_19| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1611~0.base_19|) |v_ULTIMATE.start_main_~#t1611~0.offset_14| 0)) |v_#memory_int_15|) (= 0 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard1~0_11 0) (= v_~y$r_buff0_thd1~0_19 0) (= v_~y$r_buff0_thd2~0_26 0) (= 0 v_~y$w_buff1~0_25) (= 0 v_~y$w_buff0~0_28) (= 0 |v_ULTIMATE.start_main_~#t1611~0.offset_14|) (= 0 v_~x~0_9) (= 0 v_~weak$$choice2~0_32) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~y$r_buff1_thd0~0_46) (= v_~y$mem_tmp~0_11 0) (= v_~y~0_28 0) (= |v_#valid_40| (store .cse0 |v_ULTIMATE.start_main_~#t1611~0.base_19| 1)) (= 0 v_~weak$$choice0~0_7) (= v_~y$r_buff0_thd0~0_78 0) (= 0 v_~y$r_buff1_thd1~0_18) (= v_~y$w_buff0_used~0_106 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1611~0.base_19| 4)) (= |v_#NULL.offset_5| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1611~0.base_19|) (= 0 v_~z~0_9) (= v_~y$w_buff1_used~0_64 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= (select .cse0 |v_ULTIMATE.start_main_~#t1611~0.base_19|) 0) (= 0 v_~y$r_buff1_thd2~0_16) (= 0 |v_#NULL.base_5|) (= v_~__unbuffered_p1_EBX~0_10 0) (< 0 |v_#StackHeapBarrier_13|) (= 0 v_~y$flush_delayed~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_14|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t1611~0.base=|v_ULTIMATE.start_main_~#t1611~0.base_19|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_9|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_9|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_14|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_19, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, #length=|v_#length_15|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_12|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_7|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_12|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_46, ~x~0=v_~x~0_9, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_~#t1611~0.offset=|v_ULTIMATE.start_main_~#t1611~0.offset_14|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_18, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_12|, ~y$w_buff0~0=v_~y$w_buff0~0_28, ~y~0=v_~y~0_28, ULTIMATE.start_main_~#t1612~0.base=|v_ULTIMATE.start_main_~#t1612~0.base_16|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_11|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_9|, ULTIMATE.start_main_~#t1612~0.offset=|v_ULTIMATE.start_main_~#t1612~0.offset_13|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_11|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_78, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_64} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_~#t1611~0.base, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1611~0.offset, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_~#t1612~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_~#t1612~0.offset, 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, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:59:42,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L789-1-->L791: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1612~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1612~0.base_11|) |v_ULTIMATE.start_main_~#t1612~0.offset_10| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1612~0.base_11|)) (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1612~0.base_11| 1) |v_#valid_23|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1612~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t1612~0.base_11| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1612~0.base_11|) (= |v_ULTIMATE.start_main_~#t1612~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1612~0.base=|v_ULTIMATE.start_main_~#t1612~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1612~0.offset=|v_ULTIMATE.start_main_~#t1612~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1612~0.base, ULTIMATE.start_main_~#t1612~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-18 21:59:42,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] P1ENTRY-->L4-3: Formula: (and (= (mod v_~y$w_buff1_used~0_43 256) 0) (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= 1 v_~y$w_buff0_used~0_73) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= v_~y$w_buff0~0_16 v_~y$w_buff1~0_15) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= v_~y$w_buff1_used~0_43 v_~y$w_buff0_used~0_74) (= 2 v_~y$w_buff0~0_15)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_74, ~y$w_buff0~0=v_~y$w_buff0~0_16, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_73, ~y$w_buff1~0=v_~y$w_buff1~0_15, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~y$w_buff0~0=v_~y$w_buff0~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_43} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:59:42,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L732-2-->L732-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out206079108| |P0Thread1of1ForFork0_#t~ite3_Out206079108|)) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In206079108 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In206079108 256)))) (or (and (= ~y$w_buff1~0_In206079108 |P0Thread1of1ForFork0_#t~ite3_Out206079108|) .cse0 (not .cse1) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= ~y~0_In206079108 |P0Thread1of1ForFork0_#t~ite3_Out206079108|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In206079108, ~y$w_buff1~0=~y$w_buff1~0_In206079108, ~y~0=~y~0_In206079108, ~y$w_buff1_used~0=~y$w_buff1_used~0_In206079108} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In206079108, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out206079108|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out206079108|, ~y$w_buff1~0=~y$w_buff1~0_In206079108, ~y~0=~y~0_In206079108, ~y$w_buff1_used~0=~y$w_buff1_used~0_In206079108} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 21:59:42,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L733-->L733-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-583917700 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-583917700 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-583917700| ~y$w_buff0_used~0_In-583917700) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-583917700| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-583917700, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-583917700} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-583917700|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-583917700, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-583917700} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 21:59:42,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L734-->L734-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-483137034 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-483137034 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-483137034 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In-483137034 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-483137034 |P0Thread1of1ForFork0_#t~ite6_Out-483137034|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-483137034| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-483137034, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-483137034, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-483137034, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-483137034} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-483137034|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-483137034, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-483137034, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-483137034, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-483137034} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 21:59:42,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L735-->L735-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-749518112 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-749518112 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-749518112|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In-749518112 |P0Thread1of1ForFork0_#t~ite7_Out-749518112|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-749518112, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-749518112} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-749518112, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-749518112|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-749518112} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 21:59:42,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L736-->L736-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In319157681 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In319157681 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In319157681 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In319157681 256) 0))) (or (and (= ~y$r_buff1_thd1~0_In319157681 |P0Thread1of1ForFork0_#t~ite8_Out319157681|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out319157681| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In319157681, ~y$w_buff0_used~0=~y$w_buff0_used~0_In319157681, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In319157681, ~y$w_buff1_used~0=~y$w_buff1_used~0_In319157681} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In319157681, ~y$w_buff0_used~0=~y$w_buff0_used~0_In319157681, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out319157681|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In319157681, ~y$w_buff1_used~0=~y$w_buff1_used~0_In319157681} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 21:59:42,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L736-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_14, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 21:59:42,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-969202073 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-969202073 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-969202073 |P1Thread1of1ForFork1_#t~ite11_Out-969202073|)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-969202073| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-969202073, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-969202073} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-969202073, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-969202073, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-969202073|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 21:59:42,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In407359450 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In407359450 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In407359450 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In407359450 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out407359450| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite12_Out407359450| ~y$w_buff1_used~0_In407359450) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In407359450, ~y$w_buff0_used~0=~y$w_buff0_used~0_In407359450, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In407359450, ~y$w_buff1_used~0=~y$w_buff1_used~0_In407359450} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In407359450, ~y$w_buff0_used~0=~y$w_buff0_used~0_In407359450, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In407359450, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out407359450|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In407359450} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 21:59:42,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L769-->L770: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1664297081 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1664297081 256)))) (or (and (= ~y$r_buff0_thd2~0_In1664297081 ~y$r_buff0_thd2~0_Out1664297081) (or .cse0 .cse1)) (and (not .cse1) (= 0 ~y$r_buff0_thd2~0_Out1664297081) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1664297081, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1664297081} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1664297081, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1664297081, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1664297081|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 21:59:42,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1940748725 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1940748725 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1940748725 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1940748725 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1940748725|)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out1940748725| ~y$r_buff1_thd2~0_In1940748725) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1940748725, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1940748725, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1940748725, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1940748725} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1940748725, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1940748725, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1940748725, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1940748725|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1940748725} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 21:59:42,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 21:59:42,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L795-->L797-2: Formula: (and (or (= (mod v_~y$r_buff0_thd0~0_68 256) 0) (= 0 (mod v_~y$w_buff0_used~0_94 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_68, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_68, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 21:59:42,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L797-2-->L797-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In167117990 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In167117990 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite17_Out167117990| ~y$w_buff1~0_In167117990) (not .cse1)) (and (= ~y~0_In167117990 |ULTIMATE.start_main_#t~ite17_Out167117990|) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In167117990, ~y~0=~y~0_In167117990, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In167117990, ~y$w_buff1_used~0=~y$w_buff1_used~0_In167117990} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out167117990|, ~y$w_buff1~0=~y$w_buff1~0_In167117990, ~y~0=~y~0_In167117990, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In167117990, ~y$w_buff1_used~0=~y$w_buff1_used~0_In167117990} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-18 21:59:42,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [619] [619] L797-4-->L798: Formula: (= v_~y~0_20 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|, ~y~0=v_~y~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~y~0] because there is no mapped edge [2019-12-18 21:59:42,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1231887586 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1231887586 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite19_Out-1231887586|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1231887586 |ULTIMATE.start_main_#t~ite19_Out-1231887586|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1231887586, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1231887586} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1231887586, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1231887586|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1231887586} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 21:59:42,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1908166406 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1908166406 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1908166406 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1908166406 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1908166406 |ULTIMATE.start_main_#t~ite20_Out-1908166406|)) (and (= 0 |ULTIMATE.start_main_#t~ite20_Out-1908166406|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1908166406, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1908166406, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1908166406, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1908166406} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1908166406, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1908166406, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1908166406|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1908166406, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1908166406} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:59:42,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-152034907 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-152034907 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out-152034907|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In-152034907 |ULTIMATE.start_main_#t~ite21_Out-152034907|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-152034907, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-152034907} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-152034907, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-152034907, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-152034907|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:59:42,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In862057051 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In862057051 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In862057051 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In862057051 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite22_Out862057051| ~y$r_buff1_thd0~0_In862057051)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out862057051| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In862057051, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In862057051, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In862057051, ~y$w_buff1_used~0=~y$w_buff1_used~0_In862057051} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In862057051, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In862057051, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In862057051, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out862057051|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In862057051} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:59:42,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L812-->L812-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1095717682 256)))) (or (and (= ~y$w_buff1_used~0_In1095717682 |ULTIMATE.start_main_#t~ite38_Out1095717682|) (= |ULTIMATE.start_main_#t~ite37_In1095717682| |ULTIMATE.start_main_#t~ite37_Out1095717682|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1095717682 256)))) (or (and (= (mod ~y$w_buff1_used~0_In1095717682 256) 0) .cse1) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In1095717682 256) 0)) (= (mod ~y$w_buff0_used~0_In1095717682 256) 0))) (= |ULTIMATE.start_main_#t~ite37_Out1095717682| |ULTIMATE.start_main_#t~ite38_Out1095717682|) .cse0 (= ~y$w_buff1_used~0_In1095717682 |ULTIMATE.start_main_#t~ite37_Out1095717682|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1095717682, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1095717682, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In1095717682|, ~weak$$choice2~0=~weak$$choice2~0_In1095717682, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1095717682, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1095717682} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1095717682, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1095717682, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1095717682|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1095717682|, ~weak$$choice2~0=~weak$$choice2~0_In1095717682, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1095717682, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1095717682} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 21:59:42,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [607] [607] L813-->L814: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_20 256))) (= v_~y$r_buff0_thd0~0_56 v_~y$r_buff0_thd0~0_55)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_56, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_6|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_55, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-18 21:59:42,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L816-->L819-1: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= v_~y~0_23 v_~y$mem_tmp~0_7) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= 0 (mod v_~y$flush_delayed~0_11 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~y~0=v_~y~0_23, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:59:42,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L819-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 21:59:42,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:59:42 BasicIcfg [2019-12-18 21:59:42,877 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:59:42,880 INFO L168 Benchmark]: Toolchain (without parser) took 15402.69 ms. Allocated memory was 137.9 MB in the beginning and 707.3 MB in the end (delta: 569.4 MB). Free memory was 100.3 MB in the beginning and 146.0 MB in the end (delta: -45.7 MB). Peak memory consumption was 523.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:59:42,881 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 21:59:42,882 INFO L168 Benchmark]: CACSL2BoogieTranslator took 814.64 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 99.9 MB in the beginning and 156.5 MB in the end (delta: -56.6 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:59:42,882 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.29 ms. Allocated memory is still 202.9 MB. Free memory was 156.5 MB in the beginning and 153.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:59:42,887 INFO L168 Benchmark]: Boogie Preprocessor took 40.25 ms. Allocated memory is still 202.9 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:59:42,888 INFO L168 Benchmark]: RCFGBuilder took 783.79 ms. Allocated memory is still 202.9 MB. Free memory was 151.1 MB in the beginning and 107.0 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:59:42,888 INFO L168 Benchmark]: TraceAbstraction took 13687.07 ms. Allocated memory was 202.9 MB in the beginning and 707.3 MB in the end (delta: 504.4 MB). Free memory was 106.3 MB in the beginning and 146.0 MB in the end (delta: -39.7 MB). Peak memory consumption was 464.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:59:42,896 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.53 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 814.64 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 99.9 MB in the beginning and 156.5 MB in the end (delta: -56.6 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.29 ms. Allocated memory is still 202.9 MB. Free memory was 156.5 MB in the beginning and 153.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.25 ms. Allocated memory is still 202.9 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 783.79 ms. Allocated memory is still 202.9 MB. Free memory was 151.1 MB in the beginning and 107.0 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13687.07 ms. Allocated memory was 202.9 MB in the beginning and 707.3 MB in the end (delta: 504.4 MB). Free memory was 106.3 MB in the beginning and 146.0 MB in the end (delta: -39.7 MB). Peak memory consumption was 464.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 148 ProgramPointsBefore, 81 ProgramPointsAfterwards, 182 TransitionsBefore, 94 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 24 ChoiceCompositions, 3553 VarBasedMoverChecksPositive, 149 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49437 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L789] FCALL, FORK 0 pthread_create(&t1611, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK 0 pthread_create(&t1612, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L751] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L752] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L753] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L754] 2 y$r_buff0_thd2 = (_Bool)1 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 1 x = 1 [L729] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L734] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L735] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L766] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L800] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 y$flush_delayed = weak$$choice2 [L807] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L809] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L810] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L811] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L812] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.4s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1560 SDtfs, 1667 SDslu, 3370 SDs, 0 SdLazy, 1968 SolverSat, 138 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 14 SyntacticMatches, 8 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14086occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 11238 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 482 NumberOfCodeBlocks, 482 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 415 ConstructedInterpolants, 0 QuantifiedInterpolants, 73830 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...