/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/mix042_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:29:52,171 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:29:52,174 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:29:52,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:29:52,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:29:52,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:29:52,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:29:52,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:29:52,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:29:52,215 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:29:52,217 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:29:52,219 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:29:52,219 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:29:52,222 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:29:52,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:29:52,226 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:29:52,227 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:29:52,229 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:29:52,231 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:29:52,236 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:29:52,240 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:29:52,245 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:29:52,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:29:52,247 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:29:52,249 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:29:52,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:29:52,250 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:29:52,251 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:29:52,253 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:29:52,254 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:29:52,254 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:29:52,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:29:52,255 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:29:52,257 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:29:52,258 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:29:52,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:29:52,259 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:29:52,259 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:29:52,259 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:29:52,260 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:29:52,261 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:29:52,262 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-27 06:29:52,295 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:29:52,295 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:29:52,298 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:29:52,299 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:29:52,299 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:29:52,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:29:52,299 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:29:52,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:29:52,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:29:52,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:29:52,303 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:29:52,303 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:29:52,304 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:29:52,304 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:29:52,304 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:29:52,304 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:29:52,304 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:29:52,305 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:29:52,305 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:29:52,305 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:29:52,305 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:29:52,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:29:52,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:29:52,306 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:29:52,306 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:29:52,307 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:29:52,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:29:52,307 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:29:52,307 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:29:52,307 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:29:52,602 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:29:52,618 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:29:52,621 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:29:52,622 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:29:52,623 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:29:52,624 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_rmo.opt.i [2019-12-27 06:29:52,702 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/890185a35/4ee8c3d3a2d944809af325ba55cc22a2/FLAGc1b0e704a [2019-12-27 06:29:53,302 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:29:53,303 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_rmo.opt.i [2019-12-27 06:29:53,332 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/890185a35/4ee8c3d3a2d944809af325ba55cc22a2/FLAGc1b0e704a [2019-12-27 06:29:53,515 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/890185a35/4ee8c3d3a2d944809af325ba55cc22a2 [2019-12-27 06:29:53,523 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:29:53,525 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:29:53,526 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:29:53,526 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:29:53,530 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:29:53,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:29:53" (1/1) ... [2019-12-27 06:29:53,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eb22c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:53, skipping insertion in model container [2019-12-27 06:29:53,535 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:29:53" (1/1) ... [2019-12-27 06:29:53,544 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:29:53,607 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:29:54,146 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:29:54,159 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:29:54,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:29:54,309 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:29:54,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:54 WrapperNode [2019-12-27 06:29:54,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:29:54,310 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:29:54,311 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:29:54,311 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:29:54,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:54" (1/1) ... [2019-12-27 06:29:54,367 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:54" (1/1) ... [2019-12-27 06:29:54,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:29:54,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:29:54,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:29:54,427 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:29:54,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:54" (1/1) ... [2019-12-27 06:29:54,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:54" (1/1) ... [2019-12-27 06:29:54,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:54" (1/1) ... [2019-12-27 06:29:54,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:54" (1/1) ... [2019-12-27 06:29:54,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:54" (1/1) ... [2019-12-27 06:29:54,486 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:54" (1/1) ... [2019-12-27 06:29:54,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:54" (1/1) ... [2019-12-27 06:29:54,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:29:54,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:29:54,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:29:54,503 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:29:54,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:29:54,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:29:54,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:29:54,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:29:54,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:29:54,586 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:29:54,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:29:54,586 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:29:54,587 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:29:54,588 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:29:54,588 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:29:54,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:29:54,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:29:54,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:29:54,591 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:29:55,376 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:29:55,376 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:29:55,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:29:55 BoogieIcfgContainer [2019-12-27 06:29:55,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:29:55,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:29:55,380 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:29:55,383 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:29:55,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:29:53" (1/3) ... [2019-12-27 06:29:55,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a6af61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:29:55, skipping insertion in model container [2019-12-27 06:29:55,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:54" (2/3) ... [2019-12-27 06:29:55,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a6af61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:29:55, skipping insertion in model container [2019-12-27 06:29:55,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:29:55" (3/3) ... [2019-12-27 06:29:55,387 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_rmo.opt.i [2019-12-27 06:29:55,397 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:29:55,397 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:29:55,405 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:29:55,406 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:29:55,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,442 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,442 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,446 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,450 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,458 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,458 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,459 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,459 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,459 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,470 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,470 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,475 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,476 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,477 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,495 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,496 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:55,512 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:29:55,529 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:29:55,529 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:29:55,529 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:29:55,529 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:29:55,529 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:29:55,529 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:29:55,530 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:29:55,530 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:29:55,545 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-27 06:29:55,547 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-27 06:29:55,638 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-27 06:29:55,639 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:29:55,652 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 06:29:55,671 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-27 06:29:55,718 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-27 06:29:55,718 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:29:55,724 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 06:29:55,739 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 06:29:55,740 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:29:59,339 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 06:29:59,478 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 06:29:59,495 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50879 [2019-12-27 06:29:59,496 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 06:29:59,499 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 85 transitions [2019-12-27 06:30:00,429 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14254 states. [2019-12-27 06:30:00,431 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states. [2019-12-27 06:30:00,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 06:30:00,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:00,437 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:00,438 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:00,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:00,443 INFO L82 PathProgramCache]: Analyzing trace with hash -632784469, now seen corresponding path program 1 times [2019-12-27 06:30:00,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:00,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471413935] [2019-12-27 06:30:00,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:00,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:00,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471413935] [2019-12-27 06:30:00,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:00,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:30:00,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131100188] [2019-12-27 06:30:00,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:30:00,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:00,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:30:00,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:00,731 INFO L87 Difference]: Start difference. First operand 14254 states. Second operand 3 states. [2019-12-27 06:30:01,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:01,066 INFO L93 Difference]: Finished difference Result 14182 states and 52796 transitions. [2019-12-27 06:30:01,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:30:01,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 06:30:01,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:01,214 INFO L225 Difference]: With dead ends: 14182 [2019-12-27 06:30:01,214 INFO L226 Difference]: Without dead ends: 13870 [2019-12-27 06:30:01,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:01,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2019-12-27 06:30:01,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 13870. [2019-12-27 06:30:01,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13870 states. [2019-12-27 06:30:02,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13870 states to 13870 states and 51678 transitions. [2019-12-27 06:30:02,098 INFO L78 Accepts]: Start accepts. Automaton has 13870 states and 51678 transitions. Word has length 7 [2019-12-27 06:30:02,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:02,099 INFO L462 AbstractCegarLoop]: Abstraction has 13870 states and 51678 transitions. [2019-12-27 06:30:02,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:30:02,099 INFO L276 IsEmpty]: Start isEmpty. Operand 13870 states and 51678 transitions. [2019-12-27 06:30:02,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:30:02,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:02,105 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:02,106 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:02,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:02,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1056225825, now seen corresponding path program 1 times [2019-12-27 06:30:02,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:02,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342534969] [2019-12-27 06:30:02,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:02,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:02,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342534969] [2019-12-27 06:30:02,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:02,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:30:02,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770016091] [2019-12-27 06:30:02,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:30:02,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:02,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:30:02,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:30:02,214 INFO L87 Difference]: Start difference. First operand 13870 states and 51678 transitions. Second operand 4 states. [2019-12-27 06:30:03,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:03,402 INFO L93 Difference]: Finished difference Result 19034 states and 68884 transitions. [2019-12-27 06:30:03,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:30:03,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 06:30:03,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:03,481 INFO L225 Difference]: With dead ends: 19034 [2019-12-27 06:30:03,481 INFO L226 Difference]: Without dead ends: 19034 [2019-12-27 06:30:03,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:30:03,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19034 states. [2019-12-27 06:30:04,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19034 to 18800. [2019-12-27 06:30:04,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18800 states. [2019-12-27 06:30:04,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18800 states to 18800 states and 68123 transitions. [2019-12-27 06:30:04,235 INFO L78 Accepts]: Start accepts. Automaton has 18800 states and 68123 transitions. Word has length 13 [2019-12-27 06:30:04,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:04,235 INFO L462 AbstractCegarLoop]: Abstraction has 18800 states and 68123 transitions. [2019-12-27 06:30:04,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:30:04,236 INFO L276 IsEmpty]: Start isEmpty. Operand 18800 states and 68123 transitions. [2019-12-27 06:30:04,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:30:04,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:04,239 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:04,239 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:04,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:04,243 INFO L82 PathProgramCache]: Analyzing trace with hash 746093816, now seen corresponding path program 1 times [2019-12-27 06:30:04,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:04,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486661842] [2019-12-27 06:30:04,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:04,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:04,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486661842] [2019-12-27 06:30:04,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:04,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:30:04,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348702627] [2019-12-27 06:30:04,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:30:04,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:04,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:30:04,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:30:04,332 INFO L87 Difference]: Start difference. First operand 18800 states and 68123 transitions. Second operand 4 states. [2019-12-27 06:30:04,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:04,705 INFO L93 Difference]: Finished difference Result 27022 states and 95920 transitions. [2019-12-27 06:30:04,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:30:04,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 06:30:04,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:04,793 INFO L225 Difference]: With dead ends: 27022 [2019-12-27 06:30:04,793 INFO L226 Difference]: Without dead ends: 27008 [2019-12-27 06:30:04,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:30:05,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27008 states. [2019-12-27 06:30:05,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27008 to 22014. [2019-12-27 06:30:05,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22014 states. [2019-12-27 06:30:07,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22014 states to 22014 states and 79478 transitions. [2019-12-27 06:30:07,177 INFO L78 Accepts]: Start accepts. Automaton has 22014 states and 79478 transitions. Word has length 13 [2019-12-27 06:30:07,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:07,177 INFO L462 AbstractCegarLoop]: Abstraction has 22014 states and 79478 transitions. [2019-12-27 06:30:07,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:30:07,177 INFO L276 IsEmpty]: Start isEmpty. Operand 22014 states and 79478 transitions. [2019-12-27 06:30:07,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 06:30:07,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:07,186 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:07,186 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:07,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:07,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1347005908, now seen corresponding path program 1 times [2019-12-27 06:30:07,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:07,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609697835] [2019-12-27 06:30:07,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:07,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:07,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609697835] [2019-12-27 06:30:07,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:07,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:30:07,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720483131] [2019-12-27 06:30:07,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:30:07,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:07,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:30:07,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:30:07,353 INFO L87 Difference]: Start difference. First operand 22014 states and 79478 transitions. Second operand 5 states. [2019-12-27 06:30:07,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:07,945 INFO L93 Difference]: Finished difference Result 29780 states and 105415 transitions. [2019-12-27 06:30:07,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:30:07,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 06:30:07,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:08,032 INFO L225 Difference]: With dead ends: 29780 [2019-12-27 06:30:08,032 INFO L226 Difference]: Without dead ends: 29766 [2019-12-27 06:30:08,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:30:08,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29766 states. [2019-12-27 06:30:08,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29766 to 21918. [2019-12-27 06:30:08,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21918 states. [2019-12-27 06:30:08,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21918 states to 21918 states and 78970 transitions. [2019-12-27 06:30:08,787 INFO L78 Accepts]: Start accepts. Automaton has 21918 states and 78970 transitions. Word has length 19 [2019-12-27 06:30:08,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:08,788 INFO L462 AbstractCegarLoop]: Abstraction has 21918 states and 78970 transitions. [2019-12-27 06:30:08,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:30:08,788 INFO L276 IsEmpty]: Start isEmpty. Operand 21918 states and 78970 transitions. [2019-12-27 06:30:08,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:30:08,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:08,813 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] [2019-12-27 06:30:08,814 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:08,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:08,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1048489812, now seen corresponding path program 1 times [2019-12-27 06:30:08,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:08,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538339519] [2019-12-27 06:30:08,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:08,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:08,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538339519] [2019-12-27 06:30:08,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:08,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:30:08,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197590861] [2019-12-27 06:30:08,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:30:08,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:08,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:30:08,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:30:08,957 INFO L87 Difference]: Start difference. First operand 21918 states and 78970 transitions. Second operand 6 states. [2019-12-27 06:30:09,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:09,657 INFO L93 Difference]: Finished difference Result 32226 states and 113712 transitions. [2019-12-27 06:30:09,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:30:09,657 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 06:30:09,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:09,730 INFO L225 Difference]: With dead ends: 32226 [2019-12-27 06:30:09,730 INFO L226 Difference]: Without dead ends: 32194 [2019-12-27 06:30:09,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:30:09,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32194 states. [2019-12-27 06:30:10,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32194 to 27516. [2019-12-27 06:30:10,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27516 states. [2019-12-27 06:30:10,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27516 states to 27516 states and 97909 transitions. [2019-12-27 06:30:10,887 INFO L78 Accepts]: Start accepts. Automaton has 27516 states and 97909 transitions. Word has length 27 [2019-12-27 06:30:10,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:10,888 INFO L462 AbstractCegarLoop]: Abstraction has 27516 states and 97909 transitions. [2019-12-27 06:30:10,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:30:10,888 INFO L276 IsEmpty]: Start isEmpty. Operand 27516 states and 97909 transitions. [2019-12-27 06:30:10,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:30:10,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:10,923 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:10,923 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:10,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:10,924 INFO L82 PathProgramCache]: Analyzing trace with hash -386322379, now seen corresponding path program 1 times [2019-12-27 06:30:10,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:10,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592051614] [2019-12-27 06:30:10,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:10,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:10,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592051614] [2019-12-27 06:30:10,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:10,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:30:10,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768105461] [2019-12-27 06:30:10,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:30:10,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:10,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:30:10,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:10,989 INFO L87 Difference]: Start difference. First operand 27516 states and 97909 transitions. Second operand 3 states. [2019-12-27 06:30:11,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:11,158 INFO L93 Difference]: Finished difference Result 34788 states and 124357 transitions. [2019-12-27 06:30:11,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:30:11,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-27 06:30:11,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:11,248 INFO L225 Difference]: With dead ends: 34788 [2019-12-27 06:30:11,248 INFO L226 Difference]: Without dead ends: 34788 [2019-12-27 06:30:11,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:11,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34788 states. [2019-12-27 06:30:13,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34788 to 30668. [2019-12-27 06:30:13,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30668 states. [2019-12-27 06:30:13,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30668 states to 30668 states and 110245 transitions. [2019-12-27 06:30:13,224 INFO L78 Accepts]: Start accepts. Automaton has 30668 states and 110245 transitions. Word has length 33 [2019-12-27 06:30:13,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:13,224 INFO L462 AbstractCegarLoop]: Abstraction has 30668 states and 110245 transitions. [2019-12-27 06:30:13,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:30:13,224 INFO L276 IsEmpty]: Start isEmpty. Operand 30668 states and 110245 transitions. [2019-12-27 06:30:13,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:30:13,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:13,256 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:13,257 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:13,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:13,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1183375097, now seen corresponding path program 1 times [2019-12-27 06:30:13,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:13,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780424608] [2019-12-27 06:30:13,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:13,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:13,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780424608] [2019-12-27 06:30:13,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:13,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:30:13,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210667134] [2019-12-27 06:30:13,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:30:13,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:13,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:30:13,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:13,312 INFO L87 Difference]: Start difference. First operand 30668 states and 110245 transitions. Second operand 3 states. [2019-12-27 06:30:13,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:13,514 INFO L93 Difference]: Finished difference Result 30668 states and 109909 transitions. [2019-12-27 06:30:13,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:30:13,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-27 06:30:13,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:13,576 INFO L225 Difference]: With dead ends: 30668 [2019-12-27 06:30:13,576 INFO L226 Difference]: Without dead ends: 30668 [2019-12-27 06:30:13,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:13,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30668 states. [2019-12-27 06:30:14,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30668 to 30668. [2019-12-27 06:30:14,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30668 states. [2019-12-27 06:30:14,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30668 states to 30668 states and 109909 transitions. [2019-12-27 06:30:14,333 INFO L78 Accepts]: Start accepts. Automaton has 30668 states and 109909 transitions. Word has length 33 [2019-12-27 06:30:14,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:14,334 INFO L462 AbstractCegarLoop]: Abstraction has 30668 states and 109909 transitions. [2019-12-27 06:30:14,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:30:14,334 INFO L276 IsEmpty]: Start isEmpty. Operand 30668 states and 109909 transitions. [2019-12-27 06:30:14,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:30:14,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:14,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:14,361 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:14,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:14,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1422326855, now seen corresponding path program 1 times [2019-12-27 06:30:14,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:14,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494164457] [2019-12-27 06:30:14,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:14,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:14,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494164457] [2019-12-27 06:30:14,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:14,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:30:14,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839699061] [2019-12-27 06:30:14,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:30:14,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:14,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:30:14,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:30:14,460 INFO L87 Difference]: Start difference. First operand 30668 states and 109909 transitions. Second operand 7 states. [2019-12-27 06:30:15,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:15,551 INFO L93 Difference]: Finished difference Result 47574 states and 166546 transitions. [2019-12-27 06:30:15,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 06:30:15,551 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 06:30:15,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:15,637 INFO L225 Difference]: With dead ends: 47574 [2019-12-27 06:30:15,638 INFO L226 Difference]: Without dead ends: 47534 [2019-12-27 06:30:15,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:30:15,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47534 states. [2019-12-27 06:30:17,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47534 to 31416. [2019-12-27 06:30:17,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31416 states. [2019-12-27 06:30:17,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31416 states to 31416 states and 112497 transitions. [2019-12-27 06:30:17,638 INFO L78 Accepts]: Start accepts. Automaton has 31416 states and 112497 transitions. Word has length 33 [2019-12-27 06:30:17,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:17,639 INFO L462 AbstractCegarLoop]: Abstraction has 31416 states and 112497 transitions. [2019-12-27 06:30:17,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:30:17,639 INFO L276 IsEmpty]: Start isEmpty. Operand 31416 states and 112497 transitions. [2019-12-27 06:30:17,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:30:17,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:17,667 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:17,668 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:17,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:17,668 INFO L82 PathProgramCache]: Analyzing trace with hash 147370621, now seen corresponding path program 1 times [2019-12-27 06:30:17,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:17,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660411896] [2019-12-27 06:30:17,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:17,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:17,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660411896] [2019-12-27 06:30:17,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:17,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:30:17,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843695146] [2019-12-27 06:30:17,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:30:17,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:17,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:30:17,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:30:17,764 INFO L87 Difference]: Start difference. First operand 31416 states and 112497 transitions. Second operand 7 states. [2019-12-27 06:30:18,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:18,567 INFO L93 Difference]: Finished difference Result 44276 states and 155683 transitions. [2019-12-27 06:30:18,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:30:18,568 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 06:30:18,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:18,653 INFO L225 Difference]: With dead ends: 44276 [2019-12-27 06:30:18,653 INFO L226 Difference]: Without dead ends: 44250 [2019-12-27 06:30:18,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:30:18,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44250 states. [2019-12-27 06:30:19,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44250 to 35296. [2019-12-27 06:30:19,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35296 states. [2019-12-27 06:30:19,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35296 states to 35296 states and 125497 transitions. [2019-12-27 06:30:19,650 INFO L78 Accepts]: Start accepts. Automaton has 35296 states and 125497 transitions. Word has length 33 [2019-12-27 06:30:19,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:19,650 INFO L462 AbstractCegarLoop]: Abstraction has 35296 states and 125497 transitions. [2019-12-27 06:30:19,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:30:19,650 INFO L276 IsEmpty]: Start isEmpty. Operand 35296 states and 125497 transitions. [2019-12-27 06:30:19,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:30:19,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:19,676 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:19,677 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:19,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:19,677 INFO L82 PathProgramCache]: Analyzing trace with hash 528874148, now seen corresponding path program 1 times [2019-12-27 06:30:19,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:19,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141153004] [2019-12-27 06:30:19,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:19,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:19,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141153004] [2019-12-27 06:30:19,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:19,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:30:19,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022834805] [2019-12-27 06:30:19,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:30:19,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:19,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:30:19,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:30:19,761 INFO L87 Difference]: Start difference. First operand 35296 states and 125497 transitions. Second operand 4 states. [2019-12-27 06:30:19,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:19,865 INFO L93 Difference]: Finished difference Result 20235 states and 61968 transitions. [2019-12-27 06:30:19,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:30:19,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-27 06:30:19,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:19,897 INFO L225 Difference]: With dead ends: 20235 [2019-12-27 06:30:19,897 INFO L226 Difference]: Without dead ends: 19705 [2019-12-27 06:30:19,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:30:19,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19705 states. [2019-12-27 06:30:20,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19705 to 19705. [2019-12-27 06:30:20,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19705 states. [2019-12-27 06:30:20,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19705 states to 19705 states and 60462 transitions. [2019-12-27 06:30:20,596 INFO L78 Accepts]: Start accepts. Automaton has 19705 states and 60462 transitions. Word has length 33 [2019-12-27 06:30:20,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:20,597 INFO L462 AbstractCegarLoop]: Abstraction has 19705 states and 60462 transitions. [2019-12-27 06:30:20,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:30:20,597 INFO L276 IsEmpty]: Start isEmpty. Operand 19705 states and 60462 transitions. [2019-12-27 06:30:20,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 06:30:20,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:20,609 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:20,609 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:20,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:20,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1883155701, now seen corresponding path program 1 times [2019-12-27 06:30:20,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:20,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672906534] [2019-12-27 06:30:20,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:20,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:20,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672906534] [2019-12-27 06:30:20,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:20,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:30:20,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955371933] [2019-12-27 06:30:20,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:30:20,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:20,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:30:20,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:30:20,681 INFO L87 Difference]: Start difference. First operand 19705 states and 60462 transitions. Second operand 5 states. [2019-12-27 06:30:20,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:20,725 INFO L93 Difference]: Finished difference Result 2732 states and 6358 transitions. [2019-12-27 06:30:20,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:30:20,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-27 06:30:20,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:20,729 INFO L225 Difference]: With dead ends: 2732 [2019-12-27 06:30:20,729 INFO L226 Difference]: Without dead ends: 2423 [2019-12-27 06:30:20,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:30:20,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2019-12-27 06:30:20,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 2423. [2019-12-27 06:30:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2423 states. [2019-12-27 06:30:20,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 5497 transitions. [2019-12-27 06:30:20,769 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 5497 transitions. Word has length 34 [2019-12-27 06:30:20,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:20,770 INFO L462 AbstractCegarLoop]: Abstraction has 2423 states and 5497 transitions. [2019-12-27 06:30:20,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:30:20,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 5497 transitions. [2019-12-27 06:30:20,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 06:30:20,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:20,774 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:20,775 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:20,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:20,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1551487306, now seen corresponding path program 1 times [2019-12-27 06:30:20,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:20,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765863157] [2019-12-27 06:30:20,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:20,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765863157] [2019-12-27 06:30:20,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:20,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:30:20,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028539956] [2019-12-27 06:30:20,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:30:20,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:20,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:30:20,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:30:20,952 INFO L87 Difference]: Start difference. First operand 2423 states and 5497 transitions. Second operand 6 states. [2019-12-27 06:30:21,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:21,032 INFO L93 Difference]: Finished difference Result 706 states and 1597 transitions. [2019-12-27 06:30:21,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:30:21,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-12-27 06:30:21,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:21,034 INFO L225 Difference]: With dead ends: 706 [2019-12-27 06:30:21,034 INFO L226 Difference]: Without dead ends: 660 [2019-12-27 06:30:21,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:30:21,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-12-27 06:30:21,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 604. [2019-12-27 06:30:21,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-27 06:30:21,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1375 transitions. [2019-12-27 06:30:21,043 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1375 transitions. Word has length 45 [2019-12-27 06:30:21,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:21,044 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1375 transitions. [2019-12-27 06:30:21,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:30:21,044 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1375 transitions. [2019-12-27 06:30:21,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 06:30:21,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:21,046 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:21,046 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:21,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:21,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1913212359, now seen corresponding path program 1 times [2019-12-27 06:30:21,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:21,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128345220] [2019-12-27 06:30:21,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:21,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:21,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128345220] [2019-12-27 06:30:21,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:21,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:30:21,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053584309] [2019-12-27 06:30:21,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:30:21,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:21,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:30:21,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:30:21,148 INFO L87 Difference]: Start difference. First operand 604 states and 1375 transitions. Second operand 5 states. [2019-12-27 06:30:21,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:21,331 INFO L93 Difference]: Finished difference Result 875 states and 2004 transitions. [2019-12-27 06:30:21,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:30:21,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-27 06:30:21,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:21,332 INFO L225 Difference]: With dead ends: 875 [2019-12-27 06:30:21,333 INFO L226 Difference]: Without dead ends: 875 [2019-12-27 06:30:21,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:30:21,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2019-12-27 06:30:21,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 640. [2019-12-27 06:30:21,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-12-27 06:30:21,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1467 transitions. [2019-12-27 06:30:21,344 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1467 transitions. Word has length 56 [2019-12-27 06:30:21,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:21,344 INFO L462 AbstractCegarLoop]: Abstraction has 640 states and 1467 transitions. [2019-12-27 06:30:21,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:30:21,344 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1467 transitions. [2019-12-27 06:30:21,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 06:30:21,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:21,346 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:21,346 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:21,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:21,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1265963483, now seen corresponding path program 2 times [2019-12-27 06:30:21,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:21,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666507831] [2019-12-27 06:30:21,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:21,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:21,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666507831] [2019-12-27 06:30:21,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:21,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:30:21,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111140588] [2019-12-27 06:30:21,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:30:21,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:21,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:30:21,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:21,452 INFO L87 Difference]: Start difference. First operand 640 states and 1467 transitions. Second operand 3 states. [2019-12-27 06:30:21,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:21,466 INFO L93 Difference]: Finished difference Result 640 states and 1437 transitions. [2019-12-27 06:30:21,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:30:21,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 06:30:21,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:21,468 INFO L225 Difference]: With dead ends: 640 [2019-12-27 06:30:21,468 INFO L226 Difference]: Without dead ends: 640 [2019-12-27 06:30:21,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:21,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-12-27 06:30:21,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 604. [2019-12-27 06:30:21,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-27 06:30:21,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1351 transitions. [2019-12-27 06:30:21,478 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1351 transitions. Word has length 56 [2019-12-27 06:30:21,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:21,478 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1351 transitions. [2019-12-27 06:30:21,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:30:21,479 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1351 transitions. [2019-12-27 06:30:21,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:30:21,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:21,480 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:21,480 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:21,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:21,480 INFO L82 PathProgramCache]: Analyzing trace with hash 748257012, now seen corresponding path program 1 times [2019-12-27 06:30:21,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:21,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822740514] [2019-12-27 06:30:21,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:21,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:21,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822740514] [2019-12-27 06:30:21,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:21,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:30:21,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495662189] [2019-12-27 06:30:21,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:30:21,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:21,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:30:21,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:30:21,669 INFO L87 Difference]: Start difference. First operand 604 states and 1351 transitions. Second operand 6 states. [2019-12-27 06:30:21,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:21,727 INFO L93 Difference]: Finished difference Result 878 states and 1819 transitions. [2019-12-27 06:30:21,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:30:21,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-27 06:30:21,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:21,728 INFO L225 Difference]: With dead ends: 878 [2019-12-27 06:30:21,728 INFO L226 Difference]: Without dead ends: 542 [2019-12-27 06:30:21,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:30:21,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-12-27 06:30:21,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2019-12-27 06:30:21,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-12-27 06:30:21,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1172 transitions. [2019-12-27 06:30:21,739 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1172 transitions. Word has length 57 [2019-12-27 06:30:21,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:21,739 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 1172 transitions. [2019-12-27 06:30:21,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:30:21,739 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1172 transitions. [2019-12-27 06:30:21,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:30:21,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:21,740 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:21,741 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:21,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:21,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1731614154, now seen corresponding path program 2 times [2019-12-27 06:30:21,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:21,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79814336] [2019-12-27 06:30:21,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:22,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:22,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79814336] [2019-12-27 06:30:22,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:22,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 06:30:22,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382512488] [2019-12-27 06:30:22,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 06:30:22,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:22,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 06:30:22,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-27 06:30:22,311 INFO L87 Difference]: Start difference. First operand 542 states and 1172 transitions. Second operand 18 states. [2019-12-27 06:30:23,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:23,656 INFO L93 Difference]: Finished difference Result 1303 states and 2895 transitions. [2019-12-27 06:30:23,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 06:30:23,657 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2019-12-27 06:30:23,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:23,659 INFO L225 Difference]: With dead ends: 1303 [2019-12-27 06:30:23,659 INFO L226 Difference]: Without dead ends: 1273 [2019-12-27 06:30:23,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=209, Invalid=1051, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 06:30:23,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2019-12-27 06:30:23,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 724. [2019-12-27 06:30:23,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-12-27 06:30:23,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1572 transitions. [2019-12-27 06:30:23,671 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1572 transitions. Word has length 57 [2019-12-27 06:30:23,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:23,672 INFO L462 AbstractCegarLoop]: Abstraction has 724 states and 1572 transitions. [2019-12-27 06:30:23,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 06:30:23,672 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1572 transitions. [2019-12-27 06:30:23,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:30:23,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:23,673 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:23,674 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:23,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:23,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1334743882, now seen corresponding path program 3 times [2019-12-27 06:30:23,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:23,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807821234] [2019-12-27 06:30:23,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:23,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:23,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807821234] [2019-12-27 06:30:23,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:23,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 06:30:23,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181013010] [2019-12-27 06:30:23,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 06:30:23,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:23,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 06:30:23,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:30:23,963 INFO L87 Difference]: Start difference. First operand 724 states and 1572 transitions. Second operand 13 states. [2019-12-27 06:30:24,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:24,508 INFO L93 Difference]: Finished difference Result 1170 states and 2544 transitions. [2019-12-27 06:30:24,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 06:30:24,509 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 06:30:24,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:24,511 INFO L225 Difference]: With dead ends: 1170 [2019-12-27 06:30:24,511 INFO L226 Difference]: Without dead ends: 1140 [2019-12-27 06:30:24,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2019-12-27 06:30:24,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2019-12-27 06:30:24,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 784. [2019-12-27 06:30:24,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-12-27 06:30:24,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1718 transitions. [2019-12-27 06:30:24,521 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1718 transitions. Word has length 57 [2019-12-27 06:30:24,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:24,521 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1718 transitions. [2019-12-27 06:30:24,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 06:30:24,521 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1718 transitions. [2019-12-27 06:30:24,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:30:24,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:24,522 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:24,522 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:24,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:24,522 INFO L82 PathProgramCache]: Analyzing trace with hash -778309658, now seen corresponding path program 4 times [2019-12-27 06:30:24,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:24,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445985134] [2019-12-27 06:30:24,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:24,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:24,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445985134] [2019-12-27 06:30:24,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:24,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 06:30:24,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529229950] [2019-12-27 06:30:24,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 06:30:24,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:24,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 06:30:24,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:30:24,804 INFO L87 Difference]: Start difference. First operand 784 states and 1718 transitions. Second operand 14 states. [2019-12-27 06:30:25,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:25,444 INFO L93 Difference]: Finished difference Result 1158 states and 2512 transitions. [2019-12-27 06:30:25,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 06:30:25,444 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-12-27 06:30:25,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:25,446 INFO L225 Difference]: With dead ends: 1158 [2019-12-27 06:30:25,446 INFO L226 Difference]: Without dead ends: 1128 [2019-12-27 06:30:25,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:30:25,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2019-12-27 06:30:25,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 780. [2019-12-27 06:30:25,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-12-27 06:30:25,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1708 transitions. [2019-12-27 06:30:25,458 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1708 transitions. Word has length 57 [2019-12-27 06:30:25,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:25,458 INFO L462 AbstractCegarLoop]: Abstraction has 780 states and 1708 transitions. [2019-12-27 06:30:25,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 06:30:25,458 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1708 transitions. [2019-12-27 06:30:25,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:30:25,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:25,459 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:25,459 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:25,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:25,460 INFO L82 PathProgramCache]: Analyzing trace with hash -109693258, now seen corresponding path program 5 times [2019-12-27 06:30:25,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:25,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384338676] [2019-12-27 06:30:25,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:30:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:30:25,566 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:30:25,567 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:30:25,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] ULTIMATE.startENTRY-->L812: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= 0 v_~y$r_buff1_thd3~0_21) (= v_~main$tmp_guard0~0_10 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_~y$w_buff1_used~0_72 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1120~0.base_27|) (= 0 |v_ULTIMATE.start_main_~#t1120~0.offset_21|) (= 0 v_~y$w_buff1~0_27) (= 0 v_~weak$$choice0~0_9) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$r_buff0_thd1~0_11 0) (= v_~__unbuffered_p2_EBX~0_10 0) (= v_~a~0_11 0) (= v_~z~0_11 0) (= v_~main$tmp_guard1~0_11 0) (= v_~y$read_delayed~0_8 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1120~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1120~0.base_27|) |v_ULTIMATE.start_main_~#t1120~0.offset_21| 0)) |v_#memory_int_15|) (= v_~y$w_buff0_used~0_108 0) (= 0 v_~x~0_9) (= 0 v_~y$r_buff1_thd1~0_10) (= v_~y$r_buff0_thd3~0_28 0) (= 0 v_~y$r_buff1_thd2~0_21) (= v_~y$mem_tmp~0_11 0) (= v_~y$r_buff0_thd0~0_85 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (< 0 |v_#StackHeapBarrier_14|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1120~0.base_27|) 0) (= 0 v_~weak$$choice2~0_35) (= |v_#NULL.offset_5| 0) (= 0 v_~y$w_buff0~0_27) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1120~0.base_27| 4) |v_#length_19|) (= 0 v_~y$read_delayed_var~0.base_8) (= (store .cse0 |v_ULTIMATE.start_main_~#t1120~0.base_27| 1) |v_#valid_54|) (= v_~y~0_26 0) (= 0 v_~__unbuffered_cnt~0_18) (= v_~y$r_buff0_thd2~0_22 0) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_16) (= 0 v_~y$r_buff1_thd0~0_53))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_14|, ULTIMATE.start_main_~#t1121~0.base=|v_ULTIMATE.start_main_~#t1121~0.base_26|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_13|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_11|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_16|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_9|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_~#t1122~0.base=|v_ULTIMATE.start_main_~#t1122~0.base_21|, 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_13|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_53, ~x~0=v_~x~0_9, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ULTIMATE.start_main_~#t1120~0.offset=|v_ULTIMATE.start_main_~#t1120~0.offset_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_16|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_14|, ~y$w_buff0~0=v_~y$w_buff0~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_28, ~y~0=v_~y~0_26, ULTIMATE.start_main_~#t1122~0.offset=|v_ULTIMATE.start_main_~#t1122~0.offset_16|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_14|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_16|, #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_21, ULTIMATE.start_main_~#t1120~0.base=|v_ULTIMATE.start_main_~#t1120~0.base_27|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_~#t1121~0.offset=|v_ULTIMATE.start_main_~#t1121~0.offset_20|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_85, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_72} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1121~0.base, #NULL.offset, 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, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t1122~0.base, 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, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t1120~0.offset, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t1122~0.offset, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, 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_~#t1120~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1121~0.offset, 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-27 06:30:25,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L812-1-->L814: Formula: (and (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1121~0.base_9| 1) |v_#valid_27|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1121~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1121~0.base_9|) |v_ULTIMATE.start_main_~#t1121~0.offset_8| 1)) |v_#memory_int_9|) (= 0 |v_ULTIMATE.start_main_~#t1121~0.offset_8|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1121~0.base_9| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1121~0.base_9|) (not (= |v_ULTIMATE.start_main_~#t1121~0.base_9| 0)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1121~0.base_9|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1121~0.offset=|v_ULTIMATE.start_main_~#t1121~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1121~0.base=|v_ULTIMATE.start_main_~#t1121~0.base_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1121~0.offset, ULTIMATE.start_main_~#t1121~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 06:30:25,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L816: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1122~0.base_10| 4) |v_#length_15|) (= 0 |v_ULTIMATE.start_main_~#t1122~0.offset_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1122~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1122~0.base_10|) |v_ULTIMATE.start_main_~#t1122~0.offset_10| 2)) |v_#memory_int_11|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t1122~0.base_10|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1122~0.base_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1122~0.base_10|)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t1122~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1122~0.offset=|v_ULTIMATE.start_main_~#t1122~0.offset_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1122~0.base=|v_ULTIMATE.start_main_~#t1122~0.base_10|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1122~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1122~0.base, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-27 06:30:25,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L4-->L789: Formula: (and (= ~a~0_In1075898824 ~__unbuffered_p2_EBX~0_Out1075898824) (= ~y$r_buff1_thd1~0_Out1075898824 ~y$r_buff0_thd1~0_In1075898824) (= ~z~0_Out1075898824 1) (= ~z~0_Out1075898824 ~__unbuffered_p2_EAX~0_Out1075898824) (= ~y$r_buff0_thd3~0_In1075898824 ~y$r_buff1_thd3~0_Out1075898824) (not (= 0 P2Thread1of1ForFork1___VERIFIER_assert_~expression_In1075898824)) (= ~y$r_buff0_thd3~0_Out1075898824 1) (= ~y$r_buff1_thd2~0_Out1075898824 ~y$r_buff0_thd2~0_In1075898824) (= ~y$r_buff0_thd0~0_In1075898824 ~y$r_buff1_thd0~0_Out1075898824)) InVars {~a~0=~a~0_In1075898824, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1075898824, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1075898824, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1075898824, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1075898824, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In1075898824} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out1075898824, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In1075898824, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1075898824, ~a~0=~a~0_In1075898824, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1075898824, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out1075898824, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1075898824, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1075898824, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1075898824, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1075898824, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out1075898824, ~z~0=~z~0_Out1075898824, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1075898824} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 06:30:25,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork2_~arg.base_4 |v_P0Thread1of1ForFork2_#in~arg.base_4|) (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= 1 v_~a~0_6) (= v_~__unbuffered_p0_EAX~0_4 v_~x~0_5) (= v_P0Thread1of1ForFork2_~arg.offset_4 |v_P0Thread1of1ForFork2_#in~arg.offset_4|) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|, ~x~0=v_~x~0_5} OutVars{~a~0=v_~a~0_6, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_4, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_4, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_5, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_4} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 06:30:25,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L754-2-->L754-5: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1009786003 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In1009786003 256) 0)) (.cse0 (= |P1Thread1of1ForFork0_#t~ite3_Out1009786003| |P1Thread1of1ForFork0_#t~ite4_Out1009786003|))) (or (and (= ~y$w_buff1~0_In1009786003 |P1Thread1of1ForFork0_#t~ite3_Out1009786003|) .cse0 (not .cse1) (not .cse2)) (and (= |P1Thread1of1ForFork0_#t~ite3_Out1009786003| ~y~0_In1009786003) (or .cse2 .cse1) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1009786003, ~y$w_buff1~0=~y$w_buff1~0_In1009786003, ~y~0=~y~0_In1009786003, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1009786003} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1009786003, ~y$w_buff1~0=~y$w_buff1~0_In1009786003, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out1009786003|, ~y~0=~y~0_In1009786003, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out1009786003|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1009786003} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 06:30:25,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In303318246 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In303318246 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite11_Out303318246| ~y$w_buff0_used~0_In303318246)) (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite11_Out303318246|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In303318246, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In303318246} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In303318246, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out303318246|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In303318246} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 06:30:25,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1556112455 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In1556112455 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In1556112455 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1556112455 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite12_Out1556112455| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P2Thread1of1ForFork1_#t~ite12_Out1556112455| ~y$w_buff1_used~0_In1556112455)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1556112455, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1556112455, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1556112455, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1556112455} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1556112455, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1556112455, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1556112455, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out1556112455|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1556112455} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 06:30:25,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L792-->L793: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1687499744 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1687499744 256) 0))) (or (and (= ~y$r_buff0_thd3~0_Out1687499744 ~y$r_buff0_thd3~0_In1687499744) (or .cse0 .cse1)) (and (= 0 ~y$r_buff0_thd3~0_Out1687499744) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1687499744, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1687499744} OutVars{P2Thread1of1ForFork1_#t~ite13=|P2Thread1of1ForFork1_#t~ite13_Out1687499744|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1687499744, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1687499744} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite13, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 06:30:25,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L793-->L793-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In353125618 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In353125618 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In353125618 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In353125618 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite14_Out353125618| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite14_Out353125618| ~y$r_buff1_thd3~0_In353125618) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In353125618, ~y$w_buff0_used~0=~y$w_buff0_used~0_In353125618, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In353125618, ~y$w_buff1_used~0=~y$w_buff1_used~0_In353125618} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out353125618|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In353125618, ~y$w_buff0_used~0=~y$w_buff0_used~0_In353125618, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In353125618, ~y$w_buff1_used~0=~y$w_buff1_used~0_In353125618} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 06:30:25,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L793-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~y$r_buff1_thd3~0_15 |v_P2Thread1of1ForFork1_#t~ite14_8|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 06:30:25,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L755-->L755-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1914851469 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1914851469 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite5_Out-1914851469|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1914851469 |P1Thread1of1ForFork0_#t~ite5_Out-1914851469|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1914851469, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1914851469} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1914851469, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1914851469, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out-1914851469|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 06:30:25,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L756-->L756-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In984326932 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In984326932 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In984326932 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In984326932 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite6_Out984326932| ~y$w_buff1_used~0_In984326932)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite6_Out984326932| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In984326932, ~y$w_buff0_used~0=~y$w_buff0_used~0_In984326932, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In984326932, ~y$w_buff1_used~0=~y$w_buff1_used~0_In984326932} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In984326932, ~y$w_buff0_used~0=~y$w_buff0_used~0_In984326932, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In984326932, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out984326932|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In984326932} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 06:30:25,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L757-->L757-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In29658773 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In29658773 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite7_Out29658773| ~y$r_buff0_thd2~0_In29658773) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite7_Out29658773| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In29658773, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In29658773} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In29658773, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In29658773, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out29658773|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 06:30:25,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L758-->L758-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1189501823 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1189501823 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1189501823 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-1189501823 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite8_Out-1189501823|)) (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-1189501823 |P1Thread1of1ForFork0_#t~ite8_Out-1189501823|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1189501823, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1189501823, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1189501823, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1189501823} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1189501823, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1189501823, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1189501823, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out-1189501823|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1189501823} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 06:30:25,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L758-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd2~0_16) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_7|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 06:30:25,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L820-->L822-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~y$w_buff0_used~0_89 256)) (= 0 (mod v_~y$r_buff0_thd0~0_67 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_67, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_67, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 06:30:25,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L822-2-->L822-5: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-449976368 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-449976368 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite18_Out-449976368| |ULTIMATE.start_main_#t~ite19_Out-449976368|))) (or (and (not .cse0) (not .cse1) .cse2 (= ~y$w_buff1~0_In-449976368 |ULTIMATE.start_main_#t~ite18_Out-449976368|)) (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite18_Out-449976368| ~y~0_In-449976368)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-449976368, ~y~0=~y~0_In-449976368, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-449976368, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-449976368} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-449976368, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-449976368|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-449976368|, ~y~0=~y~0_In-449976368, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-449976368, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-449976368} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 06:30:25,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In2021109644 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In2021109644 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite20_Out2021109644| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out2021109644| ~y$w_buff0_used~0_In2021109644)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2021109644, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2021109644} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2021109644, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2021109644, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out2021109644|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 06:30:25,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L824-->L824-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1241388700 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1241388700 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1241388700 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1241388700 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1241388700 |ULTIMATE.start_main_#t~ite21_Out1241388700|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite21_Out1241388700|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1241388700, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1241388700, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1241388700, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1241388700} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1241388700, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1241388700, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1241388700|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1241388700, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1241388700} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 06:30:25,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1996476522 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1996476522 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite22_Out-1996476522|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-1996476522 |ULTIMATE.start_main_#t~ite22_Out-1996476522|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1996476522, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1996476522} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1996476522, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1996476522, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1996476522|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 06:30:25,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In2145728471 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In2145728471 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In2145728471 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In2145728471 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In2145728471 |ULTIMATE.start_main_#t~ite23_Out2145728471|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite23_Out2145728471|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2145728471, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2145728471, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2145728471, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2145728471} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2145728471, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2145728471, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2145728471, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out2145728471|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2145728471} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 06:30:25,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L834-->L834-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2055285420 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite30_Out-2055285420| |ULTIMATE.start_main_#t~ite29_Out-2055285420|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-2055285420 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-2055285420 256)) .cse1) (and (= 0 (mod ~y$r_buff1_thd0~0_In-2055285420 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-2055285420 256)))) (= ~y$w_buff0~0_In-2055285420 |ULTIMATE.start_main_#t~ite29_Out-2055285420|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite30_Out-2055285420| ~y$w_buff0~0_In-2055285420) (= |ULTIMATE.start_main_#t~ite29_In-2055285420| |ULTIMATE.start_main_#t~ite29_Out-2055285420|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2055285420, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-2055285420|, ~y$w_buff0~0=~y$w_buff0~0_In-2055285420, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2055285420, ~weak$$choice2~0=~weak$$choice2~0_In-2055285420, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2055285420, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2055285420} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-2055285420|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2055285420, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-2055285420|, ~y$w_buff0~0=~y$w_buff0~0_In-2055285420, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2055285420, ~weak$$choice2~0=~weak$$choice2~0_In-2055285420, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2055285420, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2055285420} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 06:30:25,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L836-->L836-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1884851305 256)))) (or (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1884851305 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1884851305 256))) (and (= (mod ~y$w_buff1_used~0_In1884851305 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1884851305 256)))) (= ~y$w_buff0_used~0_In1884851305 |ULTIMATE.start_main_#t~ite35_Out1884851305|) (= |ULTIMATE.start_main_#t~ite36_Out1884851305| |ULTIMATE.start_main_#t~ite35_Out1884851305|)) (and (= |ULTIMATE.start_main_#t~ite35_In1884851305| |ULTIMATE.start_main_#t~ite35_Out1884851305|) (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out1884851305| ~y$w_buff0_used~0_In1884851305)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1884851305, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1884851305, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In1884851305|, ~weak$$choice2~0=~weak$$choice2~0_In1884851305, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1884851305, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1884851305} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1884851305, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1884851305, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1884851305|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1884851305|, ~weak$$choice2~0=~weak$$choice2~0_In1884851305, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1884851305, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1884851305} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 06:30:25,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L837-->L837-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1210259548 256)))) (or (and (= ~y$w_buff1_used~0_In-1210259548 |ULTIMATE.start_main_#t~ite39_Out-1210259548|) (not .cse0) (= |ULTIMATE.start_main_#t~ite38_In-1210259548| |ULTIMATE.start_main_#t~ite38_Out-1210259548|)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1210259548 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1210259548 256))) (= (mod ~y$w_buff0_used~0_In-1210259548 256) 0) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1210259548 256))))) (= |ULTIMATE.start_main_#t~ite39_Out-1210259548| |ULTIMATE.start_main_#t~ite38_Out-1210259548|) (= ~y$w_buff1_used~0_In-1210259548 |ULTIMATE.start_main_#t~ite38_Out-1210259548|) .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1210259548, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1210259548, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-1210259548|, ~weak$$choice2~0=~weak$$choice2~0_In-1210259548, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1210259548, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1210259548} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1210259548, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1210259548|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1210259548, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1210259548|, ~weak$$choice2~0=~weak$$choice2~0_In-1210259548, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1210259548, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1210259548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 06:30:25,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L838-->L839: Formula: (and (= v_~y$r_buff0_thd0~0_61 v_~y$r_buff0_thd0~0_60) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_20, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 06:30:25,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L839-->L839-8: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite45_Out-815238874| |ULTIMATE.start_main_#t~ite44_Out-815238874|)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-815238874 256))) (.cse5 (= (mod ~y$w_buff0_used~0_In-815238874 256) 0)) (.cse4 (= 0 (mod ~y$w_buff1_used~0_In-815238874 256))) (.cse0 (= 0 (mod ~weak$$choice2~0_In-815238874 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-815238874 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_In-815238874| |ULTIMATE.start_main_#t~ite43_Out-815238874|) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-815238874| ~y$r_buff1_thd0~0_In-815238874) (not .cse0) (= |ULTIMATE.start_main_#t~ite44_In-815238874| |ULTIMATE.start_main_#t~ite44_Out-815238874|)) (and .cse1 (= ~y$r_buff1_thd0~0_In-815238874 |ULTIMATE.start_main_#t~ite44_Out-815238874|) .cse0 (or (and .cse2 .cse3) (and .cse4 .cse2) .cse5)))) (let ((.cse6 (not .cse2))) (and .cse1 (or (not .cse3) .cse6) (not .cse5) (or .cse6 (not .cse4)) (= |ULTIMATE.start_main_#t~ite43_Out-815238874| 0) .cse0 (= |ULTIMATE.start_main_#t~ite43_Out-815238874| |ULTIMATE.start_main_#t~ite44_Out-815238874|))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-815238874, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-815238874, ~weak$$choice2~0=~weak$$choice2~0_In-815238874, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_In-815238874|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-815238874, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-815238874, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In-815238874|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-815238874, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-815238874, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-815238874|, ~weak$$choice2~0=~weak$$choice2~0_In-815238874, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-815238874, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-815238874|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-815238874|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-815238874} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 06:30:25,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L841-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11) (= v_~y~0_22 v_~y$mem_tmp~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:30:25,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 06:30:25,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:30:25 BasicIcfg [2019-12-27 06:30:25,670 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:30:25,673 INFO L168 Benchmark]: Toolchain (without parser) took 32147.23 ms. Allocated memory was 144.7 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 101.2 MB in the beginning and 951.8 MB in the end (delta: -850.6 MB). Peak memory consumption was 495.2 MB. Max. memory is 7.1 GB. [2019-12-27 06:30:25,673 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 144.7 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 06:30:25,674 INFO L168 Benchmark]: CACSL2BoogieTranslator took 784.04 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 100.9 MB in the beginning and 156.8 MB in the end (delta: -55.8 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:30:25,675 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.51 ms. Allocated memory is still 202.9 MB. Free memory was 156.8 MB in the beginning and 154.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:30:25,675 INFO L168 Benchmark]: Boogie Preprocessor took 74.99 ms. Allocated memory is still 202.9 MB. Free memory was 154.0 MB in the beginning and 151.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:30:25,676 INFO L168 Benchmark]: RCFGBuilder took 875.68 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 104.0 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. [2019-12-27 06:30:25,679 INFO L168 Benchmark]: TraceAbstraction took 30290.62 ms. Allocated memory was 202.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 104.0 MB in the beginning and 951.8 MB in the end (delta: -847.8 MB). Peak memory consumption was 439.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:30:25,685 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.20 ms. Allocated memory is still 144.7 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 784.04 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 100.9 MB in the beginning and 156.8 MB in the end (delta: -55.8 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 116.51 ms. Allocated memory is still 202.9 MB. Free memory was 156.8 MB in the beginning and 154.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 74.99 ms. Allocated memory is still 202.9 MB. Free memory was 154.0 MB in the beginning and 151.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 875.68 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 104.0 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30290.62 ms. Allocated memory was 202.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 104.0 MB in the beginning and 951.8 MB in the end (delta: -847.8 MB). Peak memory consumption was 439.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 165 ProgramPointsBefore, 79 ProgramPointsAfterwards, 196 TransitionsBefore, 85 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 29 ChoiceCompositions, 4245 VarBasedMoverChecksPositive, 151 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 50879 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L812] FCALL, FORK 0 pthread_create(&t1120, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L814] FCALL, FORK 0 pthread_create(&t1121, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L816] FCALL, FORK 0 pthread_create(&t1122, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L768] 3 y$w_buff1 = y$w_buff0 [L769] 3 y$w_buff0 = 2 [L770] 3 y$w_buff1_used = y$w_buff0_used [L771] 3 y$w_buff0_used = (_Bool)1 [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L748] 2 x = 1 [L751] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L754] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L754] 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) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 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 [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 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 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L833] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L833] 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) [L834] 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)) [L835] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L835] 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)) [L836] 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)) [L837] 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)) [L839] 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)) [L840] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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 4 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 30.0s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2109 SDtfs, 2434 SDslu, 5779 SDs, 0 SdLazy, 4120 SolverSat, 236 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 25 SyntacticMatches, 12 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35296occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 48526 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 720 NumberOfCodeBlocks, 720 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 645 ConstructedInterpolants, 0 QuantifiedInterpolants, 117961 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...