/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix046_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 21:59:39,281 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 21:59:39,283 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 21:59:39,312 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 21:59:39,312 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 21:59:39,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 21:59:39,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 21:59:39,324 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 21:59:39,327 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 21:59:39,329 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 21:59:39,330 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 21:59:39,332 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 21:59:39,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 21:59:39,335 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 21:59:39,337 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 21:59:39,338 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 21:59:39,339 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 21:59:39,341 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 21:59:39,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 21:59:39,348 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 21:59:39,349 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 21:59:39,350 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 21:59:39,351 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 21:59:39,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 21:59:39,364 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 21:59:39,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 21:59:39,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 21:59:39,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 21:59:39,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 21:59:39,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 21:59:39,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 21:59:39,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 21:59:39,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 21:59:39,370 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 21:59:39,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 21:59:39,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 21:59:39,373 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 21:59:39,373 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 21:59:39,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 21:59:39,374 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 21:59:39,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 21:59:39,376 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-10-15 21:59:39,418 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 21:59:39,418 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 21:59:39,420 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 21:59:39,420 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 21:59:39,420 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 21:59:39,420 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 21:59:39,420 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 21:59:39,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 21:59:39,421 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 21:59:39,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 21:59:39,422 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 21:59:39,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 21:59:39,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 21:59:39,423 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 21:59:39,423 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 21:59:39,423 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 21:59:39,423 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 21:59:39,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 21:59:39,424 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 21:59:39,424 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 21:59:39,424 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 21:59:39,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 21:59:39,424 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 21:59:39,425 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 21:59:39,425 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 21:59:39,425 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 21:59:39,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 21:59:39,425 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 21:59:39,425 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 21:59:39,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 21:59:39,757 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 21:59:39,760 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 21:59:39,763 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 21:59:39,764 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 21:59:39,765 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_tso.opt.i [2020-10-15 21:59:39,811 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cec29cc7/353781b779e44b49b9cb5526c05ffb13/FLAGd188a26e7 [2020-10-15 21:59:40,367 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 21:59:40,367 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_tso.opt.i [2020-10-15 21:59:40,380 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cec29cc7/353781b779e44b49b9cb5526c05ffb13/FLAGd188a26e7 [2020-10-15 21:59:40,637 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cec29cc7/353781b779e44b49b9cb5526c05ffb13 [2020-10-15 21:59:40,645 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 21:59:40,647 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 21:59:40,648 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 21:59:40,648 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 21:59:40,651 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 21:59:40,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:59:40" (1/1) ... [2020-10-15 21:59:40,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ba6a79e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:59:40, skipping insertion in model container [2020-10-15 21:59:40,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:59:40" (1/1) ... [2020-10-15 21:59:40,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 21:59:40,720 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 21:59:41,242 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 21:59:41,255 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 21:59:41,313 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 21:59:41,391 INFO L208 MainTranslator]: Completed translation [2020-10-15 21:59:41,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:59:41 WrapperNode [2020-10-15 21:59:41,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 21:59:41,392 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 21:59:41,393 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 21:59:41,393 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 21:59:41,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:59:41" (1/1) ... [2020-10-15 21:59:41,421 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:59:41" (1/1) ... [2020-10-15 21:59:41,457 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 21:59:41,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 21:59:41,458 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 21:59:41,458 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 21:59:41,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:59:41" (1/1) ... [2020-10-15 21:59:41,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:59:41" (1/1) ... [2020-10-15 21:59:41,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:59:41" (1/1) ... [2020-10-15 21:59:41,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:59:41" (1/1) ... [2020-10-15 21:59:41,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:59:41" (1/1) ... [2020-10-15 21:59:41,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:59:41" (1/1) ... [2020-10-15 21:59:41,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:59:41" (1/1) ... [2020-10-15 21:59:41,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 21:59:41,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 21:59:41,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 21:59:41,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 21:59:41,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:59:41" (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 [2020-10-15 21:59:41,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 21:59:41,559 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-15 21:59:41,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 21:59:41,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 21:59:41,559 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-15 21:59:41,560 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-15 21:59:41,561 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-15 21:59:41,561 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-15 21:59:41,561 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-15 21:59:41,561 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-15 21:59:41,563 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-15 21:59:41,563 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-15 21:59:41,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-15 21:59:41,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 21:59:41,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 21:59:41,565 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 21:59:43,256 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 21:59:43,257 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-15 21:59:43,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:59:43 BoogieIcfgContainer [2020-10-15 21:59:43,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 21:59:43,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 21:59:43,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 21:59:43,264 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 21:59:43,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 09:59:40" (1/3) ... [2020-10-15 21:59:43,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515bf724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:59:43, skipping insertion in model container [2020-10-15 21:59:43,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:59:41" (2/3) ... [2020-10-15 21:59:43,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515bf724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:59:43, skipping insertion in model container [2020-10-15 21:59:43,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:59:43" (3/3) ... [2020-10-15 21:59:43,267 INFO L111 eAbstractionObserver]: Analyzing ICFG mix046_tso.opt.i [2020-10-15 21:59:43,278 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 21:59:43,278 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 21:59:43,286 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-15 21:59:43,287 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 21:59:43,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,316 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,317 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,317 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,317 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,318 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,318 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,319 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,320 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,321 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,321 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,321 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,322 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,322 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,322 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,323 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,323 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,323 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,323 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,323 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,324 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,330 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,330 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,335 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,336 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,337 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,339 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,339 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,339 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,339 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,340 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,340 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,340 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,340 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,340 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,341 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,341 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,341 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,343 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,343 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:59:43,357 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-15 21:59:43,377 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 21:59:43,377 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 21:59:43,377 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 21:59:43,377 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 21:59:43,377 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 21:59:43,378 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 21:59:43,378 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 21:59:43,378 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 21:59:43,391 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 21:59:43,394 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 112 transitions, 244 flow [2020-10-15 21:59:43,396 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 112 transitions, 244 flow [2020-10-15 21:59:43,398 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2020-10-15 21:59:43,450 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2020-10-15 21:59:43,450 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-15 21:59:43,456 INFO L80 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-15 21:59:43,460 INFO L117 LiptonReduction]: Number of co-enabled transitions 2540 [2020-10-15 21:59:43,758 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-15 21:59:44,150 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-15 21:59:44,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 21:59:44,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:44,283 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 21:59:44,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:44,315 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 21:59:44,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:44,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 21:59:44,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:44,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term [2020-10-15 21:59:44,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:59:44,349 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term [2020-10-15 21:59:44,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:59:44,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 21:59:44,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:44,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 21:59:44,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:44,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 21:59:44,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:44,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 21:59:44,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:44,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 21:59:44,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 21:59:44,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-15 21:59:44,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:44,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:59:44,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:59:44,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 21:59:44,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:44,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 21:59:44,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:44,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 21:59:44,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:59:44,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 21:59:44,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:59:44,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 21:59:44,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:59:44,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-15 21:59:44,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:44,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-15 21:59:44,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:44,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-15 21:59:44,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:44,663 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 21:59:44,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:44,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 21:59:44,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:44,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 21:59:44,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:44,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 21:59:44,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:44,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 21:59:44,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:44,738 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 21:59:44,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:44,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 21:59:44,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:44,758 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 21:59:44,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:44,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:59:44,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:59:44,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 21:59:44,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:44,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 21:59:44,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:44,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 21:59:44,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:59:44,826 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 21:59:44,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:59:44,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 21:59:44,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:59:44,833 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-15 21:59:44,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:44,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-15 21:59:44,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:44,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-15 21:59:44,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:44,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 21:59:44,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:44,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 21:59:44,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:44,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 21:59:44,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 21:59:44,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-15 21:59:44,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:46,118 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2020-10-15 21:59:46,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-10-15 21:59:46,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:46,135 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 21:59:46,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:47,480 WARN L193 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2020-10-15 21:59:47,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 21:59:47,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:47,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 21:59:47,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:47,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term [2020-10-15 21:59:47,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:59:47,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term [2020-10-15 21:59:47,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:59:47,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:59:47,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:59:47,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 21:59:47,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:47,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 21:59:47,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:47,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 21:59:47,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:59:47,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 21:59:47,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:59:47,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 21:59:47,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:59:47,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-15 21:59:47,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:47,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-15 21:59:47,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:47,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-15 21:59:47,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:47,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 21:59:47,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:47,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 21:59:47,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:47,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 21:59:47,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 21:59:47,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-15 21:59:47,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:47,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 21:59:47,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:47,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 21:59:47,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:47,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 21:59:47,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:47,720 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 21:59:47,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:47,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 21:59:47,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:47,786 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 21:59:47,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:47,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 21:59:47,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:47,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 21:59:47,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:47,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:59:47,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:59:47,885 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:59:47,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:59:47,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:59:47,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:47,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:59:47,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:47,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:59:47,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:59:47,901 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:59:47,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:59:47,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:59:47,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:59:47,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:59:47,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:59:47,951 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 21:59:47,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:59:48,222 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-15 21:59:48,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 21:59:48,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:59:48,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-10-15 21:59:48,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:59:48,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:59:48,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:59:48,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:59:48,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:59:48,621 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 21:59:48,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:48,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 21:59:48,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:48,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 21:59:48,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:48,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 21:59:48,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:48,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 21:59:48,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:48,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 21:59:48,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:59:48,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 21:59:48,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:48,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 21:59:48,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:59:48,982 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 21:59:48,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:59:48,984 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 21:59:48,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:48,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 21:59:48,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:59:49,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-10-15 21:59:49,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:59:49,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:59:49,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:59:49,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:59:49,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:59:49,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 21:59:49,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:49,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 21:59:49,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:49,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 21:59:49,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:49,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 21:59:49,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:49,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 21:59:49,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:49,750 WARN L193 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 129 [2020-10-15 21:59:50,104 WARN L193 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-15 21:59:50,754 WARN L193 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 111 [2020-10-15 21:59:51,045 WARN L193 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-15 21:59:51,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:59:51,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:59:51,207 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:59:51,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:59:51,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:59:51,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:51,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:59:51,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:51,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:59:51,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:59:51,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:59:51,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:59:51,226 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:59:51,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:59:51,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:59:51,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:59:52,058 WARN L193 SmtUtils]: Spent 498.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-10-15 21:59:52,406 WARN L193 SmtUtils]: Spent 346.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-15 21:59:52,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:59:52,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:59:52,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:59:52,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:59:52,418 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:59:52,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:59:52,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:59:52,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:59:52,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:59:52,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:59:52,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:59:52,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:59:52,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:59:52,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:52,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:59:52,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:59:52,953 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2020-10-15 21:59:53,076 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-15 21:59:53,085 INFO L132 LiptonReduction]: Checked pairs total: 6932 [2020-10-15 21:59:53,085 INFO L134 LiptonReduction]: Total number of compositions: 93 [2020-10-15 21:59:53,092 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow [2020-10-15 21:59:53,274 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3002 states. [2020-10-15 21:59:53,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states. [2020-10-15 21:59:53,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-15 21:59:53,284 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:59:53,285 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:59:53,285 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:59:53,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:59:53,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1805630863, now seen corresponding path program 1 times [2020-10-15 21:59:53,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:59:53,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598134077] [2020-10-15 21:59:53,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:59:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:59:53,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:59:53,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598134077] [2020-10-15 21:59:53,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:59:53,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 21:59:53,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848493572] [2020-10-15 21:59:53,551 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 21:59:53,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:59:53,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 21:59:53,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 21:59:53,568 INFO L87 Difference]: Start difference. First operand 3002 states. Second operand 3 states. [2020-10-15 21:59:53,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:59:53,688 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions. [2020-10-15 21:59:53,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 21:59:53,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-15 21:59:53,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:59:53,734 INFO L225 Difference]: With dead ends: 2602 [2020-10-15 21:59:53,734 INFO L226 Difference]: Without dead ends: 2122 [2020-10-15 21:59:53,735 INFO L677 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 [2020-10-15 21:59:53,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2020-10-15 21:59:53,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122. [2020-10-15 21:59:53,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2020-10-15 21:59:53,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 8080 transitions. [2020-10-15 21:59:53,888 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 8080 transitions. Word has length 9 [2020-10-15 21:59:53,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:59:53,889 INFO L481 AbstractCegarLoop]: Abstraction has 2122 states and 8080 transitions. [2020-10-15 21:59:53,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 21:59:53,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 8080 transitions. [2020-10-15 21:59:53,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 21:59:53,892 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:59:53,892 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:59:53,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 21:59:53,893 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:59:53,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:59:53,893 INFO L82 PathProgramCache]: Analyzing trace with hash 44553062, now seen corresponding path program 1 times [2020-10-15 21:59:53,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:59:53,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302223840] [2020-10-15 21:59:53,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:59:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:59:54,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:59:54,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302223840] [2020-10-15 21:59:54,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:59:54,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 21:59:54,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50814709] [2020-10-15 21:59:54,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 21:59:54,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:59:54,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 21:59:54,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 21:59:54,033 INFO L87 Difference]: Start difference. First operand 2122 states and 8080 transitions. Second operand 3 states. [2020-10-15 21:59:54,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:59:54,092 INFO L93 Difference]: Finished difference Result 2114 states and 8042 transitions. [2020-10-15 21:59:54,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 21:59:54,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-15 21:59:54,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:59:54,111 INFO L225 Difference]: With dead ends: 2114 [2020-10-15 21:59:54,111 INFO L226 Difference]: Without dead ends: 2114 [2020-10-15 21:59:54,112 INFO L677 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 [2020-10-15 21:59:54,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2020-10-15 21:59:54,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 2114. [2020-10-15 21:59:54,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2020-10-15 21:59:54,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 8042 transitions. [2020-10-15 21:59:54,212 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 8042 transitions. Word has length 11 [2020-10-15 21:59:54,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:59:54,213 INFO L481 AbstractCegarLoop]: Abstraction has 2114 states and 8042 transitions. [2020-10-15 21:59:54,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 21:59:54,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 8042 transitions. [2020-10-15 21:59:54,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 21:59:54,220 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:59:54,221 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:59:54,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 21:59:54,221 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:59:54,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:59:54,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1379604367, now seen corresponding path program 1 times [2020-10-15 21:59:54,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:59:54,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699663771] [2020-10-15 21:59:54,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:59:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:59:54,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:59:54,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699663771] [2020-10-15 21:59:54,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:59:54,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 21:59:54,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742331161] [2020-10-15 21:59:54,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 21:59:54,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:59:54,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 21:59:54,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 21:59:54,359 INFO L87 Difference]: Start difference. First operand 2114 states and 8042 transitions. Second operand 3 states. [2020-10-15 21:59:54,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:59:54,407 INFO L93 Difference]: Finished difference Result 2074 states and 7860 transitions. [2020-10-15 21:59:54,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 21:59:54,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-15 21:59:54,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:59:54,428 INFO L225 Difference]: With dead ends: 2074 [2020-10-15 21:59:54,428 INFO L226 Difference]: Without dead ends: 2074 [2020-10-15 21:59:54,429 INFO L677 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 [2020-10-15 21:59:54,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2020-10-15 21:59:54,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2074. [2020-10-15 21:59:54,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2074 states. [2020-10-15 21:59:54,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 7860 transitions. [2020-10-15 21:59:54,574 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 7860 transitions. Word has length 12 [2020-10-15 21:59:54,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:59:54,574 INFO L481 AbstractCegarLoop]: Abstraction has 2074 states and 7860 transitions. [2020-10-15 21:59:54,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 21:59:54,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 7860 transitions. [2020-10-15 21:59:54,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 21:59:54,576 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:59:54,576 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:59:54,576 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 21:59:54,577 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:59:54,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:59:54,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1381144168, now seen corresponding path program 1 times [2020-10-15 21:59:54,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:59:54,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805852282] [2020-10-15 21:59:54,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:59:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:59:54,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:59:54,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805852282] [2020-10-15 21:59:54,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:59:54,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 21:59:54,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132716519] [2020-10-15 21:59:54,654 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 21:59:54,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:59:54,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 21:59:54,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 21:59:54,655 INFO L87 Difference]: Start difference. First operand 2074 states and 7860 transitions. Second operand 3 states. [2020-10-15 21:59:54,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:59:54,692 INFO L93 Difference]: Finished difference Result 2002 states and 7554 transitions. [2020-10-15 21:59:54,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 21:59:54,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-15 21:59:54,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:59:54,710 INFO L225 Difference]: With dead ends: 2002 [2020-10-15 21:59:54,710 INFO L226 Difference]: Without dead ends: 2002 [2020-10-15 21:59:54,711 INFO L677 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 [2020-10-15 21:59:54,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2020-10-15 21:59:54,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 2002. [2020-10-15 21:59:54,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2002 states. [2020-10-15 21:59:54,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 7554 transitions. [2020-10-15 21:59:54,784 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 7554 transitions. Word has length 12 [2020-10-15 21:59:54,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:59:54,784 INFO L481 AbstractCegarLoop]: Abstraction has 2002 states and 7554 transitions. [2020-10-15 21:59:54,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 21:59:54,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 7554 transitions. [2020-10-15 21:59:54,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 21:59:54,787 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:59:54,787 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:59:54,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 21:59:54,788 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:59:54,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:59:54,788 INFO L82 PathProgramCache]: Analyzing trace with hash -181938337, now seen corresponding path program 1 times [2020-10-15 21:59:54,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:59:54,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495592470] [2020-10-15 21:59:54,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:59:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:59:54,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:59:54,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495592470] [2020-10-15 21:59:54,876 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:59:54,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 21:59:54,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279978233] [2020-10-15 21:59:54,876 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 21:59:54,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:59:54,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 21:59:54,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 21:59:54,877 INFO L87 Difference]: Start difference. First operand 2002 states and 7554 transitions. Second operand 5 states. [2020-10-15 21:59:54,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:59:54,943 INFO L93 Difference]: Finished difference Result 2058 states and 7728 transitions. [2020-10-15 21:59:54,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 21:59:54,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-15 21:59:54,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:59:54,961 INFO L225 Difference]: With dead ends: 2058 [2020-10-15 21:59:54,961 INFO L226 Difference]: Without dead ends: 2058 [2020-10-15 21:59:54,962 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 21:59:54,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2020-10-15 21:59:55,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 2058. [2020-10-15 21:59:55,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2058 states. [2020-10-15 21:59:55,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 7728 transitions. [2020-10-15 21:59:55,024 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 7728 transitions. Word has length 13 [2020-10-15 21:59:55,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:59:55,025 INFO L481 AbstractCegarLoop]: Abstraction has 2058 states and 7728 transitions. [2020-10-15 21:59:55,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 21:59:55,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 7728 transitions. [2020-10-15 21:59:55,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 21:59:55,027 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:59:55,027 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:59:55,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 21:59:55,028 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:59:55,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:59:55,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1371614753, now seen corresponding path program 1 times [2020-10-15 21:59:55,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:59:55,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869711771] [2020-10-15 21:59:55,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:59:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:59:55,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:59:55,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869711771] [2020-10-15 21:59:55,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:59:55,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 21:59:55,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450868631] [2020-10-15 21:59:55,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 21:59:55,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:59:55,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 21:59:55,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 21:59:55,108 INFO L87 Difference]: Start difference. First operand 2058 states and 7728 transitions. Second operand 5 states. [2020-10-15 21:59:55,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:59:55,210 INFO L93 Difference]: Finished difference Result 2010 states and 7516 transitions. [2020-10-15 21:59:55,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 21:59:55,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-15 21:59:55,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:59:55,227 INFO L225 Difference]: With dead ends: 2010 [2020-10-15 21:59:55,227 INFO L226 Difference]: Without dead ends: 2010 [2020-10-15 21:59:55,228 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-15 21:59:55,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2010 states. [2020-10-15 21:59:55,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2010 to 2010. [2020-10-15 21:59:55,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2010 states. [2020-10-15 21:59:55,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 7516 transitions. [2020-10-15 21:59:55,311 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 7516 transitions. Word has length 14 [2020-10-15 21:59:55,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:59:55,311 INFO L481 AbstractCegarLoop]: Abstraction has 2010 states and 7516 transitions. [2020-10-15 21:59:55,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 21:59:55,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 7516 transitions. [2020-10-15 21:59:55,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 21:59:55,315 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:59:55,315 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:59:55,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 21:59:55,315 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:59:55,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:59:55,316 INFO L82 PathProgramCache]: Analyzing trace with hash 429613437, now seen corresponding path program 1 times [2020-10-15 21:59:55,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:59:55,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185817099] [2020-10-15 21:59:55,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:59:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:59:55,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:59:55,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185817099] [2020-10-15 21:59:55,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:59:55,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 21:59:55,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902405] [2020-10-15 21:59:55,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 21:59:55,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:59:55,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 21:59:55,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 21:59:55,419 INFO L87 Difference]: Start difference. First operand 2010 states and 7516 transitions. Second operand 5 states. [2020-10-15 21:59:55,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:59:55,514 INFO L93 Difference]: Finished difference Result 2202 states and 8188 transitions. [2020-10-15 21:59:55,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 21:59:55,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-15 21:59:55,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:59:55,530 INFO L225 Difference]: With dead ends: 2202 [2020-10-15 21:59:55,530 INFO L226 Difference]: Without dead ends: 2202 [2020-10-15 21:59:55,530 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-15 21:59:55,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2020-10-15 21:59:55,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 2106. [2020-10-15 21:59:55,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2020-10-15 21:59:55,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 7836 transitions. [2020-10-15 21:59:55,592 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 7836 transitions. Word has length 15 [2020-10-15 21:59:55,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:59:55,592 INFO L481 AbstractCegarLoop]: Abstraction has 2106 states and 7836 transitions. [2020-10-15 21:59:55,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 21:59:55,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 7836 transitions. [2020-10-15 21:59:55,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 21:59:55,595 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:59:55,595 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:59:55,595 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 21:59:55,596 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:59:55,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:59:55,596 INFO L82 PathProgramCache]: Analyzing trace with hash 427993377, now seen corresponding path program 2 times [2020-10-15 21:59:55,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:59:55,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400970676] [2020-10-15 21:59:55,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:59:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:59:55,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:59:55,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400970676] [2020-10-15 21:59:55,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:59:55,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 21:59:55,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551753394] [2020-10-15 21:59:55,692 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 21:59:55,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:59:55,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 21:59:55,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-15 21:59:55,693 INFO L87 Difference]: Start difference. First operand 2106 states and 7836 transitions. Second operand 6 states. [2020-10-15 21:59:55,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:59:55,783 INFO L93 Difference]: Finished difference Result 2426 states and 9052 transitions. [2020-10-15 21:59:55,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 21:59:55,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-15 21:59:55,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:59:55,797 INFO L225 Difference]: With dead ends: 2426 [2020-10-15 21:59:55,797 INFO L226 Difference]: Without dead ends: 2426 [2020-10-15 21:59:55,798 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-15 21:59:55,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2426 states. [2020-10-15 21:59:55,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2426 to 2266. [2020-10-15 21:59:55,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2266 states. [2020-10-15 21:59:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2266 states to 2266 states and 8524 transitions. [2020-10-15 21:59:55,863 INFO L78 Accepts]: Start accepts. Automaton has 2266 states and 8524 transitions. Word has length 15 [2020-10-15 21:59:55,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:59:55,863 INFO L481 AbstractCegarLoop]: Abstraction has 2266 states and 8524 transitions. [2020-10-15 21:59:55,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 21:59:55,863 INFO L276 IsEmpty]: Start isEmpty. Operand 2266 states and 8524 transitions. [2020-10-15 21:59:55,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 21:59:55,866 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:59:55,867 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:59:55,867 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 21:59:55,867 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:59:55,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:59:55,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1250847550, now seen corresponding path program 1 times [2020-10-15 21:59:55,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:59:55,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229665480] [2020-10-15 21:59:55,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:59:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:59:56,157 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2020-10-15 21:59:56,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:59:56,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229665480] [2020-10-15 21:59:56,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:59:56,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 21:59:56,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752541912] [2020-10-15 21:59:56,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 21:59:56,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:59:56,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 21:59:56,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-15 21:59:56,188 INFO L87 Difference]: Start difference. First operand 2266 states and 8524 transitions. Second operand 6 states. [2020-10-15 21:59:56,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:59:56,263 INFO L93 Difference]: Finished difference Result 2346 states and 8804 transitions. [2020-10-15 21:59:56,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 21:59:56,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-15 21:59:56,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:59:56,274 INFO L225 Difference]: With dead ends: 2346 [2020-10-15 21:59:56,274 INFO L226 Difference]: Without dead ends: 2346 [2020-10-15 21:59:56,274 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-15 21:59:56,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2020-10-15 21:59:56,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2138. [2020-10-15 21:59:56,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2138 states. [2020-10-15 21:59:56,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 8044 transitions. [2020-10-15 21:59:56,341 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 8044 transitions. Word has length 15 [2020-10-15 21:59:56,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:59:56,341 INFO L481 AbstractCegarLoop]: Abstraction has 2138 states and 8044 transitions. [2020-10-15 21:59:56,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 21:59:56,342 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 8044 transitions. [2020-10-15 21:59:56,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 21:59:56,346 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:59:56,346 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:59:56,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 21:59:56,346 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:59:56,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:59:56,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1679803679, now seen corresponding path program 3 times [2020-10-15 21:59:56,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:59:56,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004292992] [2020-10-15 21:59:56,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:59:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:59:56,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:59:56,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004292992] [2020-10-15 21:59:56,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:59:56,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 21:59:56,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955712851] [2020-10-15 21:59:56,429 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 21:59:56,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:59:56,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 21:59:56,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 21:59:56,430 INFO L87 Difference]: Start difference. First operand 2138 states and 8044 transitions. Second operand 6 states. [2020-10-15 21:59:56,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:59:56,513 INFO L93 Difference]: Finished difference Result 2154 states and 8068 transitions. [2020-10-15 21:59:56,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 21:59:56,514 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-15 21:59:56,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:59:56,522 INFO L225 Difference]: With dead ends: 2154 [2020-10-15 21:59:56,522 INFO L226 Difference]: Without dead ends: 2154 [2020-10-15 21:59:56,522 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 21:59:56,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2020-10-15 21:59:56,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1946. [2020-10-15 21:59:56,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2020-10-15 21:59:56,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 7244 transitions. [2020-10-15 21:59:56,577 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 7244 transitions. Word has length 15 [2020-10-15 21:59:56,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:59:56,578 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 7244 transitions. [2020-10-15 21:59:56,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 21:59:56,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 7244 transitions. [2020-10-15 21:59:56,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 21:59:56,582 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:59:56,582 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:59:56,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 21:59:56,582 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:59:56,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:59:56,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1536691040, now seen corresponding path program 1 times [2020-10-15 21:59:56,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:59:56,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504320863] [2020-10-15 21:59:56,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:59:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:59:56,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:59:56,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504320863] [2020-10-15 21:59:56,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:59:56,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 21:59:56,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583572321] [2020-10-15 21:59:56,644 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 21:59:56,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:59:56,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 21:59:56,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 21:59:56,645 INFO L87 Difference]: Start difference. First operand 1946 states and 7244 transitions. Second operand 4 states. [2020-10-15 21:59:56,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:59:56,689 INFO L93 Difference]: Finished difference Result 2032 states and 6903 transitions. [2020-10-15 21:59:56,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 21:59:56,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-15 21:59:56,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:59:56,695 INFO L225 Difference]: With dead ends: 2032 [2020-10-15 21:59:56,696 INFO L226 Difference]: Without dead ends: 1520 [2020-10-15 21:59:56,696 INFO L677 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 [2020-10-15 21:59:56,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2020-10-15 21:59:56,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1520. [2020-10-15 21:59:56,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1520 states. [2020-10-15 21:59:56,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 5114 transitions. [2020-10-15 21:59:56,745 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 5114 transitions. Word has length 16 [2020-10-15 21:59:56,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:59:56,746 INFO L481 AbstractCegarLoop]: Abstraction has 1520 states and 5114 transitions. [2020-10-15 21:59:56,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 21:59:56,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 5114 transitions. [2020-10-15 21:59:56,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 21:59:56,749 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:59:56,749 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:59:56,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 21:59:56,750 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:59:56,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:59:56,750 INFO L82 PathProgramCache]: Analyzing trace with hash -383258267, now seen corresponding path program 1 times [2020-10-15 21:59:56,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:59:56,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070553050] [2020-10-15 21:59:56,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:59:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:59:56,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:59:56,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070553050] [2020-10-15 21:59:56,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:59:56,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 21:59:56,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765553143] [2020-10-15 21:59:56,828 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 21:59:56,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:59:56,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 21:59:56,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 21:59:56,828 INFO L87 Difference]: Start difference. First operand 1520 states and 5114 transitions. Second operand 5 states. [2020-10-15 21:59:56,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:59:56,888 INFO L93 Difference]: Finished difference Result 1320 states and 4082 transitions. [2020-10-15 21:59:56,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 21:59:56,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-15 21:59:56,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:59:56,891 INFO L225 Difference]: With dead ends: 1320 [2020-10-15 21:59:56,892 INFO L226 Difference]: Without dead ends: 997 [2020-10-15 21:59:56,892 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 21:59:56,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2020-10-15 21:59:56,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2020-10-15 21:59:56,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2020-10-15 21:59:56,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 3022 transitions. [2020-10-15 21:59:56,916 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 3022 transitions. Word has length 17 [2020-10-15 21:59:56,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:59:56,916 INFO L481 AbstractCegarLoop]: Abstraction has 997 states and 3022 transitions. [2020-10-15 21:59:56,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 21:59:56,917 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 3022 transitions. [2020-10-15 21:59:56,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 21:59:56,919 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:59:56,919 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:59:56,919 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 21:59:56,920 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:59:56,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:59:56,920 INFO L82 PathProgramCache]: Analyzing trace with hash 709308523, now seen corresponding path program 1 times [2020-10-15 21:59:56,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:59:56,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768620636] [2020-10-15 21:59:56,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:59:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:59:56,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:59:56,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768620636] [2020-10-15 21:59:56,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:59:56,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 21:59:56,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66046991] [2020-10-15 21:59:56,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 21:59:56,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:59:56,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 21:59:56,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 21:59:56,955 INFO L87 Difference]: Start difference. First operand 997 states and 3022 transitions. Second operand 3 states. [2020-10-15 21:59:56,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:59:56,969 INFO L93 Difference]: Finished difference Result 1421 states and 4197 transitions. [2020-10-15 21:59:56,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 21:59:56,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-10-15 21:59:56,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:59:56,974 INFO L225 Difference]: With dead ends: 1421 [2020-10-15 21:59:56,974 INFO L226 Difference]: Without dead ends: 1011 [2020-10-15 21:59:56,974 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 21:59:56,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2020-10-15 21:59:56,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 991. [2020-10-15 21:59:56,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2020-10-15 21:59:56,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 2843 transitions. [2020-10-15 21:59:56,998 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 2843 transitions. Word has length 19 [2020-10-15 21:59:56,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:59:56,998 INFO L481 AbstractCegarLoop]: Abstraction has 991 states and 2843 transitions. [2020-10-15 21:59:56,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 21:59:56,999 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 2843 transitions. [2020-10-15 21:59:57,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 21:59:57,001 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:59:57,001 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:59:57,001 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 21:59:57,001 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:59:57,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:59:57,002 INFO L82 PathProgramCache]: Analyzing trace with hash 513726979, now seen corresponding path program 1 times [2020-10-15 21:59:57,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:59:57,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694049163] [2020-10-15 21:59:57,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:59:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:59:57,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:59:57,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694049163] [2020-10-15 21:59:57,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:59:57,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 21:59:57,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136843212] [2020-10-15 21:59:57,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 21:59:57,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:59:57,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 21:59:57,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 21:59:57,084 INFO L87 Difference]: Start difference. First operand 991 states and 2843 transitions. Second operand 6 states. [2020-10-15 21:59:57,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:59:57,163 INFO L93 Difference]: Finished difference Result 868 states and 2450 transitions. [2020-10-15 21:59:57,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 21:59:57,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-15 21:59:57,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:59:57,166 INFO L225 Difference]: With dead ends: 868 [2020-10-15 21:59:57,166 INFO L226 Difference]: Without dead ends: 761 [2020-10-15 21:59:57,167 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-15 21:59:57,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2020-10-15 21:59:57,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 745. [2020-10-15 21:59:57,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2020-10-15 21:59:57,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 2133 transitions. [2020-10-15 21:59:57,185 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 2133 transitions. Word has length 20 [2020-10-15 21:59:57,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:59:57,185 INFO L481 AbstractCegarLoop]: Abstraction has 745 states and 2133 transitions. [2020-10-15 21:59:57,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 21:59:57,185 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 2133 transitions. [2020-10-15 21:59:57,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-15 21:59:57,187 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:59:57,187 INFO L422 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] [2020-10-15 21:59:57,188 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-15 21:59:57,188 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:59:57,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:59:57,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1443499883, now seen corresponding path program 1 times [2020-10-15 21:59:57,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:59:57,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781855225] [2020-10-15 21:59:57,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:59:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:59:57,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:59:57,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781855225] [2020-10-15 21:59:57,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:59:57,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 21:59:57,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467277240] [2020-10-15 21:59:57,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 21:59:57,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:59:57,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 21:59:57,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-15 21:59:57,315 INFO L87 Difference]: Start difference. First operand 745 states and 2133 transitions. Second operand 9 states. [2020-10-15 21:59:57,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:59:57,449 INFO L93 Difference]: Finished difference Result 1033 states and 2849 transitions. [2020-10-15 21:59:57,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-15 21:59:57,450 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-15 21:59:57,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:59:57,454 INFO L225 Difference]: With dead ends: 1033 [2020-10-15 21:59:57,454 INFO L226 Difference]: Without dead ends: 745 [2020-10-15 21:59:57,457 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-10-15 21:59:57,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2020-10-15 21:59:57,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2020-10-15 21:59:57,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2020-10-15 21:59:57,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 2072 transitions. [2020-10-15 21:59:57,481 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 2072 transitions. Word has length 23 [2020-10-15 21:59:57,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:59:57,482 INFO L481 AbstractCegarLoop]: Abstraction has 745 states and 2072 transitions. [2020-10-15 21:59:57,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 21:59:57,482 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 2072 transitions. [2020-10-15 21:59:57,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-15 21:59:57,485 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:59:57,485 INFO L422 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] [2020-10-15 21:59:57,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-15 21:59:57,486 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:59:57,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:59:57,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1704617267, now seen corresponding path program 2 times [2020-10-15 21:59:57,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:59:57,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391506197] [2020-10-15 21:59:57,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:59:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:59:57,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:59:57,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391506197] [2020-10-15 21:59:57,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:59:57,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 21:59:57,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048846617] [2020-10-15 21:59:57,553 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 21:59:57,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:59:57,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 21:59:57,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 21:59:57,554 INFO L87 Difference]: Start difference. First operand 745 states and 2072 transitions. Second operand 4 states. [2020-10-15 21:59:57,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:59:57,577 INFO L93 Difference]: Finished difference Result 913 states and 2412 transitions. [2020-10-15 21:59:57,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 21:59:57,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-10-15 21:59:57,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:59:57,581 INFO L225 Difference]: With dead ends: 913 [2020-10-15 21:59:57,581 INFO L226 Difference]: Without dead ends: 683 [2020-10-15 21:59:57,582 INFO L677 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 [2020-10-15 21:59:57,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2020-10-15 21:59:57,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 673. [2020-10-15 21:59:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2020-10-15 21:59:57,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1765 transitions. [2020-10-15 21:59:57,604 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1765 transitions. Word has length 23 [2020-10-15 21:59:57,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:59:57,605 INFO L481 AbstractCegarLoop]: Abstraction has 673 states and 1765 transitions. [2020-10-15 21:59:57,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 21:59:57,605 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1765 transitions. [2020-10-15 21:59:57,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-15 21:59:57,607 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:59:57,608 INFO L422 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] [2020-10-15 21:59:57,608 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-15 21:59:57,608 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:59:57,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:59:57,608 INFO L82 PathProgramCache]: Analyzing trace with hash 2036096425, now seen corresponding path program 1 times [2020-10-15 21:59:57,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:59:57,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187091058] [2020-10-15 21:59:57,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:59:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:59:57,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:59:57,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187091058] [2020-10-15 21:59:57,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:59:57,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 21:59:57,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735179204] [2020-10-15 21:59:57,837 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 21:59:57,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:59:57,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 21:59:57,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-15 21:59:57,838 INFO L87 Difference]: Start difference. First operand 673 states and 1765 transitions. Second operand 7 states. [2020-10-15 21:59:57,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:59:57,953 INFO L93 Difference]: Finished difference Result 902 states and 2307 transitions. [2020-10-15 21:59:57,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 21:59:57,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-15 21:59:57,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:59:57,957 INFO L225 Difference]: With dead ends: 902 [2020-10-15 21:59:57,957 INFO L226 Difference]: Without dead ends: 766 [2020-10-15 21:59:57,958 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-15 21:59:57,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2020-10-15 21:59:57,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 673. [2020-10-15 21:59:57,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2020-10-15 21:59:57,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1729 transitions. [2020-10-15 21:59:57,976 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1729 transitions. Word has length 23 [2020-10-15 21:59:57,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:59:57,976 INFO L481 AbstractCegarLoop]: Abstraction has 673 states and 1729 transitions. [2020-10-15 21:59:57,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 21:59:57,976 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1729 transitions. [2020-10-15 21:59:57,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-15 21:59:57,978 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:59:57,978 INFO L422 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] [2020-10-15 21:59:57,978 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-15 21:59:57,979 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:59:57,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:59:57,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1350496215, now seen corresponding path program 2 times [2020-10-15 21:59:57,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:59:57,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556067083] [2020-10-15 21:59:57,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:59:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:59:58,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:59:58,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556067083] [2020-10-15 21:59:58,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:59:58,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 21:59:58,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080979541] [2020-10-15 21:59:58,131 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 21:59:58,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:59:58,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 21:59:58,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-15 21:59:58,132 INFO L87 Difference]: Start difference. First operand 673 states and 1729 transitions. Second operand 7 states. [2020-10-15 21:59:58,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:59:58,204 INFO L93 Difference]: Finished difference Result 644 states and 1672 transitions. [2020-10-15 21:59:58,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 21:59:58,205 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-15 21:59:58,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:59:58,206 INFO L225 Difference]: With dead ends: 644 [2020-10-15 21:59:58,206 INFO L226 Difference]: Without dead ends: 249 [2020-10-15 21:59:58,206 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-15 21:59:58,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-10-15 21:59:58,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 213. [2020-10-15 21:59:58,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-10-15 21:59:58,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 521 transitions. [2020-10-15 21:59:58,211 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 521 transitions. Word has length 23 [2020-10-15 21:59:58,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:59:58,212 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 521 transitions. [2020-10-15 21:59:58,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 21:59:58,212 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 521 transitions. [2020-10-15 21:59:58,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-15 21:59:58,213 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:59:58,213 INFO L422 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] [2020-10-15 21:59:58,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-15 21:59:58,213 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:59:58,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:59:58,213 INFO L82 PathProgramCache]: Analyzing trace with hash 2003939783, now seen corresponding path program 1 times [2020-10-15 21:59:58,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:59:58,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998616265] [2020-10-15 21:59:58,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:59:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:59:58,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:59:58,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998616265] [2020-10-15 21:59:58,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:59:58,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 21:59:58,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274116701] [2020-10-15 21:59:58,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 21:59:58,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:59:58,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 21:59:58,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 21:59:58,256 INFO L87 Difference]: Start difference. First operand 213 states and 521 transitions. Second operand 4 states. [2020-10-15 21:59:58,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:59:58,272 INFO L93 Difference]: Finished difference Result 264 states and 630 transitions. [2020-10-15 21:59:58,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 21:59:58,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-10-15 21:59:58,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:59:58,274 INFO L225 Difference]: With dead ends: 264 [2020-10-15 21:59:58,274 INFO L226 Difference]: Without dead ends: 64 [2020-10-15 21:59:58,274 INFO L677 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 [2020-10-15 21:59:58,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-15 21:59:58,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-10-15 21:59:58,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-15 21:59:58,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 122 transitions. [2020-10-15 21:59:58,276 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 122 transitions. Word has length 26 [2020-10-15 21:59:58,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:59:58,276 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 122 transitions. [2020-10-15 21:59:58,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 21:59:58,277 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 122 transitions. [2020-10-15 21:59:58,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-15 21:59:58,277 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:59:58,277 INFO L422 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] [2020-10-15 21:59:58,277 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-15 21:59:58,277 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:59:58,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:59:58,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1680604651, now seen corresponding path program 2 times [2020-10-15 21:59:58,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:59:58,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925175705] [2020-10-15 21:59:58,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:59:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 21:59:58,306 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 21:59:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 21:59:58,333 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 21:59:58,367 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 21:59:58,368 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 21:59:58,368 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-15 21:59:58,369 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-15 21:59:58,382 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L846-->L853: Formula: (let ((.cse6 (= (mod ~z$w_buff0_used~0_In1617567622 256) 0)) (.cse7 (= (mod ~z$r_buff0_thd0~0_In1617567622 256) 0)) (.cse9 (= 0 (mod ~z$r_buff1_thd0~0_In1617567622 256))) (.cse8 (= (mod ~z$w_buff1_used~0_In1617567622 256) 0))) (let ((.cse1 (not .cse8)) (.cse2 (not .cse9)) (.cse0 (or .cse8 .cse9)) (.cse3 (not .cse7)) (.cse4 (not .cse6)) (.cse5 (or .cse6 .cse7))) (and (= ~z$r_buff0_thd0~0_In1617567622 ~z$r_buff0_thd0~0_Out1617567622) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1617567622 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1617567622|) (or (and .cse0 (= ~z$w_buff1_used~0_In1617567622 ~z$w_buff1_used~0_Out1617567622)) (and (= ~z$w_buff1_used~0_Out1617567622 0) .cse1 .cse2)) (or (and .cse3 (= ~z~0_Out1617567622 ~z$w_buff0~0_In1617567622) .cse4) (and (or (and (= ~z$w_buff1~0_In1617567622 ~z~0_Out1617567622) .cse1 .cse2) (and .cse0 (= ~z~0_In1617567622 ~z~0_Out1617567622))) .cse5)) (= ~z$r_buff1_thd0~0_Out1617567622 ~z$r_buff1_thd0~0_In1617567622) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1617567622 0)) (or (and (= ~z$w_buff0_used~0_Out1617567622 0) .cse3 .cse4) (and (= ~z$w_buff0_used~0_In1617567622 ~z$w_buff0_used~0_Out1617567622) .cse5))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1617567622|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1617567622, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1617567622, ~z$w_buff0~0=~z$w_buff0~0_In1617567622, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1617567622, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1617567622, ~z$w_buff1~0=~z$w_buff1~0_In1617567622, ~z~0=~z~0_In1617567622} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out1617567622, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1617567622|, ~z$w_buff0~0=~z$w_buff0~0_In1617567622, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1617567622|, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1617567622, ~z$w_buff1~0=~z$w_buff1~0_In1617567622, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1617567622|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1617567622|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1617567622|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1617567622|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1617567622|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out1617567622, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1617567622, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1617567622, ~z~0=~z~0_Out1617567622} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-15 21:59:58,388 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:59:58,389 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:59:58,391 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:59:58,391 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:59:58,391 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:59:58,391 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:59:58,391 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:59:58,392 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:59:58,392 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:59:58,392 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:59:58,392 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:59:58,392 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:59:58,392 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:59:58,393 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:59:58,393 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:59:58,393 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:59:58,393 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:59:58,393 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:59:58,394 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:59:58,394 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:59:58,394 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:59:58,394 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:59:58,394 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:59:58,394 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:59:58,395 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:59:58,395 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:59:58,395 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:59:58,396 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:59:58,396 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:59:58,396 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:59:58,396 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:59:58,396 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:59:58,396 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:59:58,396 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:59:58,397 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:59:58,397 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:59:58,397 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:59:58,397 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:59:58,397 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:59:58,397 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:59:58,398 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:59:58,398 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:59:58,398 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:59:58,398 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:59:58,398 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:59:58,398 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:59:58,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 09:59:58 BasicIcfg [2020-10-15 21:59:58,481 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 21:59:58,483 INFO L168 Benchmark]: Toolchain (without parser) took 17835.94 ms. Allocated memory was 257.4 MB in the beginning and 611.8 MB in the end (delta: 354.4 MB). Free memory was 210.1 MB in the beginning and 455.0 MB in the end (delta: -244.9 MB). Peak memory consumption was 109.5 MB. Max. memory is 14.2 GB. [2020-10-15 21:59:58,483 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 257.4 MB. Free memory is still 231.3 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 21:59:58,484 INFO L168 Benchmark]: CACSL2BoogieTranslator took 744.20 ms. Allocated memory was 257.4 MB in the beginning and 328.7 MB in the end (delta: 71.3 MB). Free memory was 210.1 MB in the beginning and 274.5 MB in the end (delta: -64.5 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB. [2020-10-15 21:59:58,484 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.35 ms. Allocated memory is still 328.7 MB. Free memory was 274.5 MB in the beginning and 272.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 21:59:58,485 INFO L168 Benchmark]: Boogie Preprocessor took 38.32 ms. Allocated memory is still 328.7 MB. Free memory was 272.0 MB in the beginning and 269.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 21:59:58,485 INFO L168 Benchmark]: RCFGBuilder took 1762.58 ms. Allocated memory was 328.7 MB in the beginning and 367.0 MB in the end (delta: 38.3 MB). Free memory was 269.5 MB in the beginning and 211.5 MB in the end (delta: 58.0 MB). Peak memory consumption was 96.3 MB. Max. memory is 14.2 GB. [2020-10-15 21:59:58,486 INFO L168 Benchmark]: TraceAbstraction took 15220.84 ms. Allocated memory was 367.0 MB in the beginning and 611.8 MB in the end (delta: 244.8 MB). Free memory was 211.5 MB in the beginning and 455.0 MB in the end (delta: -243.5 MB). Peak memory consumption was 1.3 MB. Max. memory is 14.2 GB. [2020-10-15 21:59:58,494 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 257.4 MB. Free memory is still 231.3 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 744.20 ms. Allocated memory was 257.4 MB in the beginning and 328.7 MB in the end (delta: 71.3 MB). Free memory was 210.1 MB in the beginning and 274.5 MB in the end (delta: -64.5 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 65.35 ms. Allocated memory is still 328.7 MB. Free memory was 274.5 MB in the beginning and 272.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 38.32 ms. Allocated memory is still 328.7 MB. Free memory was 272.0 MB in the beginning and 269.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1762.58 ms. Allocated memory was 328.7 MB in the beginning and 367.0 MB in the end (delta: 38.3 MB). Free memory was 269.5 MB in the beginning and 211.5 MB in the end (delta: 58.0 MB). Peak memory consumption was 96.3 MB. Max. memory is 14.2 GB. * TraceAbstraction took 15220.84 ms. Allocated memory was 367.0 MB in the beginning and 611.8 MB in the end (delta: 244.8 MB). Free memory was 211.5 MB in the beginning and 455.0 MB in the end (delta: -243.5 MB). Peak memory consumption was 1.3 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1746 VarBasedMoverChecksPositive, 95 VarBasedMoverChecksNegative, 31 SemBasedMoverChecksPositive, 64 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 233 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.6s, 123 PlacesBefore, 45 PlacesAfterwards, 112 TransitionsBefore, 33 TransitionsAfterwards, 2540 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 93 TotalNumberOfCompositions, 6932 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p3_EAX = 0; [L705] 0 int __unbuffered_p3_EBX = 0; [L707] 0 int a = 0; [L709] 0 int b = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff0_thd4; [L725] 0 _Bool z$r_buff1_thd0; [L726] 0 _Bool z$r_buff1_thd1; [L727] 0 _Bool z$r_buff1_thd2; [L728] 0 _Bool z$r_buff1_thd3; [L729] 0 _Bool z$r_buff1_thd4; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L835] 0 pthread_t t1245; [L836] FCALL, FORK 0 pthread_create(&t1245, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] 0 pthread_t t1246; [L838] FCALL, FORK 0 pthread_create(&t1246, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] 0 pthread_t t1247; [L840] FCALL, FORK 0 pthread_create(&t1247, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 0 pthread_t t1248; [L842] FCALL, FORK 0 pthread_create(&t1248, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 4 z$w_buff1 = z$w_buff0 [L792] 4 z$w_buff0 = 2 [L793] 4 z$w_buff1_used = z$w_buff0_used [L794] 4 z$w_buff0_used = (_Bool)1 [L7] COND FALSE 4 !(!expression) [L796] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L797] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L798] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L799] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L800] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L801] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 4 a = 1 [L807] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L759] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 2 return 0; [L771] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L777] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L777] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L777] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L778] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L778] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L779] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L779] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L780] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L780] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L781] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L781] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L784] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 3 return 0; [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L817] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L817] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L820] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 4 return 0; [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L855] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L856] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L857] 0 z$flush_delayed = weak$$choice2 [L858] 0 z$mem_tmp = z [L859] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L860] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L861] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L861] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L862] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L863] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L864] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L865] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L867] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L867] 0 z = z$flush_delayed ? z$mem_tmp : z [L868] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 111 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.9s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.8s, HoareTripleCheckerStatistics: 652 SDtfs, 804 SDslu, 1095 SDs, 0 SdLazy, 473 SolverSat, 127 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3002occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 847 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 347 NumberOfCodeBlocks, 347 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 302 ConstructedInterpolants, 0 QuantifiedInterpolants, 37837 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...