/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/podwr001_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:55:43,715 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:55:43,718 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:55:43,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:55:43,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:55:43,731 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:55:43,733 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:55:43,734 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:55:43,736 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:55:43,737 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:55:43,738 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:55:43,739 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:55:43,739 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:55:43,740 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:55:43,741 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:55:43,742 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:55:43,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:55:43,744 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:55:43,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:55:43,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:55:43,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:55:43,750 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:55:43,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:55:43,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:55:43,753 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:55:43,754 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:55:43,754 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:55:43,755 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:55:43,755 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:55:43,756 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:55:43,756 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:55:43,757 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:55:43,758 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:55:43,759 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:55:43,760 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:55:43,760 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:55:43,760 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:55:43,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:55:43,761 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:55:43,762 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:55:43,762 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:55:43,763 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:55:43,786 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:55:43,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:55:43,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:55:43,788 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:55:43,788 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:55:43,788 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:55:43,789 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:55:43,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:55:43,789 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:55:43,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:55:43,790 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:55:43,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:55:43,791 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:55:43,791 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:55:43,791 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:55:43,791 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:55:43,792 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:55:43,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:55:43,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:55:43,792 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:55:43,793 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:55:43,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:55:43,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:55:43,793 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:55:43,793 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:55:43,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:55:43,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:55:43,794 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:55:43,794 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:55:43,794 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:55:44,111 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:55:44,131 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:55:44,135 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:55:44,136 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:55:44,136 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:55:44,137 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/podwr001_power.opt.i [2019-12-18 21:55:44,200 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6c7ae1d2/9faaaedc8f514ca99545ad85ae8324f4/FLAGe23b76745 [2019-12-18 21:55:44,806 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:55:44,808 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr001_power.opt.i [2019-12-18 21:55:44,832 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6c7ae1d2/9faaaedc8f514ca99545ad85ae8324f4/FLAGe23b76745 [2019-12-18 21:55:45,025 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6c7ae1d2/9faaaedc8f514ca99545ad85ae8324f4 [2019-12-18 21:55:45,037 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:55:45,039 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:55:45,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:55:45,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:55:45,043 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:55:45,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:55:45" (1/1) ... [2019-12-18 21:55:45,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a30013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:45, skipping insertion in model container [2019-12-18 21:55:45,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:55:45" (1/1) ... [2019-12-18 21:55:45,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:55:45,104 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:55:45,675 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:55:45,696 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:55:45,783 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:55:45,862 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:55:45,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:45 WrapperNode [2019-12-18 21:55:45,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:55:45,864 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:55:45,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:55:45,864 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:55:45,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:45" (1/1) ... [2019-12-18 21:55:45,894 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:45" (1/1) ... [2019-12-18 21:55:45,932 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:55:45,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:55:45,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:55:45,933 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:55:45,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:45" (1/1) ... [2019-12-18 21:55:45,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:45" (1/1) ... [2019-12-18 21:55:45,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:45" (1/1) ... [2019-12-18 21:55:45,947 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:45" (1/1) ... [2019-12-18 21:55:45,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:45" (1/1) ... [2019-12-18 21:55:45,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:45" (1/1) ... [2019-12-18 21:55:45,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:45" (1/1) ... [2019-12-18 21:55:45,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:55:45,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:55:45,973 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:55:45,973 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:55:45,974 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:55:46,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:55:46,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:55:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:55:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:55:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:55:46,036 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:55:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:55:46,037 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:55:46,037 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:55:46,037 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:55:46,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:55:46,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:55:46,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:55:46,039 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:55:46,788 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:55:46,788 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:55:46,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:55:46 BoogieIcfgContainer [2019-12-18 21:55:46,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:55:46,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:55:46,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:55:46,797 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:55:46,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:55:45" (1/3) ... [2019-12-18 21:55:46,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70017a71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:55:46, skipping insertion in model container [2019-12-18 21:55:46,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:45" (2/3) ... [2019-12-18 21:55:46,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70017a71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:55:46, skipping insertion in model container [2019-12-18 21:55:46,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:55:46" (3/3) ... [2019-12-18 21:55:46,803 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr001_power.opt.i [2019-12-18 21:55:46,814 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:55:46,814 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:55:46,827 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:55:46,828 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:55:46,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,893 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,894 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,894 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,895 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,895 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,903 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,903 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,912 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,912 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,959 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,960 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,968 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,968 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,968 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,973 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,974 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:46,992 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 21:55:47,012 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:55:47,012 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:55:47,012 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:55:47,013 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:55:47,013 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:55:47,013 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:55:47,013 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:55:47,013 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:55:47,029 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-18 21:55:47,031 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 21:55:47,123 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 21:55:47,123 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:55:47,144 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 21:55:47,172 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 21:55:47,246 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 21:55:47,246 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:55:47,258 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 21:55:47,283 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 21:55:47,285 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:55:50,753 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 21:55:50,885 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 21:55:50,915 INFO L206 etLargeBlockEncoding]: Checked pairs total: 85326 [2019-12-18 21:55:50,915 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 21:55:50,919 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 108 transitions [2019-12-18 21:56:15,739 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129058 states. [2019-12-18 21:56:15,741 INFO L276 IsEmpty]: Start isEmpty. Operand 129058 states. [2019-12-18 21:56:15,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 21:56:15,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:56:15,747 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 21:56:15,748 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:56:15,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:56:15,757 INFO L82 PathProgramCache]: Analyzing trace with hash 910080, now seen corresponding path program 1 times [2019-12-18 21:56:15,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:56:15,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265136490] [2019-12-18 21:56:15,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:56:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:56:15,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:56:15,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265136490] [2019-12-18 21:56:16,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:56:16,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:56:16,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736979307] [2019-12-18 21:56:16,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:56:16,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:56:16,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:56:16,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:56:16,024 INFO L87 Difference]: Start difference. First operand 129058 states. Second operand 3 states. [2019-12-18 21:56:17,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:56:17,686 INFO L93 Difference]: Finished difference Result 120110 states and 517368 transitions. [2019-12-18 21:56:17,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:56:17,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 21:56:17,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:56:18,417 INFO L225 Difference]: With dead ends: 120110 [2019-12-18 21:56:18,417 INFO L226 Difference]: Without dead ends: 112648 [2019-12-18 21:56:18,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:56:26,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112648 states. [2019-12-18 21:56:29,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112648 to 112648. [2019-12-18 21:56:29,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112648 states. [2019-12-18 21:56:32,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112648 states to 112648 states and 484580 transitions. [2019-12-18 21:56:32,939 INFO L78 Accepts]: Start accepts. Automaton has 112648 states and 484580 transitions. Word has length 3 [2019-12-18 21:56:32,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:56:32,939 INFO L462 AbstractCegarLoop]: Abstraction has 112648 states and 484580 transitions. [2019-12-18 21:56:32,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:56:32,940 INFO L276 IsEmpty]: Start isEmpty. Operand 112648 states and 484580 transitions. [2019-12-18 21:56:32,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:56:32,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:56:32,946 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:56:32,946 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:56:32,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:56:32,947 INFO L82 PathProgramCache]: Analyzing trace with hash 459684969, now seen corresponding path program 1 times [2019-12-18 21:56:32,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:56:32,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196959522] [2019-12-18 21:56:32,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:56:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:56:33,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:56:33,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196959522] [2019-12-18 21:56:33,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:56:33,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:56:33,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476767722] [2019-12-18 21:56:33,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:56:33,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:56:33,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:56:33,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:56:33,055 INFO L87 Difference]: Start difference. First operand 112648 states and 484580 transitions. Second operand 4 states. [2019-12-18 21:56:39,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:56:39,256 INFO L93 Difference]: Finished difference Result 175220 states and 723657 transitions. [2019-12-18 21:56:39,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:56:39,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:56:39,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:56:39,945 INFO L225 Difference]: With dead ends: 175220 [2019-12-18 21:56:39,945 INFO L226 Difference]: Without dead ends: 175171 [2019-12-18 21:56:39,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:56:45,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175171 states. [2019-12-18 21:56:48,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175171 to 161661. [2019-12-18 21:56:48,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161661 states. [2019-12-18 21:56:55,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161661 states to 161661 states and 675776 transitions. [2019-12-18 21:56:55,540 INFO L78 Accepts]: Start accepts. Automaton has 161661 states and 675776 transitions. Word has length 11 [2019-12-18 21:56:55,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:56:55,541 INFO L462 AbstractCegarLoop]: Abstraction has 161661 states and 675776 transitions. [2019-12-18 21:56:55,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:56:55,541 INFO L276 IsEmpty]: Start isEmpty. Operand 161661 states and 675776 transitions. [2019-12-18 21:56:55,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:56:55,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:56:55,547 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:56:55,547 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:56:55,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:56:55,548 INFO L82 PathProgramCache]: Analyzing trace with hash 8923152, now seen corresponding path program 1 times [2019-12-18 21:56:55,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:56:55,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716777815] [2019-12-18 21:56:55,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:56:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:56:55,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:56:55,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716777815] [2019-12-18 21:56:55,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:56:55,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:56:55,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898894908] [2019-12-18 21:56:55,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:56:55,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:56:55,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:56:55,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:56:55,653 INFO L87 Difference]: Start difference. First operand 161661 states and 675776 transitions. Second operand 3 states. [2019-12-18 21:56:55,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:56:55,836 INFO L93 Difference]: Finished difference Result 34935 states and 114696 transitions. [2019-12-18 21:56:55,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:56:55,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 21:56:55,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:56:55,897 INFO L225 Difference]: With dead ends: 34935 [2019-12-18 21:56:55,898 INFO L226 Difference]: Without dead ends: 34935 [2019-12-18 21:56:55,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:56:56,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34935 states. [2019-12-18 21:56:56,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34935 to 34935. [2019-12-18 21:56:56,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34935 states. [2019-12-18 21:56:56,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34935 states to 34935 states and 114696 transitions. [2019-12-18 21:56:56,623 INFO L78 Accepts]: Start accepts. Automaton has 34935 states and 114696 transitions. Word has length 13 [2019-12-18 21:56:56,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:56:56,623 INFO L462 AbstractCegarLoop]: Abstraction has 34935 states and 114696 transitions. [2019-12-18 21:56:56,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:56:56,623 INFO L276 IsEmpty]: Start isEmpty. Operand 34935 states and 114696 transitions. [2019-12-18 21:56:56,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:56:56,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:56:56,626 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:56:56,626 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:56:56,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:56:56,627 INFO L82 PathProgramCache]: Analyzing trace with hash 846496093, now seen corresponding path program 1 times [2019-12-18 21:56:56,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:56:56,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122353456] [2019-12-18 21:56:56,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:56:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:56:56,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:56:56,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122353456] [2019-12-18 21:56:56,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:56:56,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:56:56,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675591944] [2019-12-18 21:56:56,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:56:56,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:56:56,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:56:56,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:56:56,711 INFO L87 Difference]: Start difference. First operand 34935 states and 114696 transitions. Second operand 3 states. [2019-12-18 21:56:56,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:56:56,927 INFO L93 Difference]: Finished difference Result 52469 states and 171833 transitions. [2019-12-18 21:56:56,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:56:56,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 21:56:56,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:56:57,020 INFO L225 Difference]: With dead ends: 52469 [2019-12-18 21:56:57,020 INFO L226 Difference]: Without dead ends: 52469 [2019-12-18 21:56:57,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:56:58,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52469 states. [2019-12-18 21:56:59,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52469 to 39684. [2019-12-18 21:56:59,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39684 states. [2019-12-18 21:56:59,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39684 states to 39684 states and 131828 transitions. [2019-12-18 21:56:59,101 INFO L78 Accepts]: Start accepts. Automaton has 39684 states and 131828 transitions. Word has length 16 [2019-12-18 21:56:59,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:56:59,103 INFO L462 AbstractCegarLoop]: Abstraction has 39684 states and 131828 transitions. [2019-12-18 21:56:59,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:56:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 39684 states and 131828 transitions. [2019-12-18 21:56:59,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:56:59,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:56:59,107 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:56:59,107 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:56:59,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:56:59,108 INFO L82 PathProgramCache]: Analyzing trace with hash 973495126, now seen corresponding path program 1 times [2019-12-18 21:56:59,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:56:59,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663777031] [2019-12-18 21:56:59,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:56:59,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:56:59,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:56:59,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663777031] [2019-12-18 21:56:59,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:56:59,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:56:59,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384213499] [2019-12-18 21:56:59,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:56:59,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:56:59,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:56:59,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:56:59,196 INFO L87 Difference]: Start difference. First operand 39684 states and 131828 transitions. Second operand 5 states. [2019-12-18 21:56:59,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:56:59,717 INFO L93 Difference]: Finished difference Result 54128 states and 176711 transitions. [2019-12-18 21:56:59,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:56:59,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 21:56:59,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:56:59,828 INFO L225 Difference]: With dead ends: 54128 [2019-12-18 21:56:59,829 INFO L226 Difference]: Without dead ends: 54128 [2019-12-18 21:56:59,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:57:00,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54128 states. [2019-12-18 21:57:00,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54128 to 45196. [2019-12-18 21:57:00,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45196 states. [2019-12-18 21:57:01,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45196 states to 45196 states and 149182 transitions. [2019-12-18 21:57:01,612 INFO L78 Accepts]: Start accepts. Automaton has 45196 states and 149182 transitions. Word has length 16 [2019-12-18 21:57:01,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:57:01,612 INFO L462 AbstractCegarLoop]: Abstraction has 45196 states and 149182 transitions. [2019-12-18 21:57:01,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:57:01,612 INFO L276 IsEmpty]: Start isEmpty. Operand 45196 states and 149182 transitions. [2019-12-18 21:57:01,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 21:57:01,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:57:01,626 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:57:01,626 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:57:01,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:57:01,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1203621831, now seen corresponding path program 1 times [2019-12-18 21:57:01,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:57:01,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312510069] [2019-12-18 21:57:01,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:57:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:57:01,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:57:01,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312510069] [2019-12-18 21:57:01,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:57:01,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:57:01,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720936813] [2019-12-18 21:57:01,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:57:01,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:57:01,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:57:01,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:57:01,716 INFO L87 Difference]: Start difference. First operand 45196 states and 149182 transitions. Second operand 6 states. [2019-12-18 21:57:02,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:57:02,654 INFO L93 Difference]: Finished difference Result 67629 states and 216350 transitions. [2019-12-18 21:57:02,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:57:02,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 21:57:02,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:57:02,771 INFO L225 Difference]: With dead ends: 67629 [2019-12-18 21:57:02,771 INFO L226 Difference]: Without dead ends: 67622 [2019-12-18 21:57:02,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:57:03,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67622 states. [2019-12-18 21:57:03,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67622 to 44823. [2019-12-18 21:57:03,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44823 states. [2019-12-18 21:57:03,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44823 states to 44823 states and 147733 transitions. [2019-12-18 21:57:03,724 INFO L78 Accepts]: Start accepts. Automaton has 44823 states and 147733 transitions. Word has length 22 [2019-12-18 21:57:03,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:57:03,724 INFO L462 AbstractCegarLoop]: Abstraction has 44823 states and 147733 transitions. [2019-12-18 21:57:03,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:57:03,724 INFO L276 IsEmpty]: Start isEmpty. Operand 44823 states and 147733 transitions. [2019-12-18 21:57:03,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:57:03,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:57:03,742 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:57:03,742 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:57:03,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:57:03,743 INFO L82 PathProgramCache]: Analyzing trace with hash -573645910, now seen corresponding path program 1 times [2019-12-18 21:57:03,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:57:03,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202356595] [2019-12-18 21:57:03,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:57:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:57:03,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:57:03,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202356595] [2019-12-18 21:57:03,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:57:03,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:57:03,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583983999] [2019-12-18 21:57:03,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:57:03,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:57:03,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:57:03,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:57:03,800 INFO L87 Difference]: Start difference. First operand 44823 states and 147733 transitions. Second operand 4 states. [2019-12-18 21:57:03,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:57:03,896 INFO L93 Difference]: Finished difference Result 18428 states and 57604 transitions. [2019-12-18 21:57:03,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:57:03,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 21:57:03,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:57:03,923 INFO L225 Difference]: With dead ends: 18428 [2019-12-18 21:57:03,923 INFO L226 Difference]: Without dead ends: 18428 [2019-12-18 21:57:03,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:57:04,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18428 states. [2019-12-18 21:57:05,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18428 to 18100. [2019-12-18 21:57:05,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18100 states. [2019-12-18 21:57:05,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18100 states to 18100 states and 56668 transitions. [2019-12-18 21:57:05,242 INFO L78 Accepts]: Start accepts. Automaton has 18100 states and 56668 transitions. Word has length 25 [2019-12-18 21:57:05,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:57:05,243 INFO L462 AbstractCegarLoop]: Abstraction has 18100 states and 56668 transitions. [2019-12-18 21:57:05,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:57:05,243 INFO L276 IsEmpty]: Start isEmpty. Operand 18100 states and 56668 transitions. [2019-12-18 21:57:05,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 21:57:05,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:57:05,257 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:57:05,257 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:57:05,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:57:05,257 INFO L82 PathProgramCache]: Analyzing trace with hash -558988390, now seen corresponding path program 1 times [2019-12-18 21:57:05,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:57:05,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216498088] [2019-12-18 21:57:05,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:57:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:57:05,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:57:05,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216498088] [2019-12-18 21:57:05,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:57:05,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:57:05,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805945404] [2019-12-18 21:57:05,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:57:05,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:57:05,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:57:05,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:57:05,346 INFO L87 Difference]: Start difference. First operand 18100 states and 56668 transitions. Second operand 6 states. [2019-12-18 21:57:06,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:57:06,032 INFO L93 Difference]: Finished difference Result 25507 states and 76943 transitions. [2019-12-18 21:57:06,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:57:06,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 21:57:06,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:57:06,069 INFO L225 Difference]: With dead ends: 25507 [2019-12-18 21:57:06,069 INFO L226 Difference]: Without dead ends: 25507 [2019-12-18 21:57:06,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:57:06,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25507 states. [2019-12-18 21:57:06,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25507 to 20897. [2019-12-18 21:57:06,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20897 states. [2019-12-18 21:57:06,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20897 states to 20897 states and 64463 transitions. [2019-12-18 21:57:06,437 INFO L78 Accepts]: Start accepts. Automaton has 20897 states and 64463 transitions. Word has length 27 [2019-12-18 21:57:06,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:57:06,437 INFO L462 AbstractCegarLoop]: Abstraction has 20897 states and 64463 transitions. [2019-12-18 21:57:06,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:57:06,438 INFO L276 IsEmpty]: Start isEmpty. Operand 20897 states and 64463 transitions. [2019-12-18 21:57:06,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 21:57:06,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:57:06,461 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:57:06,462 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:57:06,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:57:06,462 INFO L82 PathProgramCache]: Analyzing trace with hash -856650103, now seen corresponding path program 1 times [2019-12-18 21:57:06,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:57:06,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803317150] [2019-12-18 21:57:06,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:57:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:57:06,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:57:06,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803317150] [2019-12-18 21:57:06,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:57:06,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:57:06,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128781557] [2019-12-18 21:57:06,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:57:06,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:57:06,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:57:06,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:57:06,557 INFO L87 Difference]: Start difference. First operand 20897 states and 64463 transitions. Second operand 7 states. [2019-12-18 21:57:07,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:57:07,796 INFO L93 Difference]: Finished difference Result 28486 states and 85230 transitions. [2019-12-18 21:57:07,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 21:57:07,797 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 21:57:07,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:57:07,839 INFO L225 Difference]: With dead ends: 28486 [2019-12-18 21:57:07,839 INFO L226 Difference]: Without dead ends: 28486 [2019-12-18 21:57:07,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:57:07,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28486 states. [2019-12-18 21:57:08,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28486 to 19834. [2019-12-18 21:57:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19834 states. [2019-12-18 21:57:08,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19834 states to 19834 states and 61281 transitions. [2019-12-18 21:57:08,215 INFO L78 Accepts]: Start accepts. Automaton has 19834 states and 61281 transitions. Word has length 33 [2019-12-18 21:57:08,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:57:08,215 INFO L462 AbstractCegarLoop]: Abstraction has 19834 states and 61281 transitions. [2019-12-18 21:57:08,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:57:08,215 INFO L276 IsEmpty]: Start isEmpty. Operand 19834 states and 61281 transitions. [2019-12-18 21:57:08,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:57:08,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:57:08,962 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:57:08,963 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:57:08,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:57:08,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1785376658, now seen corresponding path program 1 times [2019-12-18 21:57:08,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:57:08,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121059198] [2019-12-18 21:57:08,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:57:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:57:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:57:09,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121059198] [2019-12-18 21:57:09,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:57:09,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:57:09,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568702324] [2019-12-18 21:57:09,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:57:09,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:57:09,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:57:09,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:57:09,045 INFO L87 Difference]: Start difference. First operand 19834 states and 61281 transitions. Second operand 5 states. [2019-12-18 21:57:09,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:57:09,740 INFO L93 Difference]: Finished difference Result 28283 states and 86522 transitions. [2019-12-18 21:57:09,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:57:09,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 21:57:09,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:57:09,784 INFO L225 Difference]: With dead ends: 28283 [2019-12-18 21:57:09,784 INFO L226 Difference]: Without dead ends: 28283 [2019-12-18 21:57:09,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:57:09,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28283 states. [2019-12-18 21:57:10,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28283 to 26386. [2019-12-18 21:57:10,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26386 states. [2019-12-18 21:57:10,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26386 states to 26386 states and 81240 transitions. [2019-12-18 21:57:10,219 INFO L78 Accepts]: Start accepts. Automaton has 26386 states and 81240 transitions. Word has length 39 [2019-12-18 21:57:10,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:57:10,220 INFO L462 AbstractCegarLoop]: Abstraction has 26386 states and 81240 transitions. [2019-12-18 21:57:10,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:57:10,220 INFO L276 IsEmpty]: Start isEmpty. Operand 26386 states and 81240 transitions. [2019-12-18 21:57:10,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:57:10,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:57:10,251 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:57:10,251 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:57:10,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:57:10,251 INFO L82 PathProgramCache]: Analyzing trace with hash -967157718, now seen corresponding path program 2 times [2019-12-18 21:57:10,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:57:10,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101629152] [2019-12-18 21:57:10,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:57:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:57:10,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:57:10,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101629152] [2019-12-18 21:57:10,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:57:10,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:57:10,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157157715] [2019-12-18 21:57:10,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:57:10,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:57:10,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:57:10,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:57:10,325 INFO L87 Difference]: Start difference. First operand 26386 states and 81240 transitions. Second operand 5 states. [2019-12-18 21:57:10,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:57:10,434 INFO L93 Difference]: Finished difference Result 24998 states and 77951 transitions. [2019-12-18 21:57:10,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:57:10,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 21:57:10,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:57:10,470 INFO L225 Difference]: With dead ends: 24998 [2019-12-18 21:57:10,471 INFO L226 Difference]: Without dead ends: 24998 [2019-12-18 21:57:10,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:57:10,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24998 states. [2019-12-18 21:57:10,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24998 to 24032. [2019-12-18 21:57:10,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24032 states. [2019-12-18 21:57:10,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24032 states to 24032 states and 75345 transitions. [2019-12-18 21:57:10,859 INFO L78 Accepts]: Start accepts. Automaton has 24032 states and 75345 transitions. Word has length 39 [2019-12-18 21:57:10,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:57:10,859 INFO L462 AbstractCegarLoop]: Abstraction has 24032 states and 75345 transitions. [2019-12-18 21:57:10,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:57:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand 24032 states and 75345 transitions. [2019-12-18 21:57:10,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:57:10,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:57:10,884 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:57:10,884 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:57:10,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:57:10,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1198798044, now seen corresponding path program 1 times [2019-12-18 21:57:10,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:57:10,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348494319] [2019-12-18 21:57:10,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:57:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:57:10,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:57:10,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348494319] [2019-12-18 21:57:10,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:57:10,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:57:10,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463107955] [2019-12-18 21:57:10,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:57:11,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:57:11,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:57:11,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:57:11,000 INFO L87 Difference]: Start difference. First operand 24032 states and 75345 transitions. Second operand 7 states. [2019-12-18 21:57:13,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:57:13,324 INFO L93 Difference]: Finished difference Result 67799 states and 211747 transitions. [2019-12-18 21:57:13,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:57:13,324 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 21:57:13,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:57:13,413 INFO L225 Difference]: With dead ends: 67799 [2019-12-18 21:57:13,413 INFO L226 Difference]: Without dead ends: 51948 [2019-12-18 21:57:13,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:57:13,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51948 states. [2019-12-18 21:57:13,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51948 to 27688. [2019-12-18 21:57:13,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27688 states. [2019-12-18 21:57:14,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27688 states to 27688 states and 87532 transitions. [2019-12-18 21:57:14,047 INFO L78 Accepts]: Start accepts. Automaton has 27688 states and 87532 transitions. Word has length 64 [2019-12-18 21:57:14,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:57:14,047 INFO L462 AbstractCegarLoop]: Abstraction has 27688 states and 87532 transitions. [2019-12-18 21:57:14,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:57:14,047 INFO L276 IsEmpty]: Start isEmpty. Operand 27688 states and 87532 transitions. [2019-12-18 21:57:14,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:57:14,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:57:14,090 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:57:14,091 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:57:14,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:57:14,091 INFO L82 PathProgramCache]: Analyzing trace with hash 207970498, now seen corresponding path program 2 times [2019-12-18 21:57:14,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:57:14,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965863864] [2019-12-18 21:57:14,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:57:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:57:14,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:57:14,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965863864] [2019-12-18 21:57:14,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:57:14,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:57:14,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559684238] [2019-12-18 21:57:14,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:57:14,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:57:14,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:57:14,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:57:14,185 INFO L87 Difference]: Start difference. First operand 27688 states and 87532 transitions. Second operand 7 states. [2019-12-18 21:57:14,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:57:14,758 INFO L93 Difference]: Finished difference Result 76922 states and 238949 transitions. [2019-12-18 21:57:14,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:57:14,758 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 21:57:14,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:57:14,844 INFO L225 Difference]: With dead ends: 76922 [2019-12-18 21:57:14,844 INFO L226 Difference]: Without dead ends: 54229 [2019-12-18 21:57:14,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:57:15,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54229 states. [2019-12-18 21:57:15,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54229 to 32348. [2019-12-18 21:57:15,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32348 states. [2019-12-18 21:57:15,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32348 states to 32348 states and 102236 transitions. [2019-12-18 21:57:15,898 INFO L78 Accepts]: Start accepts. Automaton has 32348 states and 102236 transitions. Word has length 64 [2019-12-18 21:57:15,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:57:15,898 INFO L462 AbstractCegarLoop]: Abstraction has 32348 states and 102236 transitions. [2019-12-18 21:57:15,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:57:15,898 INFO L276 IsEmpty]: Start isEmpty. Operand 32348 states and 102236 transitions. [2019-12-18 21:57:15,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:57:15,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:57:15,935 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:57:15,935 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:57:15,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:57:15,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1789319912, now seen corresponding path program 3 times [2019-12-18 21:57:15,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:57:15,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945496152] [2019-12-18 21:57:15,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:57:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:57:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:57:16,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945496152] [2019-12-18 21:57:16,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:57:16,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:57:16,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694621195] [2019-12-18 21:57:16,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:57:16,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:57:16,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:57:16,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:57:16,034 INFO L87 Difference]: Start difference. First operand 32348 states and 102236 transitions. Second operand 7 states. [2019-12-18 21:57:16,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:57:16,704 INFO L93 Difference]: Finished difference Result 65367 states and 203736 transitions. [2019-12-18 21:57:16,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:57:16,704 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 21:57:16,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:57:16,833 INFO L225 Difference]: With dead ends: 65367 [2019-12-18 21:57:16,833 INFO L226 Difference]: Without dead ends: 58008 [2019-12-18 21:57:16,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:57:17,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58008 states. [2019-12-18 21:57:17,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58008 to 32656. [2019-12-18 21:57:17,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32656 states. [2019-12-18 21:57:17,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32656 states to 32656 states and 103187 transitions. [2019-12-18 21:57:17,878 INFO L78 Accepts]: Start accepts. Automaton has 32656 states and 103187 transitions. Word has length 64 [2019-12-18 21:57:17,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:57:17,879 INFO L462 AbstractCegarLoop]: Abstraction has 32656 states and 103187 transitions. [2019-12-18 21:57:17,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:57:17,879 INFO L276 IsEmpty]: Start isEmpty. Operand 32656 states and 103187 transitions. [2019-12-18 21:57:17,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:57:17,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:57:17,917 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:57:17,917 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:57:17,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:57:17,918 INFO L82 PathProgramCache]: Analyzing trace with hash 755538776, now seen corresponding path program 4 times [2019-12-18 21:57:17,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:57:17,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288095603] [2019-12-18 21:57:17,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:57:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:57:18,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:57:18,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288095603] [2019-12-18 21:57:18,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:57:18,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:57:18,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493751595] [2019-12-18 21:57:18,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:57:18,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:57:18,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:57:18,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:57:18,024 INFO L87 Difference]: Start difference. First operand 32656 states and 103187 transitions. Second operand 3 states. [2019-12-18 21:57:18,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:57:18,225 INFO L93 Difference]: Finished difference Result 39410 states and 123345 transitions. [2019-12-18 21:57:18,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:57:18,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 21:57:18,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:57:18,302 INFO L225 Difference]: With dead ends: 39410 [2019-12-18 21:57:18,302 INFO L226 Difference]: Without dead ends: 39410 [2019-12-18 21:57:18,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:57:18,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39410 states. [2019-12-18 21:57:18,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39410 to 34552. [2019-12-18 21:57:18,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34552 states. [2019-12-18 21:57:18,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34552 states to 34552 states and 109132 transitions. [2019-12-18 21:57:18,922 INFO L78 Accepts]: Start accepts. Automaton has 34552 states and 109132 transitions. Word has length 64 [2019-12-18 21:57:18,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:57:18,922 INFO L462 AbstractCegarLoop]: Abstraction has 34552 states and 109132 transitions. [2019-12-18 21:57:18,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:57:18,922 INFO L276 IsEmpty]: Start isEmpty. Operand 34552 states and 109132 transitions. [2019-12-18 21:57:18,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:57:18,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:57:18,963 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:57:18,964 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:57:18,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:57:18,964 INFO L82 PathProgramCache]: Analyzing trace with hash -2009701319, now seen corresponding path program 1 times [2019-12-18 21:57:18,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:57:18,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585913914] [2019-12-18 21:57:18,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:57:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:57:19,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:57:19,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585913914] [2019-12-18 21:57:19,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:57:19,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:57:19,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509403473] [2019-12-18 21:57:19,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:57:19,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:57:19,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:57:19,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:57:19,028 INFO L87 Difference]: Start difference. First operand 34552 states and 109132 transitions. Second operand 4 states. [2019-12-18 21:57:19,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:57:19,721 INFO L93 Difference]: Finished difference Result 53912 states and 170313 transitions. [2019-12-18 21:57:19,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:57:19,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 21:57:19,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:57:19,804 INFO L225 Difference]: With dead ends: 53912 [2019-12-18 21:57:19,805 INFO L226 Difference]: Without dead ends: 53912 [2019-12-18 21:57:19,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:57:19,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53912 states. [2019-12-18 21:57:20,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53912 to 37800. [2019-12-18 21:57:20,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37800 states. [2019-12-18 21:57:20,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37800 states to 37800 states and 120622 transitions. [2019-12-18 21:57:20,549 INFO L78 Accepts]: Start accepts. Automaton has 37800 states and 120622 transitions. Word has length 65 [2019-12-18 21:57:20,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:57:20,549 INFO L462 AbstractCegarLoop]: Abstraction has 37800 states and 120622 transitions. [2019-12-18 21:57:20,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:57:20,549 INFO L276 IsEmpty]: Start isEmpty. Operand 37800 states and 120622 transitions. [2019-12-18 21:57:20,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:57:20,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:57:20,594 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:57:20,594 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:57:20,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:57:20,594 INFO L82 PathProgramCache]: Analyzing trace with hash 2089376379, now seen corresponding path program 2 times [2019-12-18 21:57:20,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:57:20,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075726861] [2019-12-18 21:57:20,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:57:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:57:20,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:57:20,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075726861] [2019-12-18 21:57:20,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:57:20,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:57:20,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876123656] [2019-12-18 21:57:20,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:57:20,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:57:20,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:57:20,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:57:20,648 INFO L87 Difference]: Start difference. First operand 37800 states and 120622 transitions. Second operand 3 states. [2019-12-18 21:57:20,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:57:20,955 INFO L93 Difference]: Finished difference Result 53096 states and 168447 transitions. [2019-12-18 21:57:20,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:57:20,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 21:57:20,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:57:21,040 INFO L225 Difference]: With dead ends: 53096 [2019-12-18 21:57:21,040 INFO L226 Difference]: Without dead ends: 53096 [2019-12-18 21:57:21,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:57:21,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53096 states. [2019-12-18 21:57:21,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53096 to 38139. [2019-12-18 21:57:21,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38139 states. [2019-12-18 21:57:22,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38139 states to 38139 states and 121744 transitions. [2019-12-18 21:57:22,075 INFO L78 Accepts]: Start accepts. Automaton has 38139 states and 121744 transitions. Word has length 65 [2019-12-18 21:57:22,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:57:22,076 INFO L462 AbstractCegarLoop]: Abstraction has 38139 states and 121744 transitions. [2019-12-18 21:57:22,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:57:22,076 INFO L276 IsEmpty]: Start isEmpty. Operand 38139 states and 121744 transitions. [2019-12-18 21:57:22,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:57:22,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:57:22,120 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:57:22,120 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:57:22,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:57:22,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1218113347, now seen corresponding path program 3 times [2019-12-18 21:57:22,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:57:22,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365547638] [2019-12-18 21:57:22,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:57:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:57:22,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:57:22,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365547638] [2019-12-18 21:57:22,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:57:22,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:57:22,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46261414] [2019-12-18 21:57:22,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:57:22,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:57:22,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:57:22,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:57:22,182 INFO L87 Difference]: Start difference. First operand 38139 states and 121744 transitions. Second operand 4 states. [2019-12-18 21:57:22,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:57:22,593 INFO L93 Difference]: Finished difference Result 47614 states and 149860 transitions. [2019-12-18 21:57:22,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:57:22,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 21:57:22,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:57:22,693 INFO L225 Difference]: With dead ends: 47614 [2019-12-18 21:57:22,694 INFO L226 Difference]: Without dead ends: 47614 [2019-12-18 21:57:22,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:57:22,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47614 states. [2019-12-18 21:57:23,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47614 to 38055. [2019-12-18 21:57:23,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38055 states. [2019-12-18 21:57:23,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38055 states to 38055 states and 121477 transitions. [2019-12-18 21:57:23,490 INFO L78 Accepts]: Start accepts. Automaton has 38055 states and 121477 transitions. Word has length 65 [2019-12-18 21:57:23,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:57:23,491 INFO L462 AbstractCegarLoop]: Abstraction has 38055 states and 121477 transitions. [2019-12-18 21:57:23,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:57:23,491 INFO L276 IsEmpty]: Start isEmpty. Operand 38055 states and 121477 transitions. [2019-12-18 21:57:23,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:57:23,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:57:23,537 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:57:23,537 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:57:23,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:57:23,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1789961201, now seen corresponding path program 4 times [2019-12-18 21:57:23,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:57:23,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452828477] [2019-12-18 21:57:23,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:57:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:57:24,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:57:24,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452828477] [2019-12-18 21:57:24,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:57:24,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:57:24,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800342381] [2019-12-18 21:57:24,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:57:24,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:57:24,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:57:24,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:57:24,034 INFO L87 Difference]: Start difference. First operand 38055 states and 121477 transitions. Second operand 7 states. [2019-12-18 21:57:24,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:57:24,591 INFO L93 Difference]: Finished difference Result 80005 states and 251266 transitions. [2019-12-18 21:57:24,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 21:57:24,591 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 21:57:24,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:57:24,710 INFO L225 Difference]: With dead ends: 80005 [2019-12-18 21:57:24,710 INFO L226 Difference]: Without dead ends: 73765 [2019-12-18 21:57:24,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:57:24,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73765 states. [2019-12-18 21:57:25,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73765 to 38119. [2019-12-18 21:57:25,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38119 states. [2019-12-18 21:57:25,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38119 states to 38119 states and 121695 transitions. [2019-12-18 21:57:25,624 INFO L78 Accepts]: Start accepts. Automaton has 38119 states and 121695 transitions. Word has length 65 [2019-12-18 21:57:25,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:57:25,624 INFO L462 AbstractCegarLoop]: Abstraction has 38119 states and 121695 transitions. [2019-12-18 21:57:25,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:57:25,624 INFO L276 IsEmpty]: Start isEmpty. Operand 38119 states and 121695 transitions. [2019-12-18 21:57:25,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:57:25,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:57:25,670 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:57:25,670 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:57:25,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:57:25,670 INFO L82 PathProgramCache]: Analyzing trace with hash 206855563, now seen corresponding path program 5 times [2019-12-18 21:57:25,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:57:25,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061382340] [2019-12-18 21:57:25,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:57:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:57:25,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:57:25,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061382340] [2019-12-18 21:57:25,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:57:25,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:57:25,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511569653] [2019-12-18 21:57:25,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:57:25,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:57:25,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:57:25,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:57:25,763 INFO L87 Difference]: Start difference. First operand 38119 states and 121695 transitions. Second operand 6 states. [2019-12-18 21:57:26,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:57:26,988 INFO L93 Difference]: Finished difference Result 60800 states and 193788 transitions. [2019-12-18 21:57:26,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:57:26,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 21:57:26,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:57:27,084 INFO L225 Difference]: With dead ends: 60800 [2019-12-18 21:57:27,084 INFO L226 Difference]: Without dead ends: 60800 [2019-12-18 21:57:27,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:57:27,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60800 states. [2019-12-18 21:57:27,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60800 to 39093. [2019-12-18 21:57:27,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39093 states. [2019-12-18 21:57:27,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39093 states to 39093 states and 124695 transitions. [2019-12-18 21:57:27,890 INFO L78 Accepts]: Start accepts. Automaton has 39093 states and 124695 transitions. Word has length 65 [2019-12-18 21:57:27,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:57:27,890 INFO L462 AbstractCegarLoop]: Abstraction has 39093 states and 124695 transitions. [2019-12-18 21:57:27,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:57:27,890 INFO L276 IsEmpty]: Start isEmpty. Operand 39093 states and 124695 transitions. [2019-12-18 21:57:27,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:57:27,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:57:27,936 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:57:27,937 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:57:27,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:57:27,937 INFO L82 PathProgramCache]: Analyzing trace with hash -217073613, now seen corresponding path program 6 times [2019-12-18 21:57:27,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:57:27,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493869334] [2019-12-18 21:57:27,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:57:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:57:28,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:57:28,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493869334] [2019-12-18 21:57:28,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:57:28,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:57:28,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930372616] [2019-12-18 21:57:28,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:57:28,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:57:28,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:57:28,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:57:28,009 INFO L87 Difference]: Start difference. First operand 39093 states and 124695 transitions. Second operand 4 states. [2019-12-18 21:57:28,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:57:28,238 INFO L93 Difference]: Finished difference Result 47014 states and 149097 transitions. [2019-12-18 21:57:28,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:57:28,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 21:57:28,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:57:28,309 INFO L225 Difference]: With dead ends: 47014 [2019-12-18 21:57:28,309 INFO L226 Difference]: Without dead ends: 47014 [2019-12-18 21:57:28,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:57:28,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47014 states. [2019-12-18 21:57:29,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47014 to 36010. [2019-12-18 21:57:29,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36010 states. [2019-12-18 21:57:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36010 states to 36010 states and 114136 transitions. [2019-12-18 21:57:29,401 INFO L78 Accepts]: Start accepts. Automaton has 36010 states and 114136 transitions. Word has length 65 [2019-12-18 21:57:29,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:57:29,402 INFO L462 AbstractCegarLoop]: Abstraction has 36010 states and 114136 transitions. [2019-12-18 21:57:29,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:57:29,402 INFO L276 IsEmpty]: Start isEmpty. Operand 36010 states and 114136 transitions. [2019-12-18 21:57:29,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:57:29,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:57:29,446 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:57:29,446 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:57:29,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:57:29,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1865713068, now seen corresponding path program 1 times [2019-12-18 21:57:29,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:57:29,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277360299] [2019-12-18 21:57:29,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:57:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:57:29,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:57:29,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277360299] [2019-12-18 21:57:29,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:57:29,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:57:29,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853517865] [2019-12-18 21:57:29,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:57:29,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:57:29,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:57:29,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:57:29,497 INFO L87 Difference]: Start difference. First operand 36010 states and 114136 transitions. Second operand 3 states. [2019-12-18 21:57:29,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:57:29,617 INFO L93 Difference]: Finished difference Result 30325 states and 94481 transitions. [2019-12-18 21:57:29,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:57:29,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 21:57:29,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:57:29,659 INFO L225 Difference]: With dead ends: 30325 [2019-12-18 21:57:29,659 INFO L226 Difference]: Without dead ends: 30325 [2019-12-18 21:57:29,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:57:29,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30325 states. [2019-12-18 21:57:30,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30325 to 28309. [2019-12-18 21:57:30,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28309 states. [2019-12-18 21:57:30,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28309 states to 28309 states and 87885 transitions. [2019-12-18 21:57:30,106 INFO L78 Accepts]: Start accepts. Automaton has 28309 states and 87885 transitions. Word has length 65 [2019-12-18 21:57:30,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:57:30,106 INFO L462 AbstractCegarLoop]: Abstraction has 28309 states and 87885 transitions. [2019-12-18 21:57:30,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:57:30,107 INFO L276 IsEmpty]: Start isEmpty. Operand 28309 states and 87885 transitions. [2019-12-18 21:57:30,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:57:30,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:57:30,136 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:57:30,136 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:57:30,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:57:30,137 INFO L82 PathProgramCache]: Analyzing trace with hash 761077449, now seen corresponding path program 1 times [2019-12-18 21:57:30,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:57:30,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439444655] [2019-12-18 21:57:30,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:57:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:57:30,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:57:30,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439444655] [2019-12-18 21:57:30,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:57:30,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:57:30,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760510086] [2019-12-18 21:57:30,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 21:57:30,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:57:30,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 21:57:30,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:57:30,305 INFO L87 Difference]: Start difference. First operand 28309 states and 87885 transitions. Second operand 10 states. [2019-12-18 21:57:31,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:57:31,802 INFO L93 Difference]: Finished difference Result 41561 states and 128742 transitions. [2019-12-18 21:57:31,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 21:57:31,803 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 21:57:31,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:57:31,870 INFO L225 Difference]: With dead ends: 41561 [2019-12-18 21:57:31,870 INFO L226 Difference]: Without dead ends: 32879 [2019-12-18 21:57:31,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:57:32,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32879 states. [2019-12-18 21:57:32,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32879 to 28657. [2019-12-18 21:57:32,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28657 states. [2019-12-18 21:57:32,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28657 states to 28657 states and 88856 transitions. [2019-12-18 21:57:32,418 INFO L78 Accepts]: Start accepts. Automaton has 28657 states and 88856 transitions. Word has length 66 [2019-12-18 21:57:32,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:57:32,418 INFO L462 AbstractCegarLoop]: Abstraction has 28657 states and 88856 transitions. [2019-12-18 21:57:32,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 21:57:32,418 INFO L276 IsEmpty]: Start isEmpty. Operand 28657 states and 88856 transitions. [2019-12-18 21:57:32,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:57:32,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:57:32,756 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:57:32,756 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:57:32,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:57:32,756 INFO L82 PathProgramCache]: Analyzing trace with hash 707957395, now seen corresponding path program 2 times [2019-12-18 21:57:32,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:57:32,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159878111] [2019-12-18 21:57:32,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:57:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:57:32,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:57:32,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159878111] [2019-12-18 21:57:32,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:57:32,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:57:32,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280569154] [2019-12-18 21:57:32,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 21:57:32,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:57:32,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 21:57:32,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:57:32,945 INFO L87 Difference]: Start difference. First operand 28657 states and 88856 transitions. Second operand 10 states. [2019-12-18 21:57:34,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:57:34,496 INFO L93 Difference]: Finished difference Result 42449 states and 130591 transitions. [2019-12-18 21:57:34,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:57:34,497 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 21:57:34,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:57:34,551 INFO L225 Difference]: With dead ends: 42449 [2019-12-18 21:57:34,552 INFO L226 Difference]: Without dead ends: 35445 [2019-12-18 21:57:34,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-18 21:57:34,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35445 states. [2019-12-18 21:57:35,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35445 to 29208. [2019-12-18 21:57:35,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29208 states. [2019-12-18 21:57:35,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29208 states to 29208 states and 90265 transitions. [2019-12-18 21:57:35,067 INFO L78 Accepts]: Start accepts. Automaton has 29208 states and 90265 transitions. Word has length 66 [2019-12-18 21:57:35,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:57:35,068 INFO L462 AbstractCegarLoop]: Abstraction has 29208 states and 90265 transitions. [2019-12-18 21:57:35,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 21:57:35,068 INFO L276 IsEmpty]: Start isEmpty. Operand 29208 states and 90265 transitions. [2019-12-18 21:57:35,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:57:35,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:57:35,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:57:35,100 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:57:35,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:57:35,100 INFO L82 PathProgramCache]: Analyzing trace with hash 179618355, now seen corresponding path program 3 times [2019-12-18 21:57:35,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:57:35,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966871875] [2019-12-18 21:57:35,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:57:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:57:35,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:57:35,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966871875] [2019-12-18 21:57:35,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:57:35,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:57:35,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110538325] [2019-12-18 21:57:35,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:57:35,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:57:35,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:57:35,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:57:35,279 INFO L87 Difference]: Start difference. First operand 29208 states and 90265 transitions. Second operand 11 states. [2019-12-18 21:57:36,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:57:36,737 INFO L93 Difference]: Finished difference Result 39436 states and 121369 transitions. [2019-12-18 21:57:36,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 21:57:36,737 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 21:57:36,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:57:36,788 INFO L225 Difference]: With dead ends: 39436 [2019-12-18 21:57:36,788 INFO L226 Difference]: Without dead ends: 34974 [2019-12-18 21:57:36,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-18 21:57:36,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34974 states. [2019-12-18 21:57:37,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34974 to 28844. [2019-12-18 21:57:37,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28844 states. [2019-12-18 21:57:37,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28844 states to 28844 states and 89124 transitions. [2019-12-18 21:57:37,594 INFO L78 Accepts]: Start accepts. Automaton has 28844 states and 89124 transitions. Word has length 66 [2019-12-18 21:57:37,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:57:37,594 INFO L462 AbstractCegarLoop]: Abstraction has 28844 states and 89124 transitions. [2019-12-18 21:57:37,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:57:37,594 INFO L276 IsEmpty]: Start isEmpty. Operand 28844 states and 89124 transitions. [2019-12-18 21:57:37,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:57:37,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:57:37,628 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:57:37,628 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:57:37,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:57:37,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1191736245, now seen corresponding path program 4 times [2019-12-18 21:57:37,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:57:37,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65500582] [2019-12-18 21:57:37,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:57:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:57:37,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:57:37,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65500582] [2019-12-18 21:57:37,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:57:37,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:57:37,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945240542] [2019-12-18 21:57:37,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:57:37,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:57:37,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:57:37,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:57:37,691 INFO L87 Difference]: Start difference. First operand 28844 states and 89124 transitions. Second operand 3 states. [2019-12-18 21:57:37,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:57:37,811 INFO L93 Difference]: Finished difference Result 28844 states and 89123 transitions. [2019-12-18 21:57:37,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:57:37,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 21:57:37,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:57:37,853 INFO L225 Difference]: With dead ends: 28844 [2019-12-18 21:57:37,853 INFO L226 Difference]: Without dead ends: 28844 [2019-12-18 21:57:37,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:57:37,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28844 states. [2019-12-18 21:57:38,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28844 to 24805. [2019-12-18 21:57:38,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24805 states. [2019-12-18 21:57:38,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24805 states to 24805 states and 77645 transitions. [2019-12-18 21:57:38,287 INFO L78 Accepts]: Start accepts. Automaton has 24805 states and 77645 transitions. Word has length 66 [2019-12-18 21:57:38,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:57:38,287 INFO L462 AbstractCegarLoop]: Abstraction has 24805 states and 77645 transitions. [2019-12-18 21:57:38,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:57:38,287 INFO L276 IsEmpty]: Start isEmpty. Operand 24805 states and 77645 transitions. [2019-12-18 21:57:38,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:57:38,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:57:38,314 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:57:38,315 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:57:38,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:57:38,315 INFO L82 PathProgramCache]: Analyzing trace with hash 455548979, now seen corresponding path program 1 times [2019-12-18 21:57:38,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:57:38,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387855290] [2019-12-18 21:57:38,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:57:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:57:38,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:57:38,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387855290] [2019-12-18 21:57:38,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:57:38,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:57:38,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010599700] [2019-12-18 21:57:38,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:57:38,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:57:38,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:57:38,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:57:38,494 INFO L87 Difference]: Start difference. First operand 24805 states and 77645 transitions. Second operand 11 states. [2019-12-18 21:57:39,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:57:39,783 INFO L93 Difference]: Finished difference Result 50603 states and 158867 transitions. [2019-12-18 21:57:39,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 21:57:39,783 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 21:57:39,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:57:39,856 INFO L225 Difference]: With dead ends: 50603 [2019-12-18 21:57:39,856 INFO L226 Difference]: Without dead ends: 48055 [2019-12-18 21:57:39,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 21:57:40,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48055 states. [2019-12-18 21:57:40,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48055 to 28332. [2019-12-18 21:57:40,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28332 states. [2019-12-18 21:57:40,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28332 states to 28332 states and 88818 transitions. [2019-12-18 21:57:40,470 INFO L78 Accepts]: Start accepts. Automaton has 28332 states and 88818 transitions. Word has length 67 [2019-12-18 21:57:40,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:57:40,470 INFO L462 AbstractCegarLoop]: Abstraction has 28332 states and 88818 transitions. [2019-12-18 21:57:40,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:57:40,470 INFO L276 IsEmpty]: Start isEmpty. Operand 28332 states and 88818 transitions. [2019-12-18 21:57:40,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:57:40,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:57:40,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:57:40,795 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:57:40,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:57:40,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1142961965, now seen corresponding path program 2 times [2019-12-18 21:57:40,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:57:40,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399237248] [2019-12-18 21:57:40,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:57:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:57:40,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:57:40,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399237248] [2019-12-18 21:57:40,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:57:40,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:57:40,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486929291] [2019-12-18 21:57:40,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:57:40,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:57:40,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:57:40,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:57:40,955 INFO L87 Difference]: Start difference. First operand 28332 states and 88818 transitions. Second operand 11 states. [2019-12-18 21:57:42,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:57:42,008 INFO L93 Difference]: Finished difference Result 48656 states and 152081 transitions. [2019-12-18 21:57:42,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 21:57:42,009 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 21:57:42,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:57:42,069 INFO L225 Difference]: With dead ends: 48656 [2019-12-18 21:57:42,069 INFO L226 Difference]: Without dead ends: 40243 [2019-12-18 21:57:42,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 21:57:42,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40243 states. [2019-12-18 21:57:42,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40243 to 23379. [2019-12-18 21:57:42,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23379 states. [2019-12-18 21:57:42,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23379 states to 23379 states and 72980 transitions. [2019-12-18 21:57:42,569 INFO L78 Accepts]: Start accepts. Automaton has 23379 states and 72980 transitions. Word has length 67 [2019-12-18 21:57:42,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:57:42,569 INFO L462 AbstractCegarLoop]: Abstraction has 23379 states and 72980 transitions. [2019-12-18 21:57:42,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:57:42,569 INFO L276 IsEmpty]: Start isEmpty. Operand 23379 states and 72980 transitions. [2019-12-18 21:57:42,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:57:42,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:57:42,593 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:57:42,593 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:57:42,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:57:42,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1730024245, now seen corresponding path program 3 times [2019-12-18 21:57:42,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:57:42,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391180190] [2019-12-18 21:57:42,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:57:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:57:42,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:57:42,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391180190] [2019-12-18 21:57:42,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:57:42,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 21:57:42,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144379862] [2019-12-18 21:57:42,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 21:57:42,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:57:42,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 21:57:42,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:57:42,849 INFO L87 Difference]: Start difference. First operand 23379 states and 72980 transitions. Second operand 12 states. [2019-12-18 21:57:43,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:57:43,988 INFO L93 Difference]: Finished difference Result 40285 states and 125634 transitions. [2019-12-18 21:57:43,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 21:57:43,989 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 21:57:43,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:57:44,048 INFO L225 Difference]: With dead ends: 40285 [2019-12-18 21:57:44,048 INFO L226 Difference]: Without dead ends: 40042 [2019-12-18 21:57:44,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 21:57:44,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40042 states. [2019-12-18 21:57:44,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40042 to 23203. [2019-12-18 21:57:44,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23203 states. [2019-12-18 21:57:44,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23203 states to 23203 states and 72508 transitions. [2019-12-18 21:57:44,543 INFO L78 Accepts]: Start accepts. Automaton has 23203 states and 72508 transitions. Word has length 67 [2019-12-18 21:57:44,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:57:44,543 INFO L462 AbstractCegarLoop]: Abstraction has 23203 states and 72508 transitions. [2019-12-18 21:57:44,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 21:57:44,543 INFO L276 IsEmpty]: Start isEmpty. Operand 23203 states and 72508 transitions. [2019-12-18 21:57:44,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:57:44,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:57:44,569 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:57:44,569 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:57:44,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:57:44,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1929562173, now seen corresponding path program 4 times [2019-12-18 21:57:44,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:57:44,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233847239] [2019-12-18 21:57:44,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:57:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:57:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:57:44,682 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:57:44,682 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:57:44,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$r_buff1_thd0~0_24) (= v_~z$r_buff0_thd3~0_78 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~z$w_buff0_used~0_113 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1564~0.base_21|) (= v_~z$read_delayed_var~0.offset_6 0) (= 0 v_~__unbuffered_p0_EAX~0_15) (= |v_#NULL.offset_7| 0) (= 0 v_~z$w_buff0~0_27) (= 0 v_~z$r_buff1_thd2~0_17) (= 0 v_~z$flush_delayed~0_13) (= v_~z$r_buff0_thd2~0_20 0) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1564~0.base_21| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1564~0.base_21|) |v_ULTIMATE.start_main_~#t1564~0.offset_16| 0))) (= 0 v_~__unbuffered_cnt~0_21) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice2~0_32) (= v_~x~0_10 0) (= 0 v_~z$r_buff1_thd1~0_17) (= v_~z$r_buff0_thd1~0_24 0) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p2_EAX~0_16) (= (select .cse0 |v_ULTIMATE.start_main_~#t1564~0.base_21|) 0) (= 0 v_~z$w_buff1_used~0_72) (= 0 v_~weak$$choice0~0_7) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd0~0_18 0) (= 0 |v_#NULL.base_7|) (= v_~z~0_27 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1564~0.base_21| 4)) (= (store .cse0 |v_ULTIMATE.start_main_~#t1564~0.base_21| 1) |v_#valid_59|) (= 0 v_~z$r_buff1_thd3~0_50) (= 0 v_~z$w_buff1~0_26) (= |v_ULTIMATE.start_main_~#t1564~0.offset_16| 0) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1565~0.base=|v_ULTIMATE.start_main_~#t1565~0.base_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_~#t1564~0.offset=|v_ULTIMATE.start_main_~#t1564~0.offset_16|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ULTIMATE.start_main_~#t1566~0.offset=|v_ULTIMATE.start_main_~#t1566~0.offset_15|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t1566~0.base=|v_ULTIMATE.start_main_~#t1566~0.base_19|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_78, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ULTIMATE.start_main_~#t1565~0.offset=|v_ULTIMATE.start_main_~#t1565~0.offset_13|, ~x~0=v_~x~0_10, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_27, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ULTIMATE.start_main_~#t1564~0.base=|v_ULTIMATE.start_main_~#t1564~0.base_21|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1565~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t1564~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1566~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_~#t1566~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1565~0.offset, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~#t1564~0.base, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:57:44,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1565~0.base_11| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1565~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1565~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1565~0.base_11|) |v_ULTIMATE.start_main_~#t1565~0.offset_9| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1565~0.base_11|)) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1565~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1565~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t1565~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1565~0.base=|v_ULTIMATE.start_main_~#t1565~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1565~0.offset=|v_ULTIMATE.start_main_~#t1565~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1565~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1565~0.offset] because there is no mapped edge [2019-12-18 21:57:44,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_16 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8)) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (= v_~z$r_buff0_thd1~0_17 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd3~0_52 v_~z$r_buff1_thd3~0_33) (= v_~__unbuffered_p0_EAX~0_4 v_~x~0_4) (= v_~z$r_buff0_thd0~0_15 v_~z$r_buff1_thd0~0_10)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_17, ~x~0=v_~x~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_4, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_10, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_16, ~x~0=v_~x~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:57:44,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In2067831718 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In2067831718 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In2067831718 |P1Thread1of1ForFork2_#t~ite9_Out2067831718|) (not .cse1)) (and (= ~z~0_In2067831718 |P1Thread1of1ForFork2_#t~ite9_Out2067831718|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2067831718, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2067831718, ~z$w_buff1~0=~z$w_buff1~0_In2067831718, ~z~0=~z~0_In2067831718} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out2067831718|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2067831718, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2067831718, ~z$w_buff1~0=~z$w_buff1~0_In2067831718, ~z~0=~z~0_In2067831718} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 21:57:44,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-18 21:57:44,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L824-1-->L826: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1566~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1566~0.base_13|) |v_ULTIMATE.start_main_~#t1566~0.offset_11| 2)) |v_#memory_int_11|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1566~0.base_13| 1)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1566~0.base_13|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1566~0.base_13| 4) |v_#length_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1566~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1566~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1566~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1566~0.base=|v_ULTIMATE.start_main_~#t1566~0.base_13|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1566~0.offset=|v_ULTIMATE.start_main_~#t1566~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1566~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1566~0.offset] because there is no mapped edge [2019-12-18 21:57:44,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1352846167 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1352846167 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1352846167|)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out1352846167| ~z$w_buff0_used~0_In1352846167)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1352846167, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1352846167} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1352846167, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1352846167|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1352846167} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 21:57:44,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1414375461 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1414375461 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1414375461 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1414375461 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out1414375461|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In1414375461 |P1Thread1of1ForFork2_#t~ite12_Out1414375461|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1414375461, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1414375461, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1414375461, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1414375461} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1414375461, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1414375461, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1414375461, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1414375461|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1414375461} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 21:57:44,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1223199145 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1223199145 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In1223199145 |P1Thread1of1ForFork2_#t~ite13_Out1223199145|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1223199145|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1223199145, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1223199145} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1223199145, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1223199145|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1223199145} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 21:57:44,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L790-->L790-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2019591483 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out-2019591483| ~z$w_buff0_used~0_In-2019591483) (= |P2Thread1of1ForFork0_#t~ite26_In-2019591483| |P2Thread1of1ForFork0_#t~ite26_Out-2019591483|)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite27_Out-2019591483| |P2Thread1of1ForFork0_#t~ite26_Out-2019591483|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-2019591483 256)))) (or (and (= (mod ~z$w_buff1_used~0_In-2019591483 256) 0) .cse1) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-2019591483 256))) (= (mod ~z$w_buff0_used~0_In-2019591483 256) 0))) (= ~z$w_buff0_used~0_In-2019591483 |P2Thread1of1ForFork0_#t~ite26_Out-2019591483|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-2019591483|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2019591483, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2019591483, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2019591483, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2019591483, ~weak$$choice2~0=~weak$$choice2~0_In-2019591483} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-2019591483|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-2019591483|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2019591483, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2019591483, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2019591483, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2019591483, ~weak$$choice2~0=~weak$$choice2~0_In-2019591483} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 21:57:44,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_63 v_~z$r_buff0_thd3~0_62) (not (= 0 (mod v_~weak$$choice2~0_24 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 21:57:44,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In1306826697 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1306826697 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1306826697 |P0Thread1of1ForFork1_#t~ite5_Out1306826697|)) (and (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out1306826697|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1306826697, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1306826697} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1306826697|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1306826697, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1306826697} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 21:57:44,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_22 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 21:57:44,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite39_Out1136216729| |P2Thread1of1ForFork0_#t~ite38_Out1136216729|)) (.cse2 (= (mod ~z$w_buff1_used~0_In1136216729 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1136216729 256)))) (or (and .cse0 (not .cse1) (= ~z$w_buff1~0_In1136216729 |P2Thread1of1ForFork0_#t~ite38_Out1136216729|) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= ~z~0_In1136216729 |P2Thread1of1ForFork0_#t~ite38_Out1136216729|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1136216729, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1136216729, ~z$w_buff1~0=~z$w_buff1~0_In1136216729, ~z~0=~z~0_In1136216729} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1136216729|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1136216729|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1136216729, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1136216729, ~z$w_buff1~0=~z$w_buff1~0_In1136216729, ~z~0=~z~0_In1136216729} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 21:57:44,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1134865675 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1134865675 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-1134865675| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out-1134865675| ~z$w_buff0_used~0_In-1134865675)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1134865675, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1134865675} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1134865675, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1134865675|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1134865675} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 21:57:44,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In1615715186 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1615715186 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1615715186 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In1615715186 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out1615715186| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite41_Out1615715186| ~z$w_buff1_used~0_In1615715186) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1615715186, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1615715186, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1615715186, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1615715186} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1615715186, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1615715186, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1615715186, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1615715186, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1615715186|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 21:57:44,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2073581262 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In2073581262 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out2073581262| ~z$r_buff0_thd3~0_In2073581262)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out2073581262| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2073581262, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2073581262} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2073581262, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2073581262, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out2073581262|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 21:57:44,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-515256422 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-515256422 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-515256422 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-515256422 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-515256422|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-515256422 |P2Thread1of1ForFork0_#t~ite43_Out-515256422|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-515256422, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-515256422, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-515256422, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-515256422} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-515256422|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-515256422, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-515256422, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-515256422, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-515256422} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 21:57:44,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_44 |v_P2Thread1of1ForFork0_#t~ite43_8|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 21:57:44,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd1~0_In1163727470 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1163727470 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In1163727470 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In1163727470 256)))) (or (and (= ~z$w_buff1_used~0_In1163727470 |P0Thread1of1ForFork1_#t~ite6_Out1163727470|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1163727470|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1163727470, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1163727470, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1163727470, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1163727470} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1163727470, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1163727470|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1163727470, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1163727470, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1163727470} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 21:57:44,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1070375071 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1070375071 256) 0))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out1070375071) (not .cse1)) (and (= ~z$r_buff0_thd1~0_Out1070375071 ~z$r_buff0_thd1~0_In1070375071) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1070375071, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1070375071} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1070375071, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1070375071|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1070375071} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:57:44,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-289043759 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-289043759 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-289043759 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-289043759 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out-289043759| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P0Thread1of1ForFork1_#t~ite8_Out-289043759| ~z$r_buff1_thd1~0_In-289043759)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-289043759, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-289043759, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-289043759, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-289043759} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-289043759|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-289043759, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-289043759, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-289043759, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-289043759} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 21:57:44,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_12 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_12, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 21:57:44,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In674598879 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In674598879 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In674598879 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In674598879 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In674598879 |P1Thread1of1ForFork2_#t~ite14_Out674598879|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out674598879|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In674598879, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In674598879, ~z$w_buff1_used~0=~z$w_buff1_used~0_In674598879, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In674598879} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In674598879, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In674598879, ~z$w_buff1_used~0=~z$w_buff1_used~0_In674598879, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out674598879|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In674598879} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 21:57:44,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L770-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_13) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 21:57:44,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:57:44,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1736926461 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1736926461 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite47_Out-1736926461| |ULTIMATE.start_main_#t~ite48_Out-1736926461|))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-1736926461| ~z~0_In-1736926461) .cse2) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-1736926461| ~z$w_buff1~0_In-1736926461) (not .cse1) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1736926461, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1736926461, ~z$w_buff1~0=~z$w_buff1~0_In-1736926461, ~z~0=~z~0_In-1736926461} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1736926461, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1736926461|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1736926461, ~z$w_buff1~0=~z$w_buff1~0_In-1736926461, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1736926461|, ~z~0=~z~0_In-1736926461} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 21:57:44,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1002913900 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1002913900 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out1002913900|) (not .cse1)) (and (= ~z$w_buff0_used~0_In1002913900 |ULTIMATE.start_main_#t~ite49_Out1002913900|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1002913900, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1002913900} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1002913900, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1002913900, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1002913900|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 21:57:44,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In-1665683591 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1665683591 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1665683591 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1665683591 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-1665683591|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1665683591 |ULTIMATE.start_main_#t~ite50_Out-1665683591|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1665683591, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1665683591, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1665683591, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1665683591} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1665683591|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1665683591, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1665683591, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1665683591, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1665683591} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 21:57:44,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-910163713 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-910163713 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-910163713| 0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-910163713 |ULTIMATE.start_main_#t~ite51_Out-910163713|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-910163713, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-910163713} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-910163713, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-910163713|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-910163713} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 21:57:44,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In306067942 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In306067942 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In306067942 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In306067942 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out306067942|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$r_buff1_thd0~0_In306067942 |ULTIMATE.start_main_#t~ite52_Out306067942|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In306067942, ~z$w_buff0_used~0=~z$w_buff0_used~0_In306067942, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In306067942, ~z$w_buff1_used~0=~z$w_buff1_used~0_In306067942} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out306067942|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In306067942, ~z$w_buff0_used~0=~z$w_buff0_used~0_In306067942, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In306067942, ~z$w_buff1_used~0=~z$w_buff1_used~0_In306067942} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 21:57:44,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p2_EAX~0_10) (= v_~main$tmp_guard1~0_10 0) (= v_~__unbuffered_p0_EAX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite52_15| v_~z$r_buff1_thd0~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= 0 v_~__unbuffered_p1_EAX~0_8) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_10 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:57:44,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:57:44 BasicIcfg [2019-12-18 21:57:44,798 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:57:44,799 INFO L168 Benchmark]: Toolchain (without parser) took 119761.18 ms. Allocated memory was 135.3 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 96.9 MB in the beginning and 1.1 GB in the end (delta: -987.3 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-18 21:57:44,800 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 135.3 MB. Free memory was 117.2 MB in the beginning and 117.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 21:57:44,801 INFO L168 Benchmark]: CACSL2BoogieTranslator took 823.74 ms. Allocated memory was 135.3 MB in the beginning and 199.2 MB in the end (delta: 64.0 MB). Free memory was 96.5 MB in the beginning and 152.4 MB in the end (delta: -55.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:57:44,801 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.77 ms. Allocated memory is still 199.2 MB. Free memory was 152.4 MB in the beginning and 149.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:57:44,801 INFO L168 Benchmark]: Boogie Preprocessor took 39.44 ms. Allocated memory is still 199.2 MB. Free memory was 149.6 MB in the beginning and 147.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:57:44,802 INFO L168 Benchmark]: RCFGBuilder took 817.45 ms. Allocated memory is still 199.2 MB. Free memory was 147.5 MB in the beginning and 96.9 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:57:44,802 INFO L168 Benchmark]: TraceAbstraction took 118006.35 ms. Allocated memory was 199.2 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 96.9 MB in the beginning and 1.1 GB in the end (delta: -987.2 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-18 21:57:44,806 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 135.3 MB. Free memory was 117.2 MB in the beginning and 117.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 823.74 ms. Allocated memory was 135.3 MB in the beginning and 199.2 MB in the end (delta: 64.0 MB). Free memory was 96.5 MB in the beginning and 152.4 MB in the end (delta: -55.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.77 ms. Allocated memory is still 199.2 MB. Free memory was 152.4 MB in the beginning and 149.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.44 ms. Allocated memory is still 199.2 MB. Free memory was 149.6 MB in the beginning and 147.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 817.45 ms. Allocated memory is still 199.2 MB. Free memory was 147.5 MB in the beginning and 96.9 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 118006.35 ms. Allocated memory was 199.2 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 96.9 MB in the beginning and 1.1 GB in the end (delta: -987.2 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 176 ProgramPointsBefore, 96 ProgramPointsAfterwards, 213 TransitionsBefore, 108 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 29 ChoiceCompositions, 6738 VarBasedMoverChecksPositive, 208 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 85326 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1564, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1565, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1566, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 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) VAL [!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)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 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) [L788] 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 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)) [L789] 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 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)) [L790] 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)) [L791] 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 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)) [L793] 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 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)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L835] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 117.6s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 31.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6983 SDtfs, 8233 SDslu, 26270 SDs, 0 SdLazy, 11304 SolverSat, 265 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 44 SyntacticMatches, 13 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161661occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 51.6s AutomataMinimizationTime, 29 MinimizatonAttempts, 335885 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1487 NumberOfCodeBlocks, 1487 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1391 ConstructedInterpolants, 0 QuantifiedInterpolants, 260829 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...