/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/safe008_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 22:09:36,289 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 22:09:36,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 22:09:36,330 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 22:09:36,330 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 22:09:36,338 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 22:09:36,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 22:09:36,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 22:09:36,348 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 22:09:36,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 22:09:36,350 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 22:09:36,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 22:09:36,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 22:09:36,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 22:09:36,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 22:09:36,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 22:09:36,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 22:09:36,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 22:09:36,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 22:09:36,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 22:09:36,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 22:09:36,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 22:09:36,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 22:09:36,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 22:09:36,365 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 22:09:36,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 22:09:36,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 22:09:36,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 22:09:36,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 22:09:36,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 22:09:36,367 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 22:09:36,368 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 22:09:36,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 22:09:36,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 22:09:36,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 22:09:36,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 22:09:36,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 22:09:36,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 22:09:36,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 22:09:36,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 22:09:36,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 22:09:36,374 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 22:09:36,395 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 22:09:36,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 22:09:36,397 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 22:09:36,397 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 22:09:36,397 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 22:09:36,397 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 22:09:36,398 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 22:09:36,398 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 22:09:36,398 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 22:09:36,398 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 22:09:36,398 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 22:09:36,398 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 22:09:36,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 22:09:36,399 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 22:09:36,399 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 22:09:36,399 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 22:09:36,399 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 22:09:36,400 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 22:09:36,400 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 22:09:36,400 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 22:09:36,400 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 22:09:36,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 22:09:36,400 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 22:09:36,401 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 22:09:36,401 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 22:09:36,401 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 22:09:36,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 22:09:36,401 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 22:09:36,402 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 22:09:36,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 22:09:36,738 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 22:09:36,742 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 22:09:36,743 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 22:09:36,744 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 22:09:36,744 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_rmo.oepc.i [2020-10-15 22:09:36,811 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/722aaf567/a18c8788a9534244a44f129e0411d4fb/FLAG803100858 [2020-10-15 22:09:37,326 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 22:09:37,327 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_rmo.oepc.i [2020-10-15 22:09:37,354 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/722aaf567/a18c8788a9534244a44f129e0411d4fb/FLAG803100858 [2020-10-15 22:09:37,615 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/722aaf567/a18c8788a9534244a44f129e0411d4fb [2020-10-15 22:09:37,625 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 22:09:37,627 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 22:09:37,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 22:09:37,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 22:09:37,632 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 22:09:37,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 10:09:37" (1/1) ... [2020-10-15 22:09:37,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b72f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:09:37, skipping insertion in model container [2020-10-15 22:09:37,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 10:09:37" (1/1) ... [2020-10-15 22:09:37,645 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 22:09:37,722 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 22:09:38,272 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 22:09:38,287 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 22:09:38,350 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 22:09:38,431 INFO L208 MainTranslator]: Completed translation [2020-10-15 22:09:38,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:09:38 WrapperNode [2020-10-15 22:09:38,432 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 22:09:38,433 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 22:09:38,433 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 22:09:38,433 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 22:09:38,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:09:38" (1/1) ... [2020-10-15 22:09:38,465 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:09:38" (1/1) ... [2020-10-15 22:09:38,502 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 22:09:38,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 22:09:38,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 22:09:38,503 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 22:09:38,511 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:09:38" (1/1) ... [2020-10-15 22:09:38,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:09:38" (1/1) ... [2020-10-15 22:09:38,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:09:38" (1/1) ... [2020-10-15 22:09:38,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:09:38" (1/1) ... [2020-10-15 22:09:38,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:09:38" (1/1) ... [2020-10-15 22:09:38,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:09:38" (1/1) ... [2020-10-15 22:09:38,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:09:38" (1/1) ... [2020-10-15 22:09:38,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 22:09:38,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 22:09:38,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 22:09:38,548 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 22:09:38,549 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:09:38" (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 22:09:38,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 22:09:38,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-15 22:09:38,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 22:09:38,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 22:09:38,630 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-15 22:09:38,631 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-15 22:09:38,631 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-15 22:09:38,632 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-15 22:09:38,632 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-15 22:09:38,633 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-15 22:09:38,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-15 22:09:38,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 22:09:38,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 22:09:38,637 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 22:09:40,656 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 22:09:40,656 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-15 22:09:40,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 10:09:40 BoogieIcfgContainer [2020-10-15 22:09:40,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 22:09:40,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 22:09:40,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 22:09:40,663 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 22:09:40,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 10:09:37" (1/3) ... [2020-10-15 22:09:40,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc19c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 10:09:40, skipping insertion in model container [2020-10-15 22:09:40,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:09:38" (2/3) ... [2020-10-15 22:09:40,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc19c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 10:09:40, skipping insertion in model container [2020-10-15 22:09:40,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 10:09:40" (3/3) ... [2020-10-15 22:09:40,667 INFO L111 eAbstractionObserver]: Analyzing ICFG safe008_rmo.oepc.i [2020-10-15 22:09:40,679 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 22:09:40,679 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 22:09:40,687 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-15 22:09:40,688 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 22:09:40,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,717 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,718 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,718 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,719 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,723 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,723 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,726 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,726 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,734 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,734 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,740 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,740 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,740 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,741 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,742 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,742 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,744 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,744 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,745 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,745 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,745 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,745 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:09:40,761 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-15 22:09:40,783 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 22:09:40,783 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 22:09:40,784 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 22:09:40,784 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 22:09:40,784 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 22:09:40,784 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 22:09:40,784 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 22:09:40,784 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 22:09:40,798 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 22:09:40,801 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 93 transitions, 201 flow [2020-10-15 22:09:40,804 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 93 transitions, 201 flow [2020-10-15 22:09:40,806 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 201 flow [2020-10-15 22:09:40,853 INFO L129 PetriNetUnfolder]: 2/90 cut-off events. [2020-10-15 22:09:40,854 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-15 22:09:40,859 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-15 22:09:40,862 INFO L117 LiptonReduction]: Number of co-enabled transitions 1650 [2020-10-15 22:09:41,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 22:09:41,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:41,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:41,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:41,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:41,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:41,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:41,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:41,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:41,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:41,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:41,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:41,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:41,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:41,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:41,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:41,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:41,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:41,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:41,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:41,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:41,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:41,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:41,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:41,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:41,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:41,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:41,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:41,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:41,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:41,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:41,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:41,346 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:41,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:41,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:41,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:41,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:41,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:41,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:41,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:41,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:41,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:41,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:41,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:41,687 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:41,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:41,690 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:41,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:41,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:41,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:41,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:09:41,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:09:41,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 22:09:41,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:09:41,812 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:09:41,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:09:41,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 22:09:41,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:09:43,625 WARN L193 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2020-10-15 22:09:43,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-15 22:09:43,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:09:43,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 22:09:43,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:09:44,514 WARN L193 SmtUtils]: Spent 848.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2020-10-15 22:09:44,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 22:09:44,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:44,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:44,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:44,783 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:44,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:44,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:44,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:44,791 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:44,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:44,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:44,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:44,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:44,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:44,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:44,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:44,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:44,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:45,211 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-15 22:09:45,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:45,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:45,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:45,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:45,401 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:45,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:45,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:45,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:45,424 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:45,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:45,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:45,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:45,427 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:45,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:45,429 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:45,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:45,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 22:09:45,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:45,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:45,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:45,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:45,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:45,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:45,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:45,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:45,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:45,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:45,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:45,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:45,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:45,663 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:45,663 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:45,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:45,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:45,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:45,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:45,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:45,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:45,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:45,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:45,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:45,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:45,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:45,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:45,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:45,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:45,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:45,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:45,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:45,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:45,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:45,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:45,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:45,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:45,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:45,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:09:45,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:45,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:09:45,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:45,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:45,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:45,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:45,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:45,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:45,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:45,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:45,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:45,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:45,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:45,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:45,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:45,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:45,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:45,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:45,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:45,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:45,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:45,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:45,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:45,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:45,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:45,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:45,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 22:09:45,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:46,025 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:46,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:46,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:46,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:46,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:46,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:46,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:46,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:46,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:46,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:46,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:46,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:46,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:46,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:46,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:46,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:46,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:46,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:46,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:46,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:46,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:46,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:46,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:46,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:09:46,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:46,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:46,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:46,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:09:46,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:09:46,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:09:46,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:09:46,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:09:46,739 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-15 22:09:46,978 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2020-10-15 22:09:47,093 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-15 22:09:47,100 INFO L132 LiptonReduction]: Checked pairs total: 4614 [2020-10-15 22:09:47,100 INFO L134 LiptonReduction]: Total number of compositions: 75 [2020-10-15 22:09:47,109 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2020-10-15 22:09:47,197 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 974 states. [2020-10-15 22:09:47,199 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states. [2020-10-15 22:09:47,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-15 22:09:47,208 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:09:47,209 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-15 22:09:47,209 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:09:47,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:09:47,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1042200, now seen corresponding path program 1 times [2020-10-15 22:09:47,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:09:47,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230936966] [2020-10-15 22:09:47,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:09:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:09:47,464 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 22:09:47,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230936966] [2020-10-15 22:09:47,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:09:47,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 22:09:47,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23490213] [2020-10-15 22:09:47,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 22:09:47,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:09:47,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 22:09:47,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:09:47,491 INFO L87 Difference]: Start difference. First operand 974 states. Second operand 3 states. [2020-10-15 22:09:47,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:09:47,592 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2020-10-15 22:09:47,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 22:09:47,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-15 22:09:47,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:09:47,635 INFO L225 Difference]: With dead ends: 812 [2020-10-15 22:09:47,636 INFO L226 Difference]: Without dead ends: 687 [2020-10-15 22:09:47,638 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 22:09:47,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-10-15 22:09:47,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2020-10-15 22:09:47,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2020-10-15 22:09:47,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions. [2020-10-15 22:09:47,751 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 3 [2020-10-15 22:09:47,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:09:47,751 INFO L481 AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions. [2020-10-15 22:09:47,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 22:09:47,752 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions. [2020-10-15 22:09:47,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-15 22:09:47,754 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:09:47,754 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:09:47,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 22:09:47,755 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:09:47,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:09:47,755 INFO L82 PathProgramCache]: Analyzing trace with hash -703108047, now seen corresponding path program 1 times [2020-10-15 22:09:47,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:09:47,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083195136] [2020-10-15 22:09:47,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:09:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:09:47,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 22:09:47,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083195136] [2020-10-15 22:09:47,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:09:47,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 22:09:47,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668929617] [2020-10-15 22:09:47,955 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 22:09:47,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:09:47,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 22:09:47,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 22:09:47,957 INFO L87 Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand 4 states. [2020-10-15 22:09:48,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:09:48,046 INFO L93 Difference]: Finished difference Result 802 states and 2417 transitions. [2020-10-15 22:09:48,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:09:48,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-15 22:09:48,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:09:48,055 INFO L225 Difference]: With dead ends: 802 [2020-10-15 22:09:48,055 INFO L226 Difference]: Without dead ends: 677 [2020-10-15 22:09:48,056 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 22:09:48,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2020-10-15 22:09:48,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 677. [2020-10-15 22:09:48,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2020-10-15 22:09:48,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 2112 transitions. [2020-10-15 22:09:48,093 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 2112 transitions. Word has length 10 [2020-10-15 22:09:48,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:09:48,094 INFO L481 AbstractCegarLoop]: Abstraction has 677 states and 2112 transitions. [2020-10-15 22:09:48,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 22:09:48,094 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 2112 transitions. [2020-10-15 22:09:48,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 22:09:48,097 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:09:48,097 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:09:48,097 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 22:09:48,097 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:09:48,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:09:48,098 INFO L82 PathProgramCache]: Analyzing trace with hash 478511466, now seen corresponding path program 1 times [2020-10-15 22:09:48,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:09:48,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16169415] [2020-10-15 22:09:48,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:09:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:09:48,228 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 22:09:48,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16169415] [2020-10-15 22:09:48,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:09:48,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 22:09:48,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570806168] [2020-10-15 22:09:48,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 22:09:48,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:09:48,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 22:09:48,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 22:09:48,231 INFO L87 Difference]: Start difference. First operand 677 states and 2112 transitions. Second operand 4 states. [2020-10-15 22:09:48,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:09:48,272 INFO L93 Difference]: Finished difference Result 737 states and 2225 transitions. [2020-10-15 22:09:48,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:09:48,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-15 22:09:48,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:09:48,278 INFO L225 Difference]: With dead ends: 737 [2020-10-15 22:09:48,278 INFO L226 Difference]: Without dead ends: 637 [2020-10-15 22:09:48,279 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 22:09:48,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-10-15 22:09:48,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2020-10-15 22:09:48,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2020-10-15 22:09:48,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 1970 transitions. [2020-10-15 22:09:48,302 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 1970 transitions. Word has length 11 [2020-10-15 22:09:48,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:09:48,302 INFO L481 AbstractCegarLoop]: Abstraction has 637 states and 1970 transitions. [2020-10-15 22:09:48,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 22:09:48,303 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1970 transitions. [2020-10-15 22:09:48,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 22:09:48,305 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:09:48,305 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:09:48,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 22:09:48,305 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:09:48,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:09:48,306 INFO L82 PathProgramCache]: Analyzing trace with hash -363739686, now seen corresponding path program 1 times [2020-10-15 22:09:48,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:09:48,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882587877] [2020-10-15 22:09:48,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:09:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:09:48,410 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 22:09:48,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882587877] [2020-10-15 22:09:48,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:09:48,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:09:48,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770747396] [2020-10-15 22:09:48,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 22:09:48,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:09:48,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 22:09:48,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:09:48,413 INFO L87 Difference]: Start difference. First operand 637 states and 1970 transitions. Second operand 5 states. [2020-10-15 22:09:48,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:09:48,511 INFO L93 Difference]: Finished difference Result 729 states and 2179 transitions. [2020-10-15 22:09:48,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:09:48,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-15 22:09:48,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:09:48,517 INFO L225 Difference]: With dead ends: 729 [2020-10-15 22:09:48,517 INFO L226 Difference]: Without dead ends: 629 [2020-10-15 22:09:48,518 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:09:48,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-10-15 22:09:48,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2020-10-15 22:09:48,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2020-10-15 22:09:48,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1940 transitions. [2020-10-15 22:09:48,543 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1940 transitions. Word has length 11 [2020-10-15 22:09:48,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:09:48,543 INFO L481 AbstractCegarLoop]: Abstraction has 629 states and 1940 transitions. [2020-10-15 22:09:48,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 22:09:48,543 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1940 transitions. [2020-10-15 22:09:48,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 22:09:48,545 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:09:48,545 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:09:48,546 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 22:09:48,546 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:09:48,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:09:48,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1906726849, now seen corresponding path program 1 times [2020-10-15 22:09:48,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:09:48,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511370344] [2020-10-15 22:09:48,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:09:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:09:48,681 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 22:09:48,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511370344] [2020-10-15 22:09:48,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:09:48,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:09:48,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313460669] [2020-10-15 22:09:48,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 22:09:48,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:09:48,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 22:09:48,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:09:48,684 INFO L87 Difference]: Start difference. First operand 629 states and 1940 transitions. Second operand 5 states. [2020-10-15 22:09:48,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:09:48,744 INFO L93 Difference]: Finished difference Result 677 states and 2028 transitions. [2020-10-15 22:09:48,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:09:48,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-15 22:09:48,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:09:48,750 INFO L225 Difference]: With dead ends: 677 [2020-10-15 22:09:48,750 INFO L226 Difference]: Without dead ends: 597 [2020-10-15 22:09:48,750 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:09:48,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-10-15 22:09:48,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2020-10-15 22:09:48,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2020-10-15 22:09:48,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1828 transitions. [2020-10-15 22:09:48,773 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1828 transitions. Word has length 12 [2020-10-15 22:09:48,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:09:48,774 INFO L481 AbstractCegarLoop]: Abstraction has 597 states and 1828 transitions. [2020-10-15 22:09:48,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 22:09:48,774 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1828 transitions. [2020-10-15 22:09:48,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 22:09:48,776 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:09:48,776 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:09:48,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 22:09:48,776 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:09:48,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:09:48,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1500736766, now seen corresponding path program 1 times [2020-10-15 22:09:48,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:09:48,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134539178] [2020-10-15 22:09:48,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:09:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:09:48,910 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 22:09:48,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134539178] [2020-10-15 22:09:48,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:09:48,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:09:48,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170674226] [2020-10-15 22:09:48,912 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 22:09:48,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:09:48,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 22:09:48,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:09:48,914 INFO L87 Difference]: Start difference. First operand 597 states and 1828 transitions. Second operand 5 states. [2020-10-15 22:09:49,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:09:49,097 INFO L93 Difference]: Finished difference Result 705 states and 2109 transitions. [2020-10-15 22:09:49,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 22:09:49,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-15 22:09:49,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:09:49,106 INFO L225 Difference]: With dead ends: 705 [2020-10-15 22:09:49,106 INFO L226 Difference]: Without dead ends: 625 [2020-10-15 22:09:49,107 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-15 22:09:49,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-10-15 22:09:49,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2020-10-15 22:09:49,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2020-10-15 22:09:49,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 1909 transitions. [2020-10-15 22:09:49,127 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 1909 transitions. Word has length 12 [2020-10-15 22:09:49,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:09:49,128 INFO L481 AbstractCegarLoop]: Abstraction has 625 states and 1909 transitions. [2020-10-15 22:09:49,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 22:09:49,128 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 1909 transitions. [2020-10-15 22:09:49,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 22:09:49,129 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:09:49,130 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:09:49,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 22:09:49,130 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:09:49,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:09:49,130 INFO L82 PathProgramCache]: Analyzing trace with hash 164249083, now seen corresponding path program 1 times [2020-10-15 22:09:49,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:09:49,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691497215] [2020-10-15 22:09:49,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:09:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:09:49,278 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 22:09:49,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691497215] [2020-10-15 22:09:49,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:09:49,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 22:09:49,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694496897] [2020-10-15 22:09:49,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 22:09:49,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:09:49,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 22:09:49,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-15 22:09:49,282 INFO L87 Difference]: Start difference. First operand 625 states and 1909 transitions. Second operand 7 states. [2020-10-15 22:09:49,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:09:49,543 INFO L93 Difference]: Finished difference Result 757 states and 2297 transitions. [2020-10-15 22:09:49,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-15 22:09:49,544 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-10-15 22:09:49,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:09:49,550 INFO L225 Difference]: With dead ends: 757 [2020-10-15 22:09:49,550 INFO L226 Difference]: Without dead ends: 693 [2020-10-15 22:09:49,551 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-10-15 22:09:49,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2020-10-15 22:09:49,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 661. [2020-10-15 22:09:49,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2020-10-15 22:09:49,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 2041 transitions. [2020-10-15 22:09:49,575 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 2041 transitions. Word has length 13 [2020-10-15 22:09:49,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:09:49,576 INFO L481 AbstractCegarLoop]: Abstraction has 661 states and 2041 transitions. [2020-10-15 22:09:49,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 22:09:49,576 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 2041 transitions. [2020-10-15 22:09:49,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 22:09:49,577 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:09:49,577 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:09:49,578 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 22:09:49,578 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:09:49,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:09:49,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1511603118, now seen corresponding path program 1 times [2020-10-15 22:09:49,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:09:49,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096476437] [2020-10-15 22:09:49,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:09:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:09:49,741 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 22:09:49,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096476437] [2020-10-15 22:09:49,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:09:49,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:09:49,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663700265] [2020-10-15 22:09:49,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 22:09:49,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:09:49,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 22:09:49,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:09:49,744 INFO L87 Difference]: Start difference. First operand 661 states and 2041 transitions. Second operand 5 states. [2020-10-15 22:09:49,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:09:49,856 INFO L93 Difference]: Finished difference Result 715 states and 2155 transitions. [2020-10-15 22:09:49,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:09:49,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-15 22:09:49,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:09:49,862 INFO L225 Difference]: With dead ends: 715 [2020-10-15 22:09:49,863 INFO L226 Difference]: Without dead ends: 655 [2020-10-15 22:09:49,864 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:09:49,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2020-10-15 22:09:49,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2020-10-15 22:09:49,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2020-10-15 22:09:49,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 2019 transitions. [2020-10-15 22:09:49,885 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 2019 transitions. Word has length 13 [2020-10-15 22:09:49,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:09:49,885 INFO L481 AbstractCegarLoop]: Abstraction has 655 states and 2019 transitions. [2020-10-15 22:09:49,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 22:09:49,885 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 2019 transitions. [2020-10-15 22:09:49,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 22:09:49,887 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:09:49,887 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:09:49,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 22:09:49,887 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:09:49,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:09:49,888 INFO L82 PathProgramCache]: Analyzing trace with hash 690656053, now seen corresponding path program 2 times [2020-10-15 22:09:49,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:09:49,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183495292] [2020-10-15 22:09:49,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:09:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:09:49,995 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 22:09:49,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183495292] [2020-10-15 22:09:49,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:09:49,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 22:09:49,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580285979] [2020-10-15 22:09:49,996 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 22:09:49,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:09:49,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 22:09:49,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:09:49,997 INFO L87 Difference]: Start difference. First operand 655 states and 2019 transitions. Second operand 6 states. [2020-10-15 22:09:50,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:09:50,179 INFO L93 Difference]: Finished difference Result 1006 states and 3077 transitions. [2020-10-15 22:09:50,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 22:09:50,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-15 22:09:50,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:09:50,184 INFO L225 Difference]: With dead ends: 1006 [2020-10-15 22:09:50,184 INFO L226 Difference]: Without dead ends: 533 [2020-10-15 22:09:50,185 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-15 22:09:50,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-10-15 22:09:50,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2020-10-15 22:09:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2020-10-15 22:09:50,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 1616 transitions. [2020-10-15 22:09:50,201 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 1616 transitions. Word has length 13 [2020-10-15 22:09:50,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:09:50,201 INFO L481 AbstractCegarLoop]: Abstraction has 533 states and 1616 transitions. [2020-10-15 22:09:50,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 22:09:50,201 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 1616 transitions. [2020-10-15 22:09:50,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 22:09:50,202 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:09:50,203 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:09:50,203 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 22:09:50,203 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:09:50,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:09:50,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1637780923, now seen corresponding path program 3 times [2020-10-15 22:09:50,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:09:50,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455164725] [2020-10-15 22:09:50,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:09:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:09:50,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 22:09:50,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455164725] [2020-10-15 22:09:50,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:09:50,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 22:09:50,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229762386] [2020-10-15 22:09:50,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 22:09:50,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:09:50,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 22:09:50,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:09:50,316 INFO L87 Difference]: Start difference. First operand 533 states and 1616 transitions. Second operand 6 states. [2020-10-15 22:09:50,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:09:50,494 INFO L93 Difference]: Finished difference Result 781 states and 2333 transitions. [2020-10-15 22:09:50,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 22:09:50,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-15 22:09:50,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:09:50,499 INFO L225 Difference]: With dead ends: 781 [2020-10-15 22:09:50,499 INFO L226 Difference]: Without dead ends: 421 [2020-10-15 22:09:50,499 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-15 22:09:50,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2020-10-15 22:09:50,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2020-10-15 22:09:50,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-10-15 22:09:50,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1222 transitions. [2020-10-15 22:09:50,511 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1222 transitions. Word has length 13 [2020-10-15 22:09:50,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:09:50,511 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 1222 transitions. [2020-10-15 22:09:50,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 22:09:50,511 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1222 transitions. [2020-10-15 22:09:50,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 22:09:50,512 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:09:50,512 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:09:50,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 22:09:50,513 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:09:50,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:09:50,513 INFO L82 PathProgramCache]: Analyzing trace with hash 2036260720, now seen corresponding path program 1 times [2020-10-15 22:09:50,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:09:50,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431441064] [2020-10-15 22:09:50,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:09:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:09:50,620 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 22:09:50,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431441064] [2020-10-15 22:09:50,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:09:50,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 22:09:50,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081851395] [2020-10-15 22:09:50,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 22:09:50,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:09:50,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 22:09:50,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:09:50,622 INFO L87 Difference]: Start difference. First operand 421 states and 1222 transitions. Second operand 6 states. [2020-10-15 22:09:50,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:09:50,772 INFO L93 Difference]: Finished difference Result 639 states and 1846 transitions. [2020-10-15 22:09:50,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:09:50,773 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-15 22:09:50,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:09:50,776 INFO L225 Difference]: With dead ends: 639 [2020-10-15 22:09:50,776 INFO L226 Difference]: Without dead ends: 387 [2020-10-15 22:09:50,776 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-15 22:09:50,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2020-10-15 22:09:50,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2020-10-15 22:09:50,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-10-15 22:09:50,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1114 transitions. [2020-10-15 22:09:50,790 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1114 transitions. Word has length 14 [2020-10-15 22:09:50,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:09:50,790 INFO L481 AbstractCegarLoop]: Abstraction has 387 states and 1114 transitions. [2020-10-15 22:09:50,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 22:09:50,791 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1114 transitions. [2020-10-15 22:09:50,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 22:09:50,792 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:09:50,792 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:09:50,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 22:09:50,793 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:09:50,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:09:50,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1052148230, now seen corresponding path program 1 times [2020-10-15 22:09:50,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:09:50,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945876275] [2020-10-15 22:09:50,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:09:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:09:50,906 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 22:09:50,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945876275] [2020-10-15 22:09:50,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:09:50,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 22:09:50,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145315078] [2020-10-15 22:09:50,908 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 22:09:50,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:09:50,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 22:09:50,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:09:50,909 INFO L87 Difference]: Start difference. First operand 387 states and 1114 transitions. Second operand 6 states. [2020-10-15 22:09:50,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:09:50,985 INFO L93 Difference]: Finished difference Result 513 states and 1459 transitions. [2020-10-15 22:09:50,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 22:09:50,986 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-15 22:09:50,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:09:50,989 INFO L225 Difference]: With dead ends: 513 [2020-10-15 22:09:50,989 INFO L226 Difference]: Without dead ends: 277 [2020-10-15 22:09:50,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-15 22:09:50,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-10-15 22:09:50,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2020-10-15 22:09:50,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2020-10-15 22:09:50,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 754 transitions. [2020-10-15 22:09:50,998 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 754 transitions. Word has length 15 [2020-10-15 22:09:50,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:09:50,998 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 754 transitions. [2020-10-15 22:09:50,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 22:09:50,999 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 754 transitions. [2020-10-15 22:09:50,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 22:09:50,999 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:09:51,000 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:09:51,000 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 22:09:51,000 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:09:51,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:09:51,001 INFO L82 PathProgramCache]: Analyzing trace with hash -206433700, now seen corresponding path program 1 times [2020-10-15 22:09:51,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:09:51,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825504265] [2020-10-15 22:09:51,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:09:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:09:51,085 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 22:09:51,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825504265] [2020-10-15 22:09:51,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:09:51,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:09:51,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126797423] [2020-10-15 22:09:51,087 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 22:09:51,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:09:51,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 22:09:51,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:09:51,088 INFO L87 Difference]: Start difference. First operand 277 states and 754 transitions. Second operand 5 states. [2020-10-15 22:09:51,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:09:51,196 INFO L93 Difference]: Finished difference Result 311 states and 822 transitions. [2020-10-15 22:09:51,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 22:09:51,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-15 22:09:51,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:09:51,200 INFO L225 Difference]: With dead ends: 311 [2020-10-15 22:09:51,200 INFO L226 Difference]: Without dead ends: 275 [2020-10-15 22:09:51,201 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-15 22:09:51,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-10-15 22:09:51,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2020-10-15 22:09:51,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2020-10-15 22:09:51,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 746 transitions. [2020-10-15 22:09:51,208 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 746 transitions. Word has length 15 [2020-10-15 22:09:51,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:09:51,209 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 746 transitions. [2020-10-15 22:09:51,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 22:09:51,209 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 746 transitions. [2020-10-15 22:09:51,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 22:09:51,210 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:09:51,210 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:09:51,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 22:09:51,210 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:09:51,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:09:51,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1762021450, now seen corresponding path program 1 times [2020-10-15 22:09:51,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:09:51,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251007839] [2020-10-15 22:09:51,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:09:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:09:51,272 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 22:09:51,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251007839] [2020-10-15 22:09:51,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:09:51,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:09:51,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599194163] [2020-10-15 22:09:51,273 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 22:09:51,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:09:51,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 22:09:51,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 22:09:51,274 INFO L87 Difference]: Start difference. First operand 275 states and 746 transitions. Second operand 4 states. [2020-10-15 22:09:51,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:09:51,341 INFO L93 Difference]: Finished difference Result 262 states and 628 transitions. [2020-10-15 22:09:51,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:09:51,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-15 22:09:51,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:09:51,343 INFO L225 Difference]: With dead ends: 262 [2020-10-15 22:09:51,343 INFO L226 Difference]: Without dead ends: 209 [2020-10-15 22:09:51,343 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 22:09:51,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-10-15 22:09:51,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2020-10-15 22:09:51,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-10-15 22:09:51,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 498 transitions. [2020-10-15 22:09:51,349 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 498 transitions. Word has length 16 [2020-10-15 22:09:51,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:09:51,350 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 498 transitions. [2020-10-15 22:09:51,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 22:09:51,350 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 498 transitions. [2020-10-15 22:09:51,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 22:09:51,351 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:09:51,351 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 22:09:51,351 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-15 22:09:51,351 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:09:51,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:09:51,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1308070420, now seen corresponding path program 1 times [2020-10-15 22:09:51,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:09:51,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768126950] [2020-10-15 22:09:51,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:09:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:09:51,433 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 22:09:51,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768126950] [2020-10-15 22:09:51,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:09:51,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 22:09:51,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388772285] [2020-10-15 22:09:51,434 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 22:09:51,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:09:51,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 22:09:51,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:09:51,435 INFO L87 Difference]: Start difference. First operand 209 states and 498 transitions. Second operand 5 states. [2020-10-15 22:09:51,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:09:51,477 INFO L93 Difference]: Finished difference Result 164 states and 346 transitions. [2020-10-15 22:09:51,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 22:09:51,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-15 22:09:51,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:09:51,479 INFO L225 Difference]: With dead ends: 164 [2020-10-15 22:09:51,479 INFO L226 Difference]: Without dead ends: 133 [2020-10-15 22:09:51,479 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 22:09:51,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-10-15 22:09:51,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2020-10-15 22:09:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-10-15 22:09:51,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 274 transitions. [2020-10-15 22:09:51,484 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 274 transitions. Word has length 17 [2020-10-15 22:09:51,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:09:51,484 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 274 transitions. [2020-10-15 22:09:51,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 22:09:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 274 transitions. [2020-10-15 22:09:51,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 22:09:51,485 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:09:51,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] [2020-10-15 22:09:51,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-15 22:09:51,485 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:09:51,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:09:51,486 INFO L82 PathProgramCache]: Analyzing trace with hash -997974655, now seen corresponding path program 1 times [2020-10-15 22:09:51,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:09:51,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393569221] [2020-10-15 22:09:51,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:09:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:09:51,582 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 22:09:51,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393569221] [2020-10-15 22:09:51,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:09:51,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 22:09:51,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758510793] [2020-10-15 22:09:51,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 22:09:51,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:09:51,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 22:09:51,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:09:51,584 INFO L87 Difference]: Start difference. First operand 133 states and 274 transitions. Second operand 6 states. [2020-10-15 22:09:51,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:09:51,633 INFO L93 Difference]: Finished difference Result 112 states and 230 transitions. [2020-10-15 22:09:51,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 22:09:51,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-15 22:09:51,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:09:51,635 INFO L225 Difference]: With dead ends: 112 [2020-10-15 22:09:51,635 INFO L226 Difference]: Without dead ends: 103 [2020-10-15 22:09:51,636 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 22:09:51,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-10-15 22:09:51,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-10-15 22:09:51,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-15 22:09:51,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 214 transitions. [2020-10-15 22:09:51,638 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 214 transitions. Word has length 19 [2020-10-15 22:09:51,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:09:51,639 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 214 transitions. [2020-10-15 22:09:51,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 22:09:51,639 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 214 transitions. [2020-10-15 22:09:51,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 22:09:51,640 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:09:51,640 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] [2020-10-15 22:09:51,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-15 22:09:51,640 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:09:51,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:09:51,640 INFO L82 PathProgramCache]: Analyzing trace with hash -326631246, now seen corresponding path program 1 times [2020-10-15 22:09:51,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:09:51,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505555505] [2020-10-15 22:09:51,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:09:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:09:51,795 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 22:09:51,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505555505] [2020-10-15 22:09:51,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:09:51,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 22:09:51,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217655973] [2020-10-15 22:09:51,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 22:09:51,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:09:51,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 22:09:51,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-15 22:09:51,797 INFO L87 Difference]: Start difference. First operand 103 states and 214 transitions. Second operand 8 states. [2020-10-15 22:09:51,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:09:51,944 INFO L93 Difference]: Finished difference Result 130 states and 263 transitions. [2020-10-15 22:09:51,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 22:09:51,945 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-15 22:09:51,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:09:51,946 INFO L225 Difference]: With dead ends: 130 [2020-10-15 22:09:51,946 INFO L226 Difference]: Without dead ends: 99 [2020-10-15 22:09:51,947 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-10-15 22:09:51,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-10-15 22:09:51,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2020-10-15 22:09:51,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-15 22:09:51,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 166 transitions. [2020-10-15 22:09:51,950 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 166 transitions. Word has length 22 [2020-10-15 22:09:51,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:09:51,950 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 166 transitions. [2020-10-15 22:09:51,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 22:09:51,951 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 166 transitions. [2020-10-15 22:09:51,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 22:09:51,951 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:09:51,951 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] [2020-10-15 22:09:51,951 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-15 22:09:51,952 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:09:51,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:09:51,952 INFO L82 PathProgramCache]: Analyzing trace with hash 82721980, now seen corresponding path program 2 times [2020-10-15 22:09:51,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:09:51,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904491988] [2020-10-15 22:09:51,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:09:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:09:52,237 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 22:09:52,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904491988] [2020-10-15 22:09:52,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:09:52,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-15 22:09:52,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560882573] [2020-10-15 22:09:52,238 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 22:09:52,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:09:52,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 22:09:52,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-15 22:09:52,239 INFO L87 Difference]: Start difference. First operand 87 states and 166 transitions. Second operand 10 states. [2020-10-15 22:09:52,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:09:52,480 INFO L93 Difference]: Finished difference Result 124 states and 226 transitions. [2020-10-15 22:09:52,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 22:09:52,481 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-10-15 22:09:52,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:09:52,482 INFO L225 Difference]: With dead ends: 124 [2020-10-15 22:09:52,482 INFO L226 Difference]: Without dead ends: 79 [2020-10-15 22:09:52,482 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-10-15 22:09:52,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-15 22:09:52,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2020-10-15 22:09:52,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-15 22:09:52,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 110 transitions. [2020-10-15 22:09:52,484 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 110 transitions. Word has length 22 [2020-10-15 22:09:52,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:09:52,485 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 110 transitions. [2020-10-15 22:09:52,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 22:09:52,485 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 110 transitions. [2020-10-15 22:09:52,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 22:09:52,486 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:09:52,486 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] [2020-10-15 22:09:52,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-15 22:09:52,486 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:09:52,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:09:52,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1320434386, now seen corresponding path program 3 times [2020-10-15 22:09:52,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:09:52,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569894606] [2020-10-15 22:09:52,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:09:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 22:09:52,525 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 22:09:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 22:09:52,565 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 22:09:52,604 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 22:09:52,604 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 22:09:52,605 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-15 22:09:52,624 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 22:09:52,625 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,626 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 22:09:52,626 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,626 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 22:09:52,626 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,627 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 22:09:52,627 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,627 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 22:09:52,627 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,627 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 22:09:52,627 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,628 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 22:09:52,628 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,629 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 22:09:52,629 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,629 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 22:09:52,629 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,629 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 22:09:52,630 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,630 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 22:09:52,630 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,630 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 22:09:52,630 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,630 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 22:09:52,631 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,631 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 22:09:52,631 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,631 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 22:09:52,631 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,632 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 22:09:52,632 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,632 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 22:09:52,632 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,632 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 22:09:52,632 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,633 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 22:09:52,633 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,633 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 22:09:52,633 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,634 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 22:09:52,634 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,634 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 22:09:52,634 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,634 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 22:09:52,634 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,635 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 22:09:52,635 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,635 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 22:09:52,635 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,636 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 22:09:52,636 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,636 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 22:09:52,636 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,636 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 22:09:52,636 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,636 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 22:09:52,637 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,637 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 22:09:52,637 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,637 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 22:09:52,637 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,638 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 22:09:52,638 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,638 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 22:09:52,638 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,638 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 22:09:52,638 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,639 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 22:09:52,639 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,639 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 22:09:52,639 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:09:52,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 10:09:52 BasicIcfg [2020-10-15 22:09:52,727 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 22:09:52,728 INFO L168 Benchmark]: Toolchain (without parser) took 15102.13 ms. Allocated memory was 250.1 MB in the beginning and 563.6 MB in the end (delta: 313.5 MB). Free memory was 206.5 MB in the beginning and 304.9 MB in the end (delta: -98.4 MB). Peak memory consumption was 215.1 MB. Max. memory is 14.2 GB. [2020-10-15 22:09:52,729 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 250.1 MB. Free memory is still 226.5 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 22:09:52,729 INFO L168 Benchmark]: CACSL2BoogieTranslator took 804.57 ms. Allocated memory was 250.1 MB in the beginning and 309.9 MB in the end (delta: 59.8 MB). Free memory was 206.5 MB in the beginning and 260.1 MB in the end (delta: -53.6 MB). Peak memory consumption was 33.1 MB. Max. memory is 14.2 GB. [2020-10-15 22:09:52,731 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.02 ms. Allocated memory is still 309.9 MB. Free memory was 260.1 MB in the beginning and 257.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 22:09:52,731 INFO L168 Benchmark]: Boogie Preprocessor took 45.10 ms. Allocated memory is still 309.9 MB. Free memory was 257.6 MB in the beginning and 255.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 22:09:52,732 INFO L168 Benchmark]: RCFGBuilder took 2110.64 ms. Allocated memory was 309.9 MB in the beginning and 353.9 MB in the end (delta: 44.0 MB). Free memory was 255.1 MB in the beginning and 181.9 MB in the end (delta: 73.1 MB). Peak memory consumption was 117.1 MB. Max. memory is 14.2 GB. [2020-10-15 22:09:52,732 INFO L168 Benchmark]: TraceAbstraction took 12067.31 ms. Allocated memory was 353.9 MB in the beginning and 563.6 MB in the end (delta: 209.7 MB). Free memory was 181.9 MB in the beginning and 304.9 MB in the end (delta: -123.0 MB). Peak memory consumption was 86.7 MB. Max. memory is 14.2 GB. [2020-10-15 22:09:52,741 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.18 ms. Allocated memory is still 250.1 MB. Free memory is still 226.5 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 804.57 ms. Allocated memory was 250.1 MB in the beginning and 309.9 MB in the end (delta: 59.8 MB). Free memory was 206.5 MB in the beginning and 260.1 MB in the end (delta: -53.6 MB). Peak memory consumption was 33.1 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 69.02 ms. Allocated memory is still 309.9 MB. Free memory was 260.1 MB in the beginning and 257.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 45.10 ms. Allocated memory is still 309.9 MB. Free memory was 257.6 MB in the beginning and 255.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2110.64 ms. Allocated memory was 309.9 MB in the beginning and 353.9 MB in the end (delta: 44.0 MB). Free memory was 255.1 MB in the beginning and 181.9 MB in the end (delta: 73.1 MB). Peak memory consumption was 117.1 MB. Max. memory is 14.2 GB. * TraceAbstraction took 12067.31 ms. Allocated memory was 353.9 MB in the beginning and 563.6 MB in the end (delta: 209.7 MB). Free memory was 181.9 MB in the beginning and 304.9 MB in the end (delta: -123.0 MB). Peak memory consumption was 86.7 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1050 VarBasedMoverChecksPositive, 63 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 43 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 122 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.2s, 101 PlacesBefore, 37 PlacesAfterwards, 93 TransitionsBefore, 28 TransitionsAfterwards, 1650 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, 4614 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p1_EAX = 0; [L702] 0 int __unbuffered_p2_EAX = 0; [L703] 0 _Bool main$tmp_guard0; [L704] 0 _Bool main$tmp_guard1; [L706] 0 int x = 0; [L708] 0 int y = 0; [L710] 0 int z = 0; [L711] 0 _Bool z$flush_delayed; [L712] 0 int z$mem_tmp; [L713] 0 _Bool z$r_buff0_thd0; [L714] 0 _Bool z$r_buff0_thd1; [L715] 0 _Bool z$r_buff0_thd2; [L716] 0 _Bool z$r_buff0_thd3; [L717] 0 _Bool z$r_buff1_thd0; [L718] 0 _Bool z$r_buff1_thd1; [L719] 0 _Bool z$r_buff1_thd2; [L720] 0 _Bool z$r_buff1_thd3; [L721] 0 _Bool z$read_delayed; [L722] 0 int *z$read_delayed_var; [L723] 0 int z$w_buff0; [L724] 0 _Bool z$w_buff0_used; [L725] 0 int z$w_buff1; [L726] 0 _Bool z$w_buff1_used; [L727] 0 _Bool weak$$choice0; [L728] 0 _Bool weak$$choice2; [L809] 0 pthread_t t1973; [L810] FCALL, FORK 0 pthread_create(&t1973, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L811] 0 pthread_t t1974; [L812] FCALL, FORK 0 pthread_create(&t1974, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L813] 0 pthread_t t1975; [L732] 1 z$w_buff1 = z$w_buff0 [L733] 1 z$w_buff0 = 2 [L734] 1 z$w_buff1_used = z$w_buff0_used [L735] 1 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L737] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L738] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L739] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L740] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L741] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, 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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L761] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, 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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L767] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L767] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L767] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L767] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L768] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L769] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L770] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L770] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L771] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L771] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 2 return 0; [L814] FCALL, FORK 0 pthread_create(&t1975, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L781] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L784] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L787] 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) [L787] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L787] 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) [L787] 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) [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] 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 [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L791] 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 [L794] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 3 return 0; [L747] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L749] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L749] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L750] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L751] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L751] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L816] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L820] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L820] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L821] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L821] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L822] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L822] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L823] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L823] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L824] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 z$flush_delayed = weak$$choice2 [L830] 0 z$mem_tmp = z [L831] 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) [L831] 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) [L832] 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)) [L832] EXPR 0 !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) [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0 [L832] EXPR 0 !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) [L832] 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)) [L832] 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)) [L833] 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)) [L833] 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)) [L834] 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)) [L834] 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)) [L835] 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)) [L835] 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_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L835] 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)) [L835] 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)) [L836] 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)) [L836] 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) [L836] 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)) [L836] 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)) [L837] 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)) [L837] EXPR 0 !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) [L837] 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)) [L837] 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)) [L838] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L839] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L839] 0 z = z$flush_delayed ? z$mem_tmp : z [L840] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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 4 procedures, 92 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.8s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 454 SDtfs, 614 SDslu, 1083 SDs, 0 SdLazy, 652 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=974occurred 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: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 60 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 233 ConstructedInterpolants, 0 QuantifiedInterpolants, 31133 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...