/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/mix004_pso.opt.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.25-b09bf87
[2020-10-16 11:05:43,609 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2020-10-16 11:05:43,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 11:05:43,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 11:05:43,651 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 11:05:43,658 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 11:05:43,661 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 11:05:43,665 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 11:05:43,667 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 11:05:43,671 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 11:05:43,671 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 11:05:43,672 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 11:05:43,673 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 11:05:43,675 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 11:05:43,678 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 11:05:43,679 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 11:05:43,680 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 11:05:43,682 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 11:05:43,683 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 11:05:43,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 11:05:43,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 11:05:43,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 11:05:43,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 11:05:43,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 11:05:43,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 11:05:43,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 11:05:43,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 11:05:43,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 11:05:43,708 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 11:05:43,714 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 11:05:43,715 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 11:05:43,715 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 11:05:43,716 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 11:05:43,717 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 11:05:43,721 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 11:05:43,721 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 11:05:43,721 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 11:05:43,722 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 11:05:43,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 11:05:43,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 11:05:43,725 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 11:05:43,727 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:05:43,761 INFO L113 SettingsManager]: Loading preferences was successful
[2020-10-16 11:05:43,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 11:05:43,763 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 11:05:43,764 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2020-10-16 11:05:43,764 INFO L138 SettingsManager]: * Use SBE=true
[2020-10-16 11:05:43,764 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 11:05:43,765 INFO L138 SettingsManager]: * sizeof long=4
[2020-10-16 11:05:43,765 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2020-10-16 11:05:43,765 INFO L138 SettingsManager]: * sizeof POINTER=4
[2020-10-16 11:05:43,765 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2020-10-16 11:05:43,766 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 11:05:43,766 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 11:05:43,766 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 11:05:43,767 INFO L138 SettingsManager]: * sizeof long double=12
[2020-10-16 11:05:43,768 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2020-10-16 11:05:43,768 INFO L138 SettingsManager]: * Use constant arrays=true
[2020-10-16 11:05:43,768 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2020-10-16 11:05:43,768 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 11:05:43,769 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2020-10-16 11:05:43,769 INFO L138 SettingsManager]: * To the following directory=./dump/
[2020-10-16 11:05:43,769 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2020-10-16 11:05:43,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 11:05:43,770 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 11:05:43,770 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2020-10-16 11:05:43,770 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 11:05:43,770 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2020-10-16 11:05:43,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 11:05:43,770 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-16 11:05:43,771 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE
[2020-10-16 11:05:43,771 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-16 11:05:44,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 11:05:44,067 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 11:05:44,070 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 11:05:44,074 INFO L271 PluginConnector]: Initializing CDTParser...
[2020-10-16 11:05:44,074 INFO L275 PluginConnector]: CDTParser initialized
[2020-10-16 11:05:44,075 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix004_pso.opt.i
[2020-10-16 11:05:44,133 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/802bb3792/a99dbc7fe6d54d22b3da38db80f5545b/FLAG3a5b717cd
[2020-10-16 11:05:44,688 INFO L306 CDTParser]: Found 1 translation units.
[2020-10-16 11:05:44,689 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix004_pso.opt.i
[2020-10-16 11:05:44,704 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/802bb3792/a99dbc7fe6d54d22b3da38db80f5545b/FLAG3a5b717cd
[2020-10-16 11:05:44,954 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/802bb3792/a99dbc7fe6d54d22b3da38db80f5545b
[2020-10-16 11:05:44,963 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 11:05:44,965 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 11:05:44,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 11:05:44,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 11:05:44,970 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 11:05:44,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:05:44" (1/1) ...
[2020-10-16 11:05:44,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f963932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:44, skipping insertion in model container
[2020-10-16 11:05:44,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:05:44" (1/1) ...
[2020-10-16 11:05:44,981 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2020-10-16 11:05:45,032 INFO L178 MainTranslator]: Built tables and reachable declarations
[2020-10-16 11:05:45,498 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-10-16 11:05:45,521 INFO L203 MainTranslator]: Completed pre-run
[2020-10-16 11:05:45,617 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-10-16 11:05:45,692 INFO L208 MainTranslator]: Completed translation
[2020-10-16 11:05:45,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:45 WrapperNode
[2020-10-16 11:05:45,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 11:05:45,693 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 11:05:45,693 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 11:05:45,694 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 11:05:45,702 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:05:45" (1/1) ...
[2020-10-16 11:05:45,723 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:05:45" (1/1) ...
[2020-10-16 11:05:45,764 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 11:05:45,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 11:05:45,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 11:05:45,765 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 11:05:45,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:45" (1/1) ...
[2020-10-16 11:05:45,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:45" (1/1) ...
[2020-10-16 11:05:45,780 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:45" (1/1) ...
[2020-10-16 11:05:45,781 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:45" (1/1) ...
[2020-10-16 11:05:45,794 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:45" (1/1) ...
[2020-10-16 11:05:45,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:45" (1/1) ...
[2020-10-16 11:05:45,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:45" (1/1) ...
[2020-10-16 11:05:45,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 11:05:45,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 11:05:45,811 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 11:05:45,811 INFO L275 PluginConnector]: RCFGBuilder initialized
[2020-10-16 11:05:45,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:45" (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:05:45,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 11:05:45,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 11:05:45,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 11:05:45,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 11:05:45,882 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 11:05:45,883 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 11:05:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 11:05:45,883 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 11:05:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 11:05:45,884 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 11:05:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure P3
[2020-10-16 11:05:45,884 INFO L138 BoogieDeclarations]: Found implementation of procedure P3
[2020-10-16 11:05:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 11:05:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 11:05:45,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 11:05:45,886 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:05:48,048 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 11:05:48,049 INFO L298 CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 11:05:48,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:05:48 BoogieIcfgContainer
[2020-10-16 11:05:48,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 11:05:48,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 11:05:48,053 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 11:05:48,056 INFO L275 PluginConnector]: TraceAbstraction initialized
[2020-10-16 11:05:48,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:05:44" (1/3) ...
[2020-10-16 11:05:48,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b911241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:05:48, skipping insertion in model container
[2020-10-16 11:05:48,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:45" (2/3) ...
[2020-10-16 11:05:48,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b911241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:05:48, skipping insertion in model container
[2020-10-16 11:05:48,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:05:48" (3/3) ...
[2020-10-16 11:05:48,060 INFO L111 eAbstractionObserver]: Analyzing ICFG mix004_pso.opt.i
[2020-10-16 11:05:48,071 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-16 11:05:48,072 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-16 11:05:48,080 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 11:05:48,081 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 11:05:48,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,117 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,117 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,118 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,119 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,119 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,119 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,120 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,120 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,120 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,120 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,120 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,121 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,121 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,121 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,121 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,121 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,123 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,123 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,123 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,123 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,123 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,123 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,124 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,124 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,124 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,124 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,124 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,125 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,125 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,125 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,125 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,125 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,125 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,126 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,126 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,126 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,126 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,126 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,130 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,130 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,130 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,131 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,131 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,131 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,131 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,136 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,136 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,136 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,136 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,136 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,137 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,137 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,137 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,137 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,137 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,137 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,140 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,140 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,140 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,146 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,146 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,152 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,154 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,162 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,163 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,164 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,164 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,164 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,164 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,164 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,165 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,165 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,165 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,196 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,199 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,199 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,199 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,206 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,207 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:48,208 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-16 11:05:48,222 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2020-10-16 11:05:48,242 INFO L377 AbstractCegarLoop]: Interprodecural is true
[2020-10-16 11:05:48,243 INFO L378 AbstractCegarLoop]: Hoare is true
[2020-10-16 11:05:48,243 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-16 11:05:48,243 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-16 11:05:48,243 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 11:05:48,243 INFO L382 AbstractCegarLoop]: Difference is false
[2020-10-16 11:05:48,243 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 11:05:48,244 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 11:05:48,261 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-16 11:05:48,264 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 113 transitions, 246 flow
[2020-10-16 11:05:48,266 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 113 transitions, 246 flow
[2020-10-16 11:05:48,268 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 246 flow
[2020-10-16 11:05:48,346 INFO L129 PetriNetUnfolder]: 2/109 cut-off events.
[2020-10-16 11:05:48,347 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 11:05:48,355 INFO L80 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place.
[2020-10-16 11:05:48,362 INFO L117 LiptonReduction]: Number of co-enabled transitions 2446
[2020-10-16 11:05:48,994 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44
[2020-10-16 11:05:49,413 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-16 11:05:49,720 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:49,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:49,724 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:49,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:49,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:49,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:49,729 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:49,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:49,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:49,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:49,735 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:05:49,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:49,737 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:05:49,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:49,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:49,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:05:49,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:49,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:49,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:49,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:49,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:49,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:49,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:49,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:49,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:49,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:49,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:49,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:49,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:49,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:49,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:49,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:49,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:49,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:50,453 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-16 11:05:50,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:50,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:50,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:50,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:50,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:50,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:50,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:50,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:50,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:50,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:50,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:50,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:50,710 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:50,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:50,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:50,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:50,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:50,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:50,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:50,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:50,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:50,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:50,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:50,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:51,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:51,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:51,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:51,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:51,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:51,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:51,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:51,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:51,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:51,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-16 11:05:51,062 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:51,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:51,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:51,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:51,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:51,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:51,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:51,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:51,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:51,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:51,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:51,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:51,100 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:05:51,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:51,101 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:05:51,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:51,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:51,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:51,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:51,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:51,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:51,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:51,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:51,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:51,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:51,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:51,170 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:05:51,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:51,172 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:05:51,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:51,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:51,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-16 11:05:51,207 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:51,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:51,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:51,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:51,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:51,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:51,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:51,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:51,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:51,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:51,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:51,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:51,293 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:51,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:51,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:51,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:51,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:51,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:51,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:51,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:51,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:51,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:51,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:51,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:51,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:51,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:51,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:51,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:51,456 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:51,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:51,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:51,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:51,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:51,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:51,761 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:51,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:51,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:51,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:51,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:51,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:51,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:51,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:51,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:51,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:51,775 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:05:51,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:51,776 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:05:51,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:51,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:51,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-16 11:05:51,806 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:51,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:51,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:51,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:51,833 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:51,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:51,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:51,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:51,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:51,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:51,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:51,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:51,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:51,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:51,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:51,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:51,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:51,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:51,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:51,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:51,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:51,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:51,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:51,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:51,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:51,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-16 11:05:51,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:51,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:51,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:51,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:51,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:51,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:51,977 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:51,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:51,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:51,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:51,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:51,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:51,981 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:05:51,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:51,983 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:05:51,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:52,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:52,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:52,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:52,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:52,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:52,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:52,374 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 59
[2020-10-16 11:05:53,002 WARN L193 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101
[2020-10-16 11:05:53,170 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 99
[2020-10-16 11:05:53,239 INFO L132 LiptonReduction]: Checked pairs total: 6050
[2020-10-16 11:05:53,239 INFO L134 LiptonReduction]: Total number of compositions: 93
[2020-10-16 11:05:53,268 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 32 transitions, 84 flow
[2020-10-16 11:05:53,499 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3002 states.
[2020-10-16 11:05:53,501 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states.
[2020-10-16 11:05:53,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-10-16 11:05:53,512 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:05:53,513 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:05:53,513 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:53,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:53,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1072111882, now seen corresponding path program 1 times
[2020-10-16 11:05:53,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:53,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489083889]
[2020-10-16 11:05:53,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:53,814 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:05:53,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489083889]
[2020-10-16 11:05:53,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:53,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:05:53,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561339128]
[2020-10-16 11:05:53,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:05:53,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:53,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:05:53,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:05:53,839 INFO L87 Difference]: Start difference. First operand 3002 states. Second operand 3 states.
[2020-10-16 11:05:54,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:54,003 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions.
[2020-10-16 11:05:54,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2020-10-16 11:05:54,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2020-10-16 11:05:54,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:54,067 INFO L225 Difference]: With dead ends: 2602
[2020-10-16 11:05:54,068 INFO L226 Difference]: Without dead ends: 2122
[2020-10-16 11:05:54,069 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:05:54,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states.
[2020-10-16 11:05:54,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122.
[2020-10-16 11:05:54,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states.
[2020-10-16 11:05:54,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 8080 transitions.
[2020-10-16 11:05:54,267 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 8080 transitions. Word has length 9
[2020-10-16 11:05:54,268 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:54,268 INFO L481 AbstractCegarLoop]: Abstraction has 2122 states and 8080 transitions.
[2020-10-16 11:05:54,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:05:54,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 8080 transitions.
[2020-10-16 11:05:54,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-16 11:05:54,271 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:05:54,271 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:05:54,271 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 11:05:54,272 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:54,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:54,272 INFO L82 PathProgramCache]: Analyzing trace with hash -492570522, now seen corresponding path program 1 times
[2020-10-16 11:05:54,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:54,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109849645]
[2020-10-16 11:05:54,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:54,357 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:05:54,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109849645]
[2020-10-16 11:05:54,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:54,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:05:54,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144514554]
[2020-10-16 11:05:54,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:05:54,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:54,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:05:54,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:05:54,360 INFO L87 Difference]: Start difference. First operand 2122 states and 8080 transitions. Second operand 3 states.
[2020-10-16 11:05:54,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:54,387 INFO L93 Difference]: Finished difference Result 1930 states and 7248 transitions.
[2020-10-16 11:05:54,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2020-10-16 11:05:54,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11
[2020-10-16 11:05:54,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:54,404 INFO L225 Difference]: With dead ends: 1930
[2020-10-16 11:05:54,404 INFO L226 Difference]: Without dead ends: 1930
[2020-10-16 11:05:54,405 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:05:54,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states.
[2020-10-16 11:05:54,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1930.
[2020-10-16 11:05:54,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1930 states.
[2020-10-16 11:05:54,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 7248 transitions.
[2020-10-16 11:05:54,487 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 7248 transitions. Word has length 11
[2020-10-16 11:05:54,488 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:54,488 INFO L481 AbstractCegarLoop]: Abstraction has 1930 states and 7248 transitions.
[2020-10-16 11:05:54,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:05:54,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 7248 transitions.
[2020-10-16 11:05:54,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-16 11:05:54,491 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:05:54,491 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:05:54,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 11:05:54,492 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:54,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:54,492 INFO L82 PathProgramCache]: Analyzing trace with hash 350677278, now seen corresponding path program 1 times
[2020-10-16 11:05:54,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:54,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446426886]
[2020-10-16 11:05:54,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:54,555 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:05:54,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446426886]
[2020-10-16 11:05:54,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:54,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:05:54,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233343591]
[2020-10-16 11:05:54,558 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:05:54,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:54,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:05:54,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:05:54,559 INFO L87 Difference]: Start difference. First operand 1930 states and 7248 transitions. Second operand 3 states.
[2020-10-16 11:05:54,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:54,604 INFO L93 Difference]: Finished difference Result 1834 states and 6848 transitions.
[2020-10-16 11:05:54,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2020-10-16 11:05:54,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13
[2020-10-16 11:05:54,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:54,620 INFO L225 Difference]: With dead ends: 1834
[2020-10-16 11:05:54,620 INFO L226 Difference]: Without dead ends: 1834
[2020-10-16 11:05:54,620 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:05:54,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states.
[2020-10-16 11:05:54,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1834.
[2020-10-16 11:05:54,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1834 states.
[2020-10-16 11:05:54,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 6848 transitions.
[2020-10-16 11:05:54,687 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 6848 transitions. Word has length 13
[2020-10-16 11:05:54,688 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:54,688 INFO L481 AbstractCegarLoop]: Abstraction has 1834 states and 6848 transitions.
[2020-10-16 11:05:54,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:05:54,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 6848 transitions.
[2020-10-16 11:05:54,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-16 11:05:54,691 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:05:54,691 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:05:54,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 11:05:54,692 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:54,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:54,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1967601100, now seen corresponding path program 1 times
[2020-10-16 11:05:54,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:54,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295762709]
[2020-10-16 11:05:54,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:54,891 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:05:54,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295762709]
[2020-10-16 11:05:54,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:54,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:05:54,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868905272]
[2020-10-16 11:05:54,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:05:54,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:54,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:05:54,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:05:54,896 INFO L87 Difference]: Start difference. First operand 1834 states and 6848 transitions. Second operand 4 states.
[2020-10-16 11:05:54,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:54,971 INFO L93 Difference]: Finished difference Result 1900 states and 6462 transitions.
[2020-10-16 11:05:54,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2020-10-16 11:05:54,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15
[2020-10-16 11:05:54,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:54,983 INFO L225 Difference]: With dead ends: 1900
[2020-10-16 11:05:54,984 INFO L226 Difference]: Without dead ends: 1420
[2020-10-16 11:05:54,984 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:05:54,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states.
[2020-10-16 11:05:55,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1420.
[2020-10-16 11:05:55,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1420 states.
[2020-10-16 11:05:55,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 4778 transitions.
[2020-10-16 11:05:55,043 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 4778 transitions. Word has length 15
[2020-10-16 11:05:55,044 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:55,045 INFO L481 AbstractCegarLoop]: Abstraction has 1420 states and 4778 transitions.
[2020-10-16 11:05:55,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:05:55,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 4778 transitions.
[2020-10-16 11:05:55,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-16 11:05:55,049 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:05:55,049 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:05:55,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 11:05:55,049 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:55,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:55,049 INFO L82 PathProgramCache]: Analyzing trace with hash -910226292, now seen corresponding path program 1 times
[2020-10-16 11:05:55,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:55,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120341783]
[2020-10-16 11:05:55,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:55,197 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:05:55,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120341783]
[2020-10-16 11:05:55,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:55,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:05:55,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573845248]
[2020-10-16 11:05:55,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:05:55,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:55,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:05:55,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:05:55,200 INFO L87 Difference]: Start difference. First operand 1420 states and 4778 transitions. Second operand 5 states.
[2020-10-16 11:05:55,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:55,264 INFO L93 Difference]: Finished difference Result 1237 states and 3831 transitions.
[2020-10-16 11:05:55,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2020-10-16 11:05:55,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17
[2020-10-16 11:05:55,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:55,271 INFO L225 Difference]: With dead ends: 1237
[2020-10-16 11:05:55,272 INFO L226 Difference]: Without dead ends: 937
[2020-10-16 11:05:55,272 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:05:55,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states.
[2020-10-16 11:05:55,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 937.
[2020-10-16 11:05:55,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states.
[2020-10-16 11:05:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 2846 transitions.
[2020-10-16 11:05:55,301 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 2846 transitions. Word has length 17
[2020-10-16 11:05:55,301 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:55,301 INFO L481 AbstractCegarLoop]: Abstraction has 937 states and 2846 transitions.
[2020-10-16 11:05:55,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:05:55,301 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 2846 transitions.
[2020-10-16 11:05:55,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 11:05:55,304 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:05:55,305 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:05:55,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 11:05:55,305 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:55,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:55,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1666221923, now seen corresponding path program 1 times
[2020-10-16 11:05:55,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:55,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722457621]
[2020-10-16 11:05:55,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:55,449 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:05:55,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722457621]
[2020-10-16 11:05:55,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:55,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 11:05:55,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896907693]
[2020-10-16 11:05:55,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:05:55,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:55,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:05:55,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:05:55,452 INFO L87 Difference]: Start difference. First operand 937 states and 2846 transitions. Second operand 6 states.
[2020-10-16 11:05:55,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:55,528 INFO L93 Difference]: Finished difference Result 825 states and 2477 transitions.
[2020-10-16 11:05:55,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2020-10-16 11:05:55,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20
[2020-10-16 11:05:55,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:55,534 INFO L225 Difference]: With dead ends: 825
[2020-10-16 11:05:55,534 INFO L226 Difference]: Without dead ends: 726
[2020-10-16 11:05:55,534 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:05:55,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states.
[2020-10-16 11:05:55,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726.
[2020-10-16 11:05:55,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states.
[2020-10-16 11:05:55,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 2213 transitions.
[2020-10-16 11:05:55,558 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 2213 transitions. Word has length 20
[2020-10-16 11:05:55,558 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:55,558 INFO L481 AbstractCegarLoop]: Abstraction has 726 states and 2213 transitions.
[2020-10-16 11:05:55,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:05:55,558 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 2213 transitions.
[2020-10-16 11:05:55,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-16 11:05:55,561 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:05:55,561 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:05:55,561 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 11:05:55,561 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:55,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:55,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1923178409, now seen corresponding path program 1 times
[2020-10-16 11:05:55,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:55,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744205161]
[2020-10-16 11:05:55,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:55,628 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:05:55,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744205161]
[2020-10-16 11:05:55,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:55,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:05:55,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772946715]
[2020-10-16 11:05:55,630 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:05:55,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:55,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:05:55,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:05:55,631 INFO L87 Difference]: Start difference. First operand 726 states and 2213 transitions. Second operand 4 states.
[2020-10-16 11:05:55,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:55,703 INFO L93 Difference]: Finished difference Result 1006 states and 2972 transitions.
[2020-10-16 11:05:55,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2020-10-16 11:05:55,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23
[2020-10-16 11:05:55,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:55,709 INFO L225 Difference]: With dead ends: 1006
[2020-10-16 11:05:55,709 INFO L226 Difference]: Without dead ends: 728
[2020-10-16 11:05:55,709 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:05:55,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states.
[2020-10-16 11:05:55,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 726.
[2020-10-16 11:05:55,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states.
[2020-10-16 11:05:55,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 2085 transitions.
[2020-10-16 11:05:55,730 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 2085 transitions. Word has length 23
[2020-10-16 11:05:55,730 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:55,730 INFO L481 AbstractCegarLoop]: Abstraction has 726 states and 2085 transitions.
[2020-10-16 11:05:55,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:05:55,730 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 2085 transitions.
[2020-10-16 11:05:55,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-16 11:05:55,732 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:05:55,732 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:05:55,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 11:05:55,733 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:55,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:55,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1615498882, now seen corresponding path program 1 times
[2020-10-16 11:05:55,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:55,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769944080]
[2020-10-16 11:05:55,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:55,792 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:05:55,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769944080]
[2020-10-16 11:05:55,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:55,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:05:55,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36579829]
[2020-10-16 11:05:55,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:05:55,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:55,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:05:55,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:05:55,794 INFO L87 Difference]: Start difference. First operand 726 states and 2085 transitions. Second operand 4 states.
[2020-10-16 11:05:55,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:55,819 INFO L93 Difference]: Finished difference Result 933 states and 2605 transitions.
[2020-10-16 11:05:55,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2020-10-16 11:05:55,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23
[2020-10-16 11:05:55,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:55,825 INFO L225 Difference]: With dead ends: 933
[2020-10-16 11:05:55,826 INFO L226 Difference]: Without dead ends: 648
[2020-10-16 11:05:55,826 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:05:55,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states.
[2020-10-16 11:05:55,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 645.
[2020-10-16 11:05:55,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states.
[2020-10-16 11:05:55,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1735 transitions.
[2020-10-16 11:05:55,847 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1735 transitions. Word has length 23
[2020-10-16 11:05:55,848 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:55,848 INFO L481 AbstractCegarLoop]: Abstraction has 645 states and 1735 transitions.
[2020-10-16 11:05:55,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:05:55,848 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1735 transitions.
[2020-10-16 11:05:55,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-16 11:05:55,850 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:05:55,851 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:05:55,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 11:05:55,851 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:55,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:55,852 INFO L82 PathProgramCache]: Analyzing trace with hash 2109844507, now seen corresponding path program 2 times
[2020-10-16 11:05:55,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:55,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24233131]
[2020-10-16 11:05:55,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:55,908 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:05:55,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24233131]
[2020-10-16 11:05:55,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:55,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:05:55,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266494858]
[2020-10-16 11:05:55,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:05:55,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:55,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:05:55,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:05:55,910 INFO L87 Difference]: Start difference. First operand 645 states and 1735 transitions. Second operand 4 states.
[2020-10-16 11:05:55,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:55,933 INFO L93 Difference]: Finished difference Result 889 states and 2308 transitions.
[2020-10-16 11:05:55,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2020-10-16 11:05:55,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23
[2020-10-16 11:05:55,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:55,937 INFO L225 Difference]: With dead ends: 889
[2020-10-16 11:05:55,937 INFO L226 Difference]: Without dead ends: 503
[2020-10-16 11:05:55,937 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:05:55,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states.
[2020-10-16 11:05:55,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 501.
[2020-10-16 11:05:55,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states.
[2020-10-16 11:05:55,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 1189 transitions.
[2020-10-16 11:05:55,950 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 1189 transitions. Word has length 23
[2020-10-16 11:05:55,950 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:55,950 INFO L481 AbstractCegarLoop]: Abstraction has 501 states and 1189 transitions.
[2020-10-16 11:05:55,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:05:55,950 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 1189 transitions.
[2020-10-16 11:05:55,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-16 11:05:55,952 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:05:55,952 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:05:55,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 11:05:55,952 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:55,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:55,952 INFO L82 PathProgramCache]: Analyzing trace with hash -751673053, now seen corresponding path program 3 times
[2020-10-16 11:05:55,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:55,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019817954]
[2020-10-16 11:05:55,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:56,067 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:05:56,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019817954]
[2020-10-16 11:05:56,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:56,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-16 11:05:56,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763148471]
[2020-10-16 11:05:56,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 11:05:56,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:56,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 11:05:56,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:05:56,069 INFO L87 Difference]: Start difference. First operand 501 states and 1189 transitions. Second operand 7 states.
[2020-10-16 11:05:56,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:56,141 INFO L93 Difference]: Finished difference Result 476 states and 1140 transitions.
[2020-10-16 11:05:56,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2020-10-16 11:05:56,142 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23
[2020-10-16 11:05:56,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:56,143 INFO L225 Difference]: With dead ends: 476
[2020-10-16 11:05:56,143 INFO L226 Difference]: Without dead ends: 92
[2020-10-16 11:05:56,144 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:05:56,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2020-10-16 11:05:56,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92.
[2020-10-16 11:05:56,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states.
[2020-10-16 11:05:56,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 198 transitions.
[2020-10-16 11:05:56,147 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 198 transitions. Word has length 23
[2020-10-16 11:05:56,147 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:56,147 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 198 transitions.
[2020-10-16 11:05:56,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 11:05:56,147 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 198 transitions.
[2020-10-16 11:05:56,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2020-10-16 11:05:56,148 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:05:56,148 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:05:56,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 11:05:56,148 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:56,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:56,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1597740524, now seen corresponding path program 1 times
[2020-10-16 11:05:56,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:56,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089435450]
[2020-10-16 11:05:56,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:56,404 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:05:56,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089435450]
[2020-10-16 11:05:56,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:56,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 11:05:56,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184175043]
[2020-10-16 11:05:56,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 11:05:56,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:56,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 11:05:56,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:05:56,407 INFO L87 Difference]: Start difference. First operand 92 states and 198 transitions. Second operand 7 states.
[2020-10-16 11:05:56,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:56,537 INFO L93 Difference]: Finished difference Result 110 states and 232 transitions.
[2020-10-16 11:05:56,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2020-10-16 11:05:56,537 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26
[2020-10-16 11:05:56,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:56,538 INFO L225 Difference]: With dead ends: 110
[2020-10-16 11:05:56,538 INFO L226 Difference]: Without dead ends: 56
[2020-10-16 11:05:56,538 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90
[2020-10-16 11:05:56,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states.
[2020-10-16 11:05:56,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56.
[2020-10-16 11:05:56,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states.
[2020-10-16 11:05:56,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 98 transitions.
[2020-10-16 11:05:56,540 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 98 transitions. Word has length 26
[2020-10-16 11:05:56,540 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:56,541 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 98 transitions.
[2020-10-16 11:05:56,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 11:05:56,541 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 98 transitions.
[2020-10-16 11:05:56,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2020-10-16 11:05:56,542 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:05:56,542 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:05:56,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-16 11:05:56,542 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:56,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:56,543 INFO L82 PathProgramCache]: Analyzing trace with hash -2002754452, now seen corresponding path program 2 times
[2020-10-16 11:05:56,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:56,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283643457]
[2020-10-16 11:05:56,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 11:05:56,602 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 11:05:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 11:05:56,675 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 11:05:56,735 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 11:05:56,735 INFO L523 BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 11:05:56,735 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-16 11:05:56,737 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-16 11:05:56,758 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1214] [1214] L871-->L878: Formula: (let ((.cse8 (= (mod ~z$w_buff1_used~0_In-92731038 256) 0)) (.cse9 (= (mod ~z$r_buff1_thd0~0_In-92731038 256) 0)) (.cse6 (= (mod ~z$r_buff0_thd0~0_In-92731038 256) 0)) (.cse7 (= (mod ~z$w_buff0_used~0_In-92731038 256) 0))) (let ((.cse3 (or .cse6 .cse7)) (.cse2 (or .cse8 .cse9)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= ~z$r_buff1_thd0~0_In-92731038 ~z$r_buff1_thd0~0_Out-92731038) (or (and (= ~z$w_buff1_used~0_Out-92731038 0) .cse0 .cse1) (and (= ~z$w_buff1_used~0_Out-92731038 ~z$w_buff1_used~0_In-92731038) .cse2)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-92731038 0)) (= ~z$r_buff0_thd0~0_In-92731038 ~z$r_buff0_thd0~0_Out-92731038) (or (and .cse3 (= ~z$w_buff0_used~0_Out-92731038 ~z$w_buff0_used~0_In-92731038)) (and .cse4 (= ~z$w_buff0_used~0_Out-92731038 0) .cse5)) (or (and .cse3 (or (and .cse2 (= ~z~0_In-92731038 ~z~0_Out-92731038)) (and (= ~z$w_buff1~0_In-92731038 ~z~0_Out-92731038) .cse0 .cse1))) (and .cse4 (= ~z$w_buff0~0_In-92731038 ~z~0_Out-92731038) .cse5)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-92731038| ULTIMATE.start_assume_abort_if_not_~cond_Out-92731038)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-92731038|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-92731038, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-92731038, ~z$w_buff0~0=~z$w_buff0~0_In-92731038, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-92731038, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-92731038, ~z$w_buff1~0=~z$w_buff1~0_In-92731038, ~z~0=~z~0_In-92731038} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-92731038, ~z$w_buff0~0=~z$w_buff0~0_In-92731038, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-92731038, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-92731038|, ~z$w_buff1~0=~z$w_buff1~0_In-92731038, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-92731038|, ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-92731038|, ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-92731038|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-92731038|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-92731038, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-92731038|, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-92731038|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-92731038, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-92731038, ~z~0=~z~0_Out-92731038} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite63, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge
[2020-10-16 11:05:56,771 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:05:56,772 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:56,772 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:05:56,772 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:56,772 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:05:56,773 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:56,773 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:05:56,773 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:56,773 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:05:56,773 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:56,774 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:05:56,774 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:56,774 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:05:56,774 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:56,774 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:05:56,775 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:56,775 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:05:56,775 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:56,775 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:05:56,775 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:56,775 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:05:56,775 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:56,776 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:05:56,776 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:56,778 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:05:56,778 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:56,778 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:05:56,778 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:56,782 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:05:56,783 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:56,783 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:05:56,783 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:56,783 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:05:56,783 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:56,783 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:05:56,784 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:56,784 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:05:56,784 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:56,784 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:05:56,784 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:56,785 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:05:56,785 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:56,785 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:05:56,785 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:56,785 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:05:56,785 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:56,786 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:05:56,786 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:56,786 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:05:56,786 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:56,786 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:05:56,786 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:56,786 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:05:56,787 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:56,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:05:56 BasicIcfg
[2020-10-16 11:05:56,894 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 11:05:56,896 INFO L168 Benchmark]: Toolchain (without parser) took 11931.44 ms. Allocated memory was 140.0 MB in the beginning and 400.6 MB in the end (delta: 260.6 MB). Free memory was 101.4 MB in the beginning and 139.7 MB in the end (delta: -38.3 MB). Peak memory consumption was 222.3 MB. Max. memory is 7.1 GB.
[2020-10-16 11:05:56,897 INFO L168 Benchmark]: CDTParser took 0.19 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: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2020-10-16 11:05:56,897 INFO L168 Benchmark]: CACSL2BoogieTranslator took 727.27 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 101.2 MB in the beginning and 155.1 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:05:56,898 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.90 ms. Allocated memory is still 203.4 MB. Free memory was 155.1 MB in the beginning and 152.4 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:05:56,899 INFO L168 Benchmark]: Boogie Preprocessor took 45.60 ms. Allocated memory is still 203.4 MB. Free memory was 152.4 MB in the beginning and 149.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
[2020-10-16 11:05:56,899 INFO L168 Benchmark]: RCFGBuilder took 2241.00 ms. Allocated memory was 203.4 MB in the beginning and 248.5 MB in the end (delta: 45.1 MB). Free memory was 149.1 MB in the beginning and 110.0 MB in the end (delta: 39.1 MB). Peak memory consumption was 102.5 MB. Max. memory is 7.1 GB.
[2020-10-16 11:05:56,900 INFO L168 Benchmark]: TraceAbstraction took 8841.48 ms. Allocated memory was 248.5 MB in the beginning and 400.6 MB in the end (delta: 152.0 MB). Free memory was 110.0 MB in the beginning and 139.7 MB in the end (delta: -29.7 MB). Peak memory consumption was 122.3 MB. Max. memory is 7.1 GB.
[2020-10-16 11:05:56,904 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.19 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: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 727.27 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 101.2 MB in the beginning and 155.1 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 70.90 ms. Allocated memory is still 203.4 MB. Free memory was 155.1 MB in the beginning and 152.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 45.60 ms. Allocated memory is still 203.4 MB. Free memory was 152.4 MB in the beginning and 149.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 2241.00 ms. Allocated memory was 203.4 MB in the beginning and 248.5 MB in the end (delta: 45.1 MB). Free memory was 149.1 MB in the beginning and 110.0 MB in the end (delta: 39.1 MB). Peak memory consumption was 102.5 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 8841.48 ms. Allocated memory was 248.5 MB in the beginning and 400.6 MB in the end (delta: 152.0 MB). Free memory was 110.0 MB in the beginning and 139.7 MB in the end (delta: -29.7 MB). Peak memory consumption was 122.3 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
1633 VarBasedMoverChecksPositive, 84 VarBasedMoverChecksNegative, 22 SemBasedMoverChecksPositive, 62 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 183 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.9s, 124 PlacesBefore, 45 PlacesAfterwards, 113 TransitionsBefore, 32 TransitionsAfterwards, 2446 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 93 TotalNumberOfCompositions, 6050 MoverChecksTotal
- CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
a call of __VERIFIER_error() is reachable
We found a FailurePath:
[L699] 0 int __unbuffered_cnt = 0;
[L701] 0 int __unbuffered_p0_EAX = 0;
[L703] 0 int __unbuffered_p1_EAX = 0;
[L705] 0 int __unbuffered_p2_EAX = 0;
[L707] 0 int __unbuffered_p2_EBX = 0;
[L709] 0 int __unbuffered_p3_EAX = 0;
[L711] 0 int __unbuffered_p3_EBX = 0;
[L713] 0 int a = 0;
[L714] 0 _Bool main$tmp_guard0;
[L715] 0 _Bool main$tmp_guard1;
[L717] 0 int x = 0;
[L719] 0 int y = 0;
[L721] 0 int z = 0;
[L722] 0 _Bool z$flush_delayed;
[L723] 0 int z$mem_tmp;
[L724] 0 _Bool z$r_buff0_thd0;
[L725] 0 _Bool z$r_buff0_thd1;
[L726] 0 _Bool z$r_buff0_thd2;
[L727] 0 _Bool z$r_buff0_thd3;
[L728] 0 _Bool z$r_buff0_thd4;
[L729] 0 _Bool z$r_buff1_thd0;
[L730] 0 _Bool z$r_buff1_thd1;
[L731] 0 _Bool z$r_buff1_thd2;
[L732] 0 _Bool z$r_buff1_thd3;
[L733] 0 _Bool z$r_buff1_thd4;
[L734] 0 _Bool z$read_delayed;
[L735] 0 int *z$read_delayed_var;
[L736] 0 int z$w_buff0;
[L737] 0 _Bool z$w_buff0_used;
[L738] 0 int z$w_buff1;
[L739] 0 _Bool z$w_buff1_used;
[L740] 0 _Bool weak$$choice0;
[L741] 0 _Bool weak$$choice2;
[L860] 0 pthread_t t101;
[L861] FCALL, FORK 0 pthread_create(&t101, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L862] 0 pthread_t t102;
[L863] FCALL, FORK 0 pthread_create(&t102, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L864] 0 pthread_t t103;
[L865] FCALL, FORK 0 pthread_create(&t103, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L866] 0 pthread_t t104;
[L867] FCALL, FORK 0 pthread_create(&t104, ((void *)0), P3, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L806] 4 z$w_buff1 = z$w_buff0
[L807] 4 z$w_buff0 = 1
[L808] 4 z$w_buff1_used = z$w_buff0_used
[L809] 4 z$w_buff0_used = (_Bool)1
[L7] COND TRUE 4 !expression
[L7] 4 __VERIFIER_error()
[L811] 4 z$r_buff1_thd0 = z$r_buff0_thd0
[L812] 4 z$r_buff1_thd1 = z$r_buff0_thd1
[L813] 4 z$r_buff1_thd2 = z$r_buff0_thd2
[L814] 4 z$r_buff1_thd3 = z$r_buff0_thd3
[L815] 4 z$r_buff1_thd4 = z$r_buff0_thd4
[L816] 4 z$r_buff0_thd4 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L819] 4 weak$$choice0 = __VERIFIER_nondet_bool()
[L820] 4 weak$$choice2 = __VERIFIER_nondet_bool()
[L821] 4 z$flush_delayed = weak$$choice2
[L822] 4 z$mem_tmp = z
[L823] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1)
[L823] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1)
[L824] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0))
[L824] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0))
[L825] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1))
[L825] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)
[L825] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1))
[L825] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1))
[L826] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used))
[L826] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)
[L826] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used))
[L826] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used))
[L827] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L827] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L828] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4))
[L828] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)
[L828] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4))
[L828] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4))
[L829] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L829] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L830] 4 __unbuffered_p3_EAX = z
[L831] EXPR 4 z$flush_delayed ? z$mem_tmp : z
[L831] 4 z = z$flush_delayed ? z$mem_tmp : z
[L832] 4 z$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L835] 4 __unbuffered_p3_EBX = a
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L745] 1 a = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L748] 1 __unbuffered_p0_EAX = x
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L760] 2 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L763] 2 __unbuffered_p1_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L775] 3 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L778] 3 __unbuffered_p2_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L781] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L782] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L783] 3 z$flush_delayed = weak$$choice2
[L784] 3 z$mem_tmp = z
[L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1
[L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L787] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)
[L787] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L788] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L789] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L790] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L790] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L792] 3 __unbuffered_p2_EBX = z
[L793] EXPR 3 z$flush_delayed ? z$mem_tmp : z
[L793] 3 z = z$flush_delayed ? z$mem_tmp : z
[L794] 3 z$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=11, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L838] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L838] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L839] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L839] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L840] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L840] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L841] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L841] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L842] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
[L842] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
[L845] 4 __unbuffered_cnt = __unbuffered_cnt + 1
[L847] 4 return 0;
[L768] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L770] 2 return 0;
[L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L755] 1 return 0;
[L799] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L801] 3 return 0;
[L869] 0 main$tmp_guard0 = __unbuffered_cnt == 4
[L880] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=11, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 5 procedures, 112 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.4s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 394 SDtfs, 375 SDslu, 654 SDs, 0 SdLazy, 216 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3002occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 16647 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...