/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix044_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 11:12:41,343 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 11:12:41,346 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 11:12:41,370 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 11:12:41,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 11:12:41,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 11:12:41,373 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 11:12:41,375 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 11:12:41,376 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 11:12:41,377 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 11:12:41,378 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 11:12:41,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 11:12:41,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 11:12:41,381 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 11:12:41,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 11:12:41,383 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 11:12:41,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 11:12:41,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 11:12:41,387 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 11:12:41,389 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 11:12:41,392 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 11:12:41,393 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 11:12:41,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 11:12:41,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 11:12:41,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 11:12:41,405 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 11:12:41,405 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 11:12:41,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 11:12:41,409 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 11:12:41,410 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 11:12:41,410 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 11:12:41,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 11:12:41,413 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 11:12:41,414 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 11:12:41,416 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 11:12:41,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 11:12:41,417 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 11:12:41,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 11:12:41,417 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 11:12:41,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 11:12:41,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 11:12:41,432 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-16 11:12:41,478 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 11:12:41,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 11:12:41,480 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 11:12:41,480 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 11:12:41,480 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 11:12:41,480 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 11:12:41,481 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 11:12:41,481 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 11:12:41,481 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 11:12:41,481 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 11:12:41,481 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 11:12:41,482 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 11:12:41,482 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 11:12:41,482 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 11:12:41,482 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 11:12:41,482 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 11:12:41,483 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 11:12:41,483 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 11:12:41,483 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 11:12:41,483 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 11:12:41,483 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 11:12:41,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 11:12:41,484 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 11:12:41,484 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 11:12:41,484 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 11:12:41,485 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 11:12:41,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 11:12:41,485 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 11:12:41,485 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-16 11:12:41,485 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 11:12:41,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 11:12:41,813 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 11:12:41,817 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 11:12:41,818 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 11:12:41,818 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 11:12:41,819 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_rmo.oepc.i [2020-10-16 11:12:41,883 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/795da999a/8bbc0ad0c2a54723b303a63ac76fbf7d/FLAGfffb5699a [2020-10-16 11:12:42,473 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 11:12:42,474 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix044_rmo.oepc.i [2020-10-16 11:12:42,489 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/795da999a/8bbc0ad0c2a54723b303a63ac76fbf7d/FLAGfffb5699a [2020-10-16 11:12:42,663 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/795da999a/8bbc0ad0c2a54723b303a63ac76fbf7d [2020-10-16 11:12:42,674 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 11:12:42,676 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 11:12:42,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 11:12:42,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 11:12:42,681 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 11:12:42,682 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:12:42" (1/1) ... [2020-10-16 11:12:42,685 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2430dd05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:42, skipping insertion in model container [2020-10-16 11:12:42,686 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:12:42" (1/1) ... [2020-10-16 11:12:42,694 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 11:12:42,775 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 11:12:43,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:12:43,392 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 11:12:43,465 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:12:43,562 INFO L208 MainTranslator]: Completed translation [2020-10-16 11:12:43,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:43 WrapperNode [2020-10-16 11:12:43,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 11:12:43,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 11:12:43,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 11:12:43,565 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 11:12:43,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:43" (1/1) ... [2020-10-16 11:12:43,597 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:43" (1/1) ... [2020-10-16 11:12:43,627 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 11:12:43,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 11:12:43,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 11:12:43,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 11:12:43,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:43" (1/1) ... [2020-10-16 11:12:43,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:43" (1/1) ... [2020-10-16 11:12:43,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:43" (1/1) ... [2020-10-16 11:12:43,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:43" (1/1) ... [2020-10-16 11:12:43,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:43" (1/1) ... [2020-10-16 11:12:43,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:43" (1/1) ... [2020-10-16 11:12:43,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:43" (1/1) ... [2020-10-16 11:12:43,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 11:12:43,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 11:12:43,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 11:12:43,673 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 11:12:43,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:43" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-16 11:12:43,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 11:12:43,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 11:12:43,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 11:12:43,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 11:12:43,752 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 11:12:43,752 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 11:12:43,752 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 11:12:43,752 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 11:12:43,753 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 11:12:43,753 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 11:12:43,753 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 11:12:43,753 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 11:12:43,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 11:12:43,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 11:12:43,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 11:12:43,756 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 11:12:46,334 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 11:12:46,335 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 11:12:46,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:12:46 BoogieIcfgContainer [2020-10-16 11:12:46,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 11:12:46,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 11:12:46,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 11:12:46,346 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 11:12:46,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:12:42" (1/3) ... [2020-10-16 11:12:46,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb58c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:12:46, skipping insertion in model container [2020-10-16 11:12:46,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:43" (2/3) ... [2020-10-16 11:12:46,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb58c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:12:46, skipping insertion in model container [2020-10-16 11:12:46,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:12:46" (3/3) ... [2020-10-16 11:12:46,351 INFO L111 eAbstractionObserver]: Analyzing ICFG mix044_rmo.oepc.i [2020-10-16 11:12:46,363 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 11:12:46,364 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 11:12:46,375 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 11:12:46,376 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 11:12:46,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,411 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,412 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,412 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,413 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,416 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,416 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,419 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,420 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,422 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,422 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,423 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,423 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,423 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,423 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,423 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,424 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,424 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,424 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,424 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,424 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,424 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,425 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,425 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,425 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,425 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,425 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,425 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,427 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,427 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,427 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,427 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,427 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,427 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,428 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,428 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,428 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,428 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,428 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,428 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,432 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,432 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,432 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,432 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,432 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,433 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,433 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,433 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,438 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,438 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,439 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,439 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,439 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,439 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,439 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,440 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,444 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,444 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,450 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,451 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,451 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,451 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,451 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,451 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,452 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,452 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,452 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,452 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,452 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,452 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,453 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,453 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,453 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,453 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,453 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,454 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,454 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,454 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,454 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,454 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,454 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,460 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,460 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,460 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:12:46,462 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 11:12:46,477 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 11:12:46,500 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 11:12:46,500 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 11:12:46,500 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 11:12:46,500 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 11:12:46,500 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 11:12:46,500 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 11:12:46,501 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 11:12:46,501 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 11:12:46,515 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 11:12:46,518 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 114 transitions, 248 flow [2020-10-16 11:12:46,521 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 114 transitions, 248 flow [2020-10-16 11:12:46,523 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 125 places, 114 transitions, 248 flow [2020-10-16 11:12:46,578 INFO L129 PetriNetUnfolder]: 2/110 cut-off events. [2020-10-16 11:12:46,578 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 11:12:46,584 INFO L80 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 88 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2020-10-16 11:12:46,588 INFO L117 LiptonReduction]: Number of co-enabled transitions 2814 [2020-10-16 11:12:46,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 11:12:46,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:46,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:46,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:46,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:46,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:46,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:46,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:46,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:46,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:46,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:46,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:46,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:46,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:46,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:46,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:46,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:46,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:46,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:46,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:46,992 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:46,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:46,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:46,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:47,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:47,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:47,025 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:47,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:47,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:47,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:47,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:47,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:47,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:47,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:47,430 WARN L193 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 11:12:47,539 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 11:12:47,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:47,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:47,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:47,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:47,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:47,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:47,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:47,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:47,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:47,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:47,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:47,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:47,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:47,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:47,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:47,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:47,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:47,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:47,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:12:47,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:12:47,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:12:47,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:12:47,716 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:12:47,716 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:12:47,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:12:47,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:47,720 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:12:47,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:47,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:12:47,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:47,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:12:47,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 11:12:47,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:12:47,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:47,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:47,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:47,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:47,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:47,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:47,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:47,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:47,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:47,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:47,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:47,867 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:47,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:47,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:47,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:47,873 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:47,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:47,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:47,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:47,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:47,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:47,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:47,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:47,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:47,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:47,981 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:47,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:47,983 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:47,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:47,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:47,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:47,988 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:47,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:48,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:48,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:48,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:48,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:48,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:48,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:48,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:48,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:48,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:48,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:48,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:48,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:48,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:48,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:48,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:48,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:48,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:48,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:48,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:48,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:48,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:48,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:48,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:48,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:48,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:48,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:48,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:48,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:48,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:48,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:48,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:48,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:48,426 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-10-16 11:12:48,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:48,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:48,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:48,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:48,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:48,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:48,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:48,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:48,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:48,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:48,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:48,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:48,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:48,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:48,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:48,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:48,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:12:48,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 11:12:48,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:12:48,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:48,677 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:48,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:48,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:12:48,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:12:48,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:12:48,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:12:48,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:12:48,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:12:48,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:12:48,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:48,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:12:48,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:48,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:12:48,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:49,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:49,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:49,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:49,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:49,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:49,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:49,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 11:12:49,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:12:49,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:12:49,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:12:49,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:12:49,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:12:49,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:12:49,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:12:49,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:12:49,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:12:49,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:12:49,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:49,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:12:49,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:49,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:12:49,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:49,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:49,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:49,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:49,621 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:49,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:49,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:49,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:49,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:49,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:49,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:49,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:49,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:49,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,673 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:49,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:49,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:49,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:49,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,729 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:49,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:49,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:49,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:49,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:49,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:49,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:49,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:49,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,812 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:49,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:49,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:49,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:49,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,831 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:49,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:49,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:49,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:49,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:49,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:49,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:49,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:49,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:49,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:49,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:49,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:49,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:49,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:49,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:49,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:49,977 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:49,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:49,979 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:49,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:50,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:50,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:50,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:50,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:50,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:50,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:50,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:50,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:50,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:50,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:50,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:50,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:50,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:50,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:50,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:50,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:50,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:50,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:50,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:12:50,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:12:50,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:12:50,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:12:50,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:12:50,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:12:50,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:12:50,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:50,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:12:50,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:50,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:12:50,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:50,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:12:50,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:12:50,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:12:50,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:50,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:50,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:50,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:50,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:50,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:50,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:50,207 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:50,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:12:50,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:50,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:50,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:50,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:12:50,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:12:50,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:50,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:12:50,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:12:51,051 WARN L193 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2020-10-16 11:12:51,191 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-16 11:12:51,203 INFO L132 LiptonReduction]: Checked pairs total: 7989 [2020-10-16 11:12:51,203 INFO L134 LiptonReduction]: Total number of compositions: 90 [2020-10-16 11:12:51,210 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 36 transitions, 92 flow [2020-10-16 11:12:51,612 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 5774 states. [2020-10-16 11:12:51,615 INFO L276 IsEmpty]: Start isEmpty. Operand 5774 states. [2020-10-16 11:12:51,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-16 11:12:51,622 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:12:51,623 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-16 11:12:51,623 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:12:51,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:12:51,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1200678, now seen corresponding path program 1 times [2020-10-16 11:12:51,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:12:51,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245009065] [2020-10-16 11:12:51,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:12:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:12:51,876 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-16 11:12:51,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245009065] [2020-10-16 11:12:51,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:12:51,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 11:12:51,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073018439] [2020-10-16 11:12:51,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:12:51,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:12:51,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:12:51,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:12:51,903 INFO L87 Difference]: Start difference. First operand 5774 states. Second operand 3 states. [2020-10-16 11:12:52,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:12:52,101 INFO L93 Difference]: Finished difference Result 4812 states and 19300 transitions. [2020-10-16 11:12:52,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:12:52,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-16 11:12:52,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:12:52,172 INFO L225 Difference]: With dead ends: 4812 [2020-10-16 11:12:52,173 INFO L226 Difference]: Without dead ends: 4062 [2020-10-16 11:12:52,175 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-16 11:12:52,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4062 states. [2020-10-16 11:12:52,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 4062. [2020-10-16 11:12:52,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4062 states. [2020-10-16 11:12:52,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 16125 transitions. [2020-10-16 11:12:52,547 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 16125 transitions. Word has length 3 [2020-10-16 11:12:52,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:12:52,548 INFO L481 AbstractCegarLoop]: Abstraction has 4062 states and 16125 transitions. [2020-10-16 11:12:52,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:12:52,548 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 16125 transitions. [2020-10-16 11:12:52,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 11:12:52,551 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:12:52,552 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:12:52,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 11:12:52,552 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:12:52,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:12:52,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1031342463, now seen corresponding path program 1 times [2020-10-16 11:12:52,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:12:52,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238289854] [2020-10-16 11:12:52,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:12:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:12:52,683 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-16 11:12:52,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238289854] [2020-10-16 11:12:52,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:12:52,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 11:12:52,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034580632] [2020-10-16 11:12:52,686 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:12:52,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:12:52,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:12:52,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:12:52,687 INFO L87 Difference]: Start difference. First operand 4062 states and 16125 transitions. Second operand 4 states. [2020-10-16 11:12:52,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:12:52,772 INFO L93 Difference]: Finished difference Result 4712 states and 18140 transitions. [2020-10-16 11:12:52,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:12:52,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-16 11:12:52,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:12:52,818 INFO L225 Difference]: With dead ends: 4712 [2020-10-16 11:12:52,819 INFO L226 Difference]: Without dead ends: 3962 [2020-10-16 11:12:52,820 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-16 11:12:52,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3962 states. [2020-10-16 11:12:52,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3962 to 3962. [2020-10-16 11:12:52,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3962 states. [2020-10-16 11:12:53,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 15665 transitions. [2020-10-16 11:12:53,005 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 15665 transitions. Word has length 12 [2020-10-16 11:12:53,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:12:53,006 INFO L481 AbstractCegarLoop]: Abstraction has 3962 states and 15665 transitions. [2020-10-16 11:12:53,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:12:53,007 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 15665 transitions. [2020-10-16 11:12:53,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 11:12:53,011 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:12:53,011 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:12:53,011 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 11:12:53,011 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:12:53,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:12:53,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1906843203, now seen corresponding path program 1 times [2020-10-16 11:12:53,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:12:53,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805063508] [2020-10-16 11:12:53,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:12:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:12:53,123 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-16 11:12:53,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805063508] [2020-10-16 11:12:53,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:12:53,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 11:12:53,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281003550] [2020-10-16 11:12:53,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:12:53,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:12:53,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:12:53,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:12:53,127 INFO L87 Difference]: Start difference. First operand 3962 states and 15665 transitions. Second operand 4 states. [2020-10-16 11:12:53,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:12:53,193 INFO L93 Difference]: Finished difference Result 4262 states and 16370 transitions. [2020-10-16 11:12:53,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:12:53,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-16 11:12:53,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:12:53,233 INFO L225 Difference]: With dead ends: 4262 [2020-10-16 11:12:53,233 INFO L226 Difference]: Without dead ends: 3562 [2020-10-16 11:12:53,234 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-16 11:12:53,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3562 states. [2020-10-16 11:12:53,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3562 to 3562. [2020-10-16 11:12:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3562 states. [2020-10-16 11:12:53,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3562 states to 3562 states and 13925 transitions. [2020-10-16 11:12:53,396 INFO L78 Accepts]: Start accepts. Automaton has 3562 states and 13925 transitions. Word has length 13 [2020-10-16 11:12:53,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:12:53,396 INFO L481 AbstractCegarLoop]: Abstraction has 3562 states and 13925 transitions. [2020-10-16 11:12:53,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:12:53,397 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states and 13925 transitions. [2020-10-16 11:12:53,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 11:12:53,399 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:12:53,400 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:12:53,400 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 11:12:53,400 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:12:53,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:12:53,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1017411656, now seen corresponding path program 1 times [2020-10-16 11:12:53,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:12:53,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824753037] [2020-10-16 11:12:53,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:12:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:12:53,472 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-16 11:12:53,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824753037] [2020-10-16 11:12:53,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:12:53,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 11:12:53,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217582759] [2020-10-16 11:12:53,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:12:53,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:12:53,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:12:53,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:12:53,475 INFO L87 Difference]: Start difference. First operand 3562 states and 13925 transitions. Second operand 4 states. [2020-10-16 11:12:53,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:12:53,534 INFO L93 Difference]: Finished difference Result 3982 states and 15176 transitions. [2020-10-16 11:12:53,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:12:53,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-16 11:12:53,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:12:53,575 INFO L225 Difference]: With dead ends: 3982 [2020-10-16 11:12:53,575 INFO L226 Difference]: Without dead ends: 3482 [2020-10-16 11:12:53,575 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-16 11:12:53,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3482 states. [2020-10-16 11:12:53,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3482 to 3482. [2020-10-16 11:12:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3482 states. [2020-10-16 11:12:53,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3482 states to 3482 states and 13561 transitions. [2020-10-16 11:12:53,794 INFO L78 Accepts]: Start accepts. Automaton has 3482 states and 13561 transitions. Word has length 14 [2020-10-16 11:12:53,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:12:53,794 INFO L481 AbstractCegarLoop]: Abstraction has 3482 states and 13561 transitions. [2020-10-16 11:12:53,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:12:53,794 INFO L276 IsEmpty]: Start isEmpty. Operand 3482 states and 13561 transitions. [2020-10-16 11:12:53,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 11:12:53,798 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:12:53,798 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:12:53,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 11:12:53,798 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:12:53,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:12:53,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1929902520, now seen corresponding path program 1 times [2020-10-16 11:12:53,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:12:53,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766593450] [2020-10-16 11:12:53,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:12:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:12:53,915 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-16 11:12:53,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766593450] [2020-10-16 11:12:53,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:12:53,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:12:53,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368931484] [2020-10-16 11:12:53,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:12:53,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:12:53,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:12:53,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:12:53,917 INFO L87 Difference]: Start difference. First operand 3482 states and 13561 transitions. Second operand 4 states. [2020-10-16 11:12:53,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:12:53,982 INFO L93 Difference]: Finished difference Result 3256 states and 11426 transitions. [2020-10-16 11:12:53,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:12:53,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-16 11:12:53,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:12:53,994 INFO L225 Difference]: With dead ends: 3256 [2020-10-16 11:12:53,995 INFO L226 Difference]: Without dead ends: 2506 [2020-10-16 11:12:53,995 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-16 11:12:54,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2020-10-16 11:12:54,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2506. [2020-10-16 11:12:54,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2020-10-16 11:12:54,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 8681 transitions. [2020-10-16 11:12:54,078 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 8681 transitions. Word has length 15 [2020-10-16 11:12:54,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:12:54,079 INFO L481 AbstractCegarLoop]: Abstraction has 2506 states and 8681 transitions. [2020-10-16 11:12:54,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:12:54,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 8681 transitions. [2020-10-16 11:12:54,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-16 11:12:54,083 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:12:54,084 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:12:54,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 11:12:54,084 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:12:54,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:12:54,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1887623194, now seen corresponding path program 1 times [2020-10-16 11:12:54,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:12:54,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342686423] [2020-10-16 11:12:54,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:12:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:12:54,160 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-16 11:12:54,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342686423] [2020-10-16 11:12:54,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:12:54,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:12:54,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509473581] [2020-10-16 11:12:54,162 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:12:54,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:12:54,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:12:54,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:12:54,162 INFO L87 Difference]: Start difference. First operand 2506 states and 8681 transitions. Second operand 5 states. [2020-10-16 11:12:54,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:12:54,232 INFO L93 Difference]: Finished difference Result 1940 states and 6146 transitions. [2020-10-16 11:12:54,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:12:54,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-10-16 11:12:54,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:12:54,239 INFO L225 Difference]: With dead ends: 1940 [2020-10-16 11:12:54,240 INFO L226 Difference]: Without dead ends: 1510 [2020-10-16 11:12:54,240 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-16 11:12:54,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2020-10-16 11:12:54,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1510. [2020-10-16 11:12:54,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1510 states. [2020-10-16 11:12:54,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 4697 transitions. [2020-10-16 11:12:54,284 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 4697 transitions. Word has length 18 [2020-10-16 11:12:54,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:12:54,284 INFO L481 AbstractCegarLoop]: Abstraction has 1510 states and 4697 transitions. [2020-10-16 11:12:54,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:12:54,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 4697 transitions. [2020-10-16 11:12:54,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 11:12:54,289 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:12:54,289 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] [2020-10-16 11:12:54,289 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 11:12:54,289 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:12:54,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:12:54,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1420356417, now seen corresponding path program 1 times [2020-10-16 11:12:54,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:12:54,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555801212] [2020-10-16 11:12:54,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:12:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:12:54,426 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-16 11:12:54,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555801212] [2020-10-16 11:12:54,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:12:54,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:12:54,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804211166] [2020-10-16 11:12:54,428 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:12:54,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:12:54,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:12:54,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:12:54,428 INFO L87 Difference]: Start difference. First operand 1510 states and 4697 transitions. Second operand 6 states. [2020-10-16 11:12:54,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:12:54,510 INFO L93 Difference]: Finished difference Result 1256 states and 3898 transitions. [2020-10-16 11:12:54,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:12:54,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-16 11:12:54,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:12:54,516 INFO L225 Difference]: With dead ends: 1256 [2020-10-16 11:12:54,516 INFO L226 Difference]: Without dead ends: 1130 [2020-10-16 11:12:54,517 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-16 11:12:54,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2020-10-16 11:12:54,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1130. [2020-10-16 11:12:54,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2020-10-16 11:12:54,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 3557 transitions. [2020-10-16 11:12:54,547 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 3557 transitions. Word has length 21 [2020-10-16 11:12:54,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:12:54,547 INFO L481 AbstractCegarLoop]: Abstraction has 1130 states and 3557 transitions. [2020-10-16 11:12:54,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:12:54,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 3557 transitions. [2020-10-16 11:12:54,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-16 11:12:54,551 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:12:54,551 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:12:54,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 11:12:54,552 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:12:54,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:12:54,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1852819254, now seen corresponding path program 1 times [2020-10-16 11:12:54,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:12:54,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438916328] [2020-10-16 11:12:54,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:12:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:12:54,639 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-16 11:12:54,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438916328] [2020-10-16 11:12:54,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:12:54,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:12:54,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888133258] [2020-10-16 11:12:54,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:12:54,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:12:54,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:12:54,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:12:54,641 INFO L87 Difference]: Start difference. First operand 1130 states and 3557 transitions. Second operand 4 states. [2020-10-16 11:12:54,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:12:54,667 INFO L93 Difference]: Finished difference Result 1555 states and 4799 transitions. [2020-10-16 11:12:54,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 11:12:54,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-10-16 11:12:54,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:12:54,672 INFO L225 Difference]: With dead ends: 1555 [2020-10-16 11:12:54,672 INFO L226 Difference]: Without dead ends: 1136 [2020-10-16 11:12:54,673 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-16 11:12:54,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2020-10-16 11:12:54,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1130. [2020-10-16 11:12:54,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2020-10-16 11:12:54,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 3430 transitions. [2020-10-16 11:12:54,704 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 3430 transitions. Word has length 25 [2020-10-16 11:12:54,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:12:54,704 INFO L481 AbstractCegarLoop]: Abstraction has 1130 states and 3430 transitions. [2020-10-16 11:12:54,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:12:54,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 3430 transitions. [2020-10-16 11:12:54,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-16 11:12:54,708 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:12:54,708 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:12:54,709 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 11:12:54,709 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:12:54,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:12:54,709 INFO L82 PathProgramCache]: Analyzing trace with hash 963458562, now seen corresponding path program 2 times [2020-10-16 11:12:54,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:12:54,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134278004] [2020-10-16 11:12:54,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:12:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:12:54,944 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-16 11:12:54,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134278004] [2020-10-16 11:12:54,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:12:54,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:12:54,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387609836] [2020-10-16 11:12:54,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 11:12:54,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:12:54,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 11:12:54,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:12:54,948 INFO L87 Difference]: Start difference. First operand 1130 states and 3430 transitions. Second operand 7 states. [2020-10-16 11:12:55,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:12:55,026 INFO L93 Difference]: Finished difference Result 1084 states and 3337 transitions. [2020-10-16 11:12:55,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 11:12:55,026 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-10-16 11:12:55,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:12:55,030 INFO L225 Difference]: With dead ends: 1084 [2020-10-16 11:12:55,030 INFO L226 Difference]: Without dead ends: 816 [2020-10-16 11:12:55,031 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:12:55,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2020-10-16 11:12:55,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 816. [2020-10-16 11:12:55,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2020-10-16 11:12:55,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 2529 transitions. [2020-10-16 11:12:55,052 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 2529 transitions. Word has length 25 [2020-10-16 11:12:55,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:12:55,054 INFO L481 AbstractCegarLoop]: Abstraction has 816 states and 2529 transitions. [2020-10-16 11:12:55,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 11:12:55,054 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 2529 transitions. [2020-10-16 11:12:55,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-16 11:12:55,057 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:12:55,057 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:12:55,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 11:12:55,057 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:12:55,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:12:55,058 INFO L82 PathProgramCache]: Analyzing trace with hash 32192467, now seen corresponding path program 1 times [2020-10-16 11:12:55,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:12:55,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044516848] [2020-10-16 11:12:55,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:12:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:12:55,181 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-16 11:12:55,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044516848] [2020-10-16 11:12:55,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:12:55,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:12:55,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069487975] [2020-10-16 11:12:55,183 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:12:55,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:12:55,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:12:55,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:12:55,183 INFO L87 Difference]: Start difference. First operand 816 states and 2529 transitions. Second operand 4 states. [2020-10-16 11:12:55,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:12:55,204 INFO L93 Difference]: Finished difference Result 1203 states and 3664 transitions. [2020-10-16 11:12:55,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 11:12:55,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-10-16 11:12:55,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:12:55,207 INFO L225 Difference]: With dead ends: 1203 [2020-10-16 11:12:55,208 INFO L226 Difference]: Without dead ends: 560 [2020-10-16 11:12:55,208 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-16 11:12:55,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-10-16 11:12:55,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2020-10-16 11:12:55,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2020-10-16 11:12:55,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 1625 transitions. [2020-10-16 11:12:55,233 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 1625 transitions. Word has length 29 [2020-10-16 11:12:55,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:12:55,234 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 1625 transitions. [2020-10-16 11:12:55,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:12:55,234 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 1625 transitions. [2020-10-16 11:12:55,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-16 11:12:55,241 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:12:55,241 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:12:55,241 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 11:12:55,241 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:12:55,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:12:55,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1785440367, now seen corresponding path program 2 times [2020-10-16 11:12:55,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:12:55,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491919778] [2020-10-16 11:12:55,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:12:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:12:55,363 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-16 11:12:55,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491919778] [2020-10-16 11:12:55,363 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:12:55,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:12:55,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943892872] [2020-10-16 11:12:55,364 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:12:55,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:12:55,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:12:55,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:12:55,365 INFO L87 Difference]: Start difference. First operand 560 states and 1625 transitions. Second operand 5 states. [2020-10-16 11:12:55,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:12:55,398 INFO L93 Difference]: Finished difference Result 806 states and 2330 transitions. [2020-10-16 11:12:55,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:12:55,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2020-10-16 11:12:55,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:12:55,400 INFO L225 Difference]: With dead ends: 806 [2020-10-16 11:12:55,400 INFO L226 Difference]: Without dead ends: 344 [2020-10-16 11:12:55,400 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:12:55,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2020-10-16 11:12:55,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2020-10-16 11:12:55,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-10-16 11:12:55,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 941 transitions. [2020-10-16 11:12:55,409 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 941 transitions. Word has length 29 [2020-10-16 11:12:55,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:12:55,409 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 941 transitions. [2020-10-16 11:12:55,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:12:55,409 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 941 transitions. [2020-10-16 11:12:55,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-16 11:12:55,410 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:12:55,411 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:12:55,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 11:12:55,411 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:12:55,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:12:55,411 INFO L82 PathProgramCache]: Analyzing trace with hash -409700271, now seen corresponding path program 3 times [2020-10-16 11:12:55,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:12:55,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877623705] [2020-10-16 11:12:55,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:12:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:12:55,951 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-16 11:12:55,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877623705] [2020-10-16 11:12:55,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:12:55,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 11:12:55,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817515810] [2020-10-16 11:12:55,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 11:12:55,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:12:55,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 11:12:55,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:12:55,953 INFO L87 Difference]: Start difference. First operand 344 states and 941 transitions. Second operand 9 states. [2020-10-16 11:12:56,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:12:56,325 INFO L93 Difference]: Finished difference Result 401 states and 1079 transitions. [2020-10-16 11:12:56,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 11:12:56,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-16 11:12:56,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:12:56,329 INFO L225 Difference]: With dead ends: 401 [2020-10-16 11:12:56,329 INFO L226 Difference]: Without dead ends: 182 [2020-10-16 11:12:56,330 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-16 11:12:56,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-10-16 11:12:56,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2020-10-16 11:12:56,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-10-16 11:12:56,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 425 transitions. [2020-10-16 11:12:56,336 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 425 transitions. Word has length 29 [2020-10-16 11:12:56,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:12:56,339 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 425 transitions. [2020-10-16 11:12:56,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 11:12:56,339 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 425 transitions. [2020-10-16 11:12:56,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-16 11:12:56,340 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:12:56,341 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:12:56,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 11:12:56,341 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:12:56,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:12:56,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1783715405, now seen corresponding path program 4 times [2020-10-16 11:12:56,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:12:56,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438423807] [2020-10-16 11:12:56,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:12:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 11:12:56,425 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 11:12:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 11:12:56,524 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 11:12:56,584 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 11:12:56,585 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 11:12:56,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 11:12:56,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-16 11:12:56,631 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,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-16 11:12:56,632 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,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-16 11:12:56,632 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,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-16 11:12:56,633 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,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-16 11:12:56,633 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,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-16 11:12:56,633 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,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-16 11:12:56,637 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,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-16 11:12:56,639 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,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-16 11:12:56,639 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,640 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-16 11:12:56,640 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,640 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-16 11:12:56,640 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,644 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-16 11:12:56,645 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,645 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-16 11:12:56,645 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,645 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-16 11:12:56,646 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,646 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-16 11:12:56,646 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,647 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-16 11:12:56,647 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,654 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-16 11:12:56,654 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,655 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-16 11:12:56,655 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,655 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-16 11:12:56,656 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,656 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-16 11:12:56,656 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,656 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-16 11:12:56,657 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,657 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-16 11:12:56,657 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,657 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-16 11:12:56,658 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,658 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-16 11:12:56,659 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,660 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-16 11:12:56,660 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,660 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-16 11:12:56,661 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,661 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-16 11:12:56,661 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,661 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-16 11:12:56,662 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,662 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-16 11:12:56,662 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,662 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-16 11:12:56,663 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,663 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-16 11:12:56,663 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,663 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-16 11:12:56,664 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,664 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-16 11:12:56,664 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,664 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-16 11:12:56,664 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,664 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-16 11:12:56,665 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,665 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-16 11:12:56,665 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,665 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-16 11:12:56,666 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,666 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-16 11:12:56,666 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,666 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-16 11:12:56,666 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,666 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-16 11:12:56,667 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:56,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:12:56 BasicIcfg [2020-10-16 11:12:56,795 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 11:12:56,797 INFO L168 Benchmark]: Toolchain (without parser) took 14122.19 ms. Allocated memory was 140.0 MB in the beginning and 466.1 MB in the end (delta: 326.1 MB). Free memory was 101.8 MB in the beginning and 102.0 MB in the end (delta: -162.9 kB). Peak memory consumption was 325.9 MB. Max. memory is 7.1 GB. [2020-10-16 11:12:56,798 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 11:12:56,799 INFO L168 Benchmark]: CACSL2BoogieTranslator took 887.51 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 101.6 MB in the beginning and 155.5 MB in the end (delta: -53.9 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2020-10-16 11:12:56,800 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.46 ms. Allocated memory is still 202.9 MB. Free memory was 155.5 MB in the beginning and 152.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-16 11:12:56,800 INFO L168 Benchmark]: Boogie Preprocessor took 44.66 ms. Allocated memory is still 202.9 MB. Free memory was 152.8 MB in the beginning and 150.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-16 11:12:56,801 INFO L168 Benchmark]: RCFGBuilder took 2666.61 ms. Allocated memory was 202.9 MB in the beginning and 248.0 MB in the end (delta: 45.1 MB). Free memory was 150.2 MB in the beginning and 146.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 103.5 MB. Max. memory is 7.1 GB. [2020-10-16 11:12:56,802 INFO L168 Benchmark]: TraceAbstraction took 10455.20 ms. Allocated memory was 248.0 MB in the beginning and 466.1 MB in the end (delta: 218.1 MB). Free memory was 144.2 MB in the beginning and 102.0 MB in the end (delta: 42.2 MB). Peak memory consumption was 260.3 MB. Max. memory is 7.1 GB. [2020-10-16 11:12:56,806 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.50 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 887.51 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 101.6 MB in the beginning and 155.5 MB in the end (delta: -53.9 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.46 ms. Allocated memory is still 202.9 MB. Free memory was 155.5 MB in the beginning and 152.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.66 ms. Allocated memory is still 202.9 MB. Free memory was 152.8 MB in the beginning and 150.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2666.61 ms. Allocated memory was 202.9 MB in the beginning and 248.0 MB in the end (delta: 45.1 MB). Free memory was 150.2 MB in the beginning and 146.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 103.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10455.20 ms. Allocated memory was 248.0 MB in the beginning and 466.1 MB in the end (delta: 218.1 MB). Free memory was 144.2 MB in the beginning and 102.0 MB in the end (delta: 42.2 MB). Peak memory consumption was 260.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1862 VarBasedMoverChecksPositive, 88 VarBasedMoverChecksNegative, 29 SemBasedMoverChecksPositive, 59 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 304 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.6s, 125 PlacesBefore, 48 PlacesAfterwards, 114 TransitionsBefore, 36 TransitionsAfterwards, 2814 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 90 TotalNumberOfCompositions, 7989 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p1_EAX = 0; [L703] 0 int __unbuffered_p3_EAX = 0; [L705] 0 int __unbuffered_p3_EBX = 0; [L707] 0 int a = 0; [L709] 0 int b = 0; [L710] 0 _Bool b$flush_delayed; [L711] 0 int b$mem_tmp; [L712] 0 _Bool b$r_buff0_thd0; [L713] 0 _Bool b$r_buff0_thd1; [L714] 0 _Bool b$r_buff0_thd2; [L715] 0 _Bool b$r_buff0_thd3; [L716] 0 _Bool b$r_buff0_thd4; [L717] 0 _Bool b$r_buff1_thd0; [L718] 0 _Bool b$r_buff1_thd1; [L719] 0 _Bool b$r_buff1_thd2; [L720] 0 _Bool b$r_buff1_thd3; [L721] 0 _Bool b$r_buff1_thd4; [L722] 0 _Bool b$read_delayed; [L723] 0 int *b$read_delayed_var; [L724] 0 int b$w_buff0; [L725] 0 _Bool b$w_buff0_used; [L726] 0 int b$w_buff1; [L727] 0 _Bool b$w_buff1_used; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L858] 0 pthread_t t1177; [L859] FCALL, FORK 0 pthread_create(&t1177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L860] 0 pthread_t t1178; [L861] FCALL, FORK 0 pthread_create(&t1178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L862] 0 pthread_t t1179; [L863] FCALL, FORK 0 pthread_create(&t1179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L864] 0 pthread_t t1180; [L865] FCALL, FORK 0 pthread_create(&t1180, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L741] 1 b$w_buff1 = b$w_buff0 [L742] 1 b$w_buff0 = 1 [L743] 1 b$w_buff1_used = b$w_buff0_used [L744] 1 b$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L746] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L747] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L748] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L749] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L750] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L751] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L771] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L777] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L777] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L778] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L778] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L779] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L779] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L780] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L780] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L781] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L781] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L784] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 2 return 0; [L791] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L794] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L797] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L797] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L798] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L798] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L799] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L799] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L800] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L800] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L801] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L801] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L804] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 3 return 0; [L811] 4 z = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L814] 4 a = 1 [L817] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L820] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L821] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L822] 4 b$flush_delayed = weak$$choice2 [L823] 4 b$mem_tmp = b [L824] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L824] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1 [L824] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L824] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L825] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L825] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L826] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L826] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1) [L826] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L826] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L827] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L827] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L828] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L828] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L828] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0 [L828] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L828] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L828] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L829] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4) [L829] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L829] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L830] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L831] 4 __unbuffered_p3_EBX = b [L832] EXPR 4 b$flush_delayed ? b$mem_tmp : b [L832] 4 b = b$flush_delayed ? b$mem_tmp : b [L833] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=1, z=2] [L757] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L757] EXPR 1 b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b [L757] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L757] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L758] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L758] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L759] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L759] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L760] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L760] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L761] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L761] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L836] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L836] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L837] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L837] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L838] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L838] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L839] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L839] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L840] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L840] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L871] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L871] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L872] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L872] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L873] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L873] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L874] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L874] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L875] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L875] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L878] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 113 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.0s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 502 SDtfs, 669 SDslu, 922 SDs, 0 SdLazy, 250 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5774occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 25789 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...