/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/mix016_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:26:37,546 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:26:37,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:26:37,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:26:37,561 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:26:37,562 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:26:37,564 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:26:37,565 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:26:37,567 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:26:37,568 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:26:37,569 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:26:37,571 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:26:37,572 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:26:37,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:26:37,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:26:37,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:26:37,580 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:26:37,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:26:37,582 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:26:37,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:26:37,585 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:26:37,587 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:26:37,588 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:26:37,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:26:37,597 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:26:37,597 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:26:37,597 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:26:37,598 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:26:37,599 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:26:37,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:26:37,602 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:26:37,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:26:37,604 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:26:37,605 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:26:37,606 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:26:37,607 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:26:37,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:26:37,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:26:37,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:26:37,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:26:37,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:26:37,613 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 20:26:37,628 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:26:37,628 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:26:37,629 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:26:37,630 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:26:37,630 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:26:37,630 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:26:37,630 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:26:37,630 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:26:37,631 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:26:37,631 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:26:37,631 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:26:37,631 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:26:37,631 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:26:37,631 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:26:37,632 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:26:37,632 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:26:37,632 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:26:37,632 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:26:37,632 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:26:37,633 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:26:37,633 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:26:37,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:26:37,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:26:37,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:26:37,634 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:26:37,634 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:26:37,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:26:37,634 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:26:37,634 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:26:37,635 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:26:37,950 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:26:37,967 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:26:37,971 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:26:37,973 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:26:37,973 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:26:37,974 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_power.opt.i [2019-12-18 20:26:38,038 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2824e66c0/bfab1008bd2d4d698d4e7746b46c34bb/FLAG3db77605d [2019-12-18 20:26:38,537 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:26:38,538 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_power.opt.i [2019-12-18 20:26:38,561 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2824e66c0/bfab1008bd2d4d698d4e7746b46c34bb/FLAG3db77605d [2019-12-18 20:26:39,055 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2824e66c0/bfab1008bd2d4d698d4e7746b46c34bb [2019-12-18 20:26:39,064 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:26:39,066 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:26:39,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:26:39,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:26:39,071 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:26:39,072 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:26:39" (1/1) ... [2019-12-18 20:26:39,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ed1e37c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:39, skipping insertion in model container [2019-12-18 20:26:39,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:26:39" (1/1) ... [2019-12-18 20:26:39,083 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:26:39,155 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:26:39,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:26:39,719 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:26:39,793 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:26:39,866 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:26:39,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:39 WrapperNode [2019-12-18 20:26:39,867 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:26:39,868 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:26:39,868 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:26:39,868 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:26:39,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:39" (1/1) ... [2019-12-18 20:26:39,897 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:39" (1/1) ... [2019-12-18 20:26:39,929 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:26:39,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:26:39,930 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:26:39,930 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:26:39,939 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:39" (1/1) ... [2019-12-18 20:26:39,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:39" (1/1) ... [2019-12-18 20:26:39,944 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:39" (1/1) ... [2019-12-18 20:26:39,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:39" (1/1) ... [2019-12-18 20:26:39,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:39" (1/1) ... [2019-12-18 20:26:39,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:39" (1/1) ... [2019-12-18 20:26:39,971 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:39" (1/1) ... [2019-12-18 20:26:39,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:26:39,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:26:39,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:26:39,976 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:26:39,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:39" (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 20:26:40,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:26:40,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:26:40,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:26:40,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:26:40,053 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:26:40,053 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:26:40,053 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:26:40,053 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:26:40,054 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:26:40,054 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:26:40,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:26:40,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:26:40,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:26:40,056 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 20:26:40,785 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:26:40,785 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:26:40,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:26:40 BoogieIcfgContainer [2019-12-18 20:26:40,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:26:40,790 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:26:40,790 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:26:40,794 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:26:40,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:26:39" (1/3) ... [2019-12-18 20:26:40,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49db4c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:26:40, skipping insertion in model container [2019-12-18 20:26:40,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:26:39" (2/3) ... [2019-12-18 20:26:40,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49db4c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:26:40, skipping insertion in model container [2019-12-18 20:26:40,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:26:40" (3/3) ... [2019-12-18 20:26:40,799 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_power.opt.i [2019-12-18 20:26:40,810 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:26:40,811 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:26:40,820 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:26:40,821 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:26:40,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,880 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,881 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,929 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,929 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,929 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,930 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,930 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,948 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,948 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,956 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,957 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,957 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,966 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,966 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,971 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,971 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:26:40,993 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 20:26:41,008 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:26:41,008 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:26:41,008 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:26:41,008 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:26:41,009 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:26:41,009 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:26:41,009 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:26:41,009 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:26:41,026 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-18 20:26:41,028 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-18 20:26:41,136 INFO L126 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-18 20:26:41,137 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:26:41,154 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 439 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 20:26:41,179 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-18 20:26:41,230 INFO L126 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-18 20:26:41,230 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:26:41,241 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 439 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 20:26:41,261 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 20:26:41,262 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:26:44,753 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 20:26:44,873 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 20:26:44,966 INFO L206 etLargeBlockEncoding]: Checked pairs total: 79642 [2019-12-18 20:26:44,966 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 20:26:44,970 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 85 places, 94 transitions [2019-12-18 20:26:59,263 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 95102 states. [2019-12-18 20:26:59,265 INFO L276 IsEmpty]: Start isEmpty. Operand 95102 states. [2019-12-18 20:26:59,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 20:26:59,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:26:59,286 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 20:26:59,286 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:26:59,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:26:59,291 INFO L82 PathProgramCache]: Analyzing trace with hash 797531429, now seen corresponding path program 1 times [2019-12-18 20:26:59,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:26:59,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888328329] [2019-12-18 20:26:59,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:26:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:26:59,559 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 20:26:59,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888328329] [2019-12-18 20:26:59,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:26:59,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:26:59,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690350385] [2019-12-18 20:26:59,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:26:59,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:26:59,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:26:59,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:26:59,582 INFO L87 Difference]: Start difference. First operand 95102 states. Second operand 3 states. [2019-12-18 20:27:00,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:00,665 INFO L93 Difference]: Finished difference Result 93264 states and 402387 transitions. [2019-12-18 20:27:00,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:27:00,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 20:27:00,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:03,784 INFO L225 Difference]: With dead ends: 93264 [2019-12-18 20:27:03,784 INFO L226 Difference]: Without dead ends: 87384 [2019-12-18 20:27:03,785 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 20:27:06,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87384 states. [2019-12-18 20:27:08,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87384 to 87384. [2019-12-18 20:27:08,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87384 states. [2019-12-18 20:27:13,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87384 states to 87384 states and 376487 transitions. [2019-12-18 20:27:13,203 INFO L78 Accepts]: Start accepts. Automaton has 87384 states and 376487 transitions. Word has length 5 [2019-12-18 20:27:13,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:13,203 INFO L462 AbstractCegarLoop]: Abstraction has 87384 states and 376487 transitions. [2019-12-18 20:27:13,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:27:13,204 INFO L276 IsEmpty]: Start isEmpty. Operand 87384 states and 376487 transitions. [2019-12-18 20:27:13,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:27:13,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:13,214 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:27:13,214 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:13,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:13,215 INFO L82 PathProgramCache]: Analyzing trace with hash 429489199, now seen corresponding path program 1 times [2019-12-18 20:27:13,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:13,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799387322] [2019-12-18 20:27:13,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:13,309 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 20:27:13,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799387322] [2019-12-18 20:27:13,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:13,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:27:13,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267922279] [2019-12-18 20:27:13,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:27:13,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:13,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:27:13,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:27:13,313 INFO L87 Difference]: Start difference. First operand 87384 states and 376487 transitions. Second operand 3 states. [2019-12-18 20:27:13,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:13,515 INFO L93 Difference]: Finished difference Result 22591 states and 78202 transitions. [2019-12-18 20:27:13,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:27:13,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 20:27:13,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:13,579 INFO L225 Difference]: With dead ends: 22591 [2019-12-18 20:27:13,580 INFO L226 Difference]: Without dead ends: 22591 [2019-12-18 20:27:13,581 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 20:27:13,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22591 states. [2019-12-18 20:27:14,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22591 to 22591. [2019-12-18 20:27:14,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22591 states. [2019-12-18 20:27:14,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22591 states to 22591 states and 78202 transitions. [2019-12-18 20:27:14,243 INFO L78 Accepts]: Start accepts. Automaton has 22591 states and 78202 transitions. Word has length 13 [2019-12-18 20:27:14,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:14,244 INFO L462 AbstractCegarLoop]: Abstraction has 22591 states and 78202 transitions. [2019-12-18 20:27:14,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:27:14,244 INFO L276 IsEmpty]: Start isEmpty. Operand 22591 states and 78202 transitions. [2019-12-18 20:27:14,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:27:14,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:14,248 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:27:14,248 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:14,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:14,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1420519725, now seen corresponding path program 1 times [2019-12-18 20:27:14,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:14,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349471120] [2019-12-18 20:27:14,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:14,384 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 20:27:14,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349471120] [2019-12-18 20:27:14,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:14,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:27:14,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536172715] [2019-12-18 20:27:14,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:27:14,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:14,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:27:14,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:27:14,387 INFO L87 Difference]: Start difference. First operand 22591 states and 78202 transitions. Second operand 4 states. [2019-12-18 20:27:14,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:14,753 INFO L93 Difference]: Finished difference Result 33180 states and 110963 transitions. [2019-12-18 20:27:14,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:27:14,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 20:27:14,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:15,317 INFO L225 Difference]: With dead ends: 33180 [2019-12-18 20:27:15,318 INFO L226 Difference]: Without dead ends: 33166 [2019-12-18 20:27:15,318 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 20:27:15,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33166 states. [2019-12-18 20:27:16,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33166 to 29831. [2019-12-18 20:27:16,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29831 states. [2019-12-18 20:27:16,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29831 states to 29831 states and 100864 transitions. [2019-12-18 20:27:16,167 INFO L78 Accepts]: Start accepts. Automaton has 29831 states and 100864 transitions. Word has length 13 [2019-12-18 20:27:16,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:16,167 INFO L462 AbstractCegarLoop]: Abstraction has 29831 states and 100864 transitions. [2019-12-18 20:27:16,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:27:16,167 INFO L276 IsEmpty]: Start isEmpty. Operand 29831 states and 100864 transitions. [2019-12-18 20:27:16,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 20:27:16,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:16,169 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:27:16,170 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:16,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:16,170 INFO L82 PathProgramCache]: Analyzing trace with hash 839242224, now seen corresponding path program 1 times [2019-12-18 20:27:16,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:16,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739665311] [2019-12-18 20:27:16,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:16,238 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 20:27:16,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739665311] [2019-12-18 20:27:16,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:16,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:27:16,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852484845] [2019-12-18 20:27:16,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:27:16,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:16,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:27:16,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:27:16,241 INFO L87 Difference]: Start difference. First operand 29831 states and 100864 transitions. Second operand 5 states. [2019-12-18 20:27:17,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:17,032 INFO L93 Difference]: Finished difference Result 42454 states and 141193 transitions. [2019-12-18 20:27:17,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:27:17,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 20:27:17,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:17,130 INFO L225 Difference]: With dead ends: 42454 [2019-12-18 20:27:17,130 INFO L226 Difference]: Without dead ends: 42438 [2019-12-18 20:27:17,131 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 20:27:17,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42438 states. [2019-12-18 20:27:18,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42438 to 34354. [2019-12-18 20:27:18,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34354 states. [2019-12-18 20:27:18,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34354 states to 34354 states and 115309 transitions. [2019-12-18 20:27:18,261 INFO L78 Accepts]: Start accepts. Automaton has 34354 states and 115309 transitions. Word has length 14 [2019-12-18 20:27:18,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:18,262 INFO L462 AbstractCegarLoop]: Abstraction has 34354 states and 115309 transitions. [2019-12-18 20:27:18,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:27:18,262 INFO L276 IsEmpty]: Start isEmpty. Operand 34354 states and 115309 transitions. [2019-12-18 20:27:18,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:27:18,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:18,275 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 20:27:18,275 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:18,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:18,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1523113448, now seen corresponding path program 1 times [2019-12-18 20:27:18,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:18,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934872855] [2019-12-18 20:27:18,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:18,391 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 20:27:18,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934872855] [2019-12-18 20:27:18,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:18,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:27:18,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945744205] [2019-12-18 20:27:18,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:27:18,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:18,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:27:18,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:27:18,394 INFO L87 Difference]: Start difference. First operand 34354 states and 115309 transitions. Second operand 6 states. [2019-12-18 20:27:19,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:19,717 INFO L93 Difference]: Finished difference Result 51152 states and 167895 transitions. [2019-12-18 20:27:19,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:27:19,717 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 20:27:19,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:19,803 INFO L225 Difference]: With dead ends: 51152 [2019-12-18 20:27:19,803 INFO L226 Difference]: Without dead ends: 51124 [2019-12-18 20:27:19,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:27:19,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51124 states. [2019-12-18 20:27:20,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51124 to 34880. [2019-12-18 20:27:20,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34880 states. [2019-12-18 20:27:21,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34880 states to 34880 states and 116186 transitions. [2019-12-18 20:27:21,285 INFO L78 Accepts]: Start accepts. Automaton has 34880 states and 116186 transitions. Word has length 22 [2019-12-18 20:27:21,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:21,287 INFO L462 AbstractCegarLoop]: Abstraction has 34880 states and 116186 transitions. [2019-12-18 20:27:21,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:27:21,287 INFO L276 IsEmpty]: Start isEmpty. Operand 34880 states and 116186 transitions. [2019-12-18 20:27:21,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 20:27:21,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:21,308 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 20:27:21,308 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:21,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:21,308 INFO L82 PathProgramCache]: Analyzing trace with hash 142007166, now seen corresponding path program 1 times [2019-12-18 20:27:21,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:21,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812916937] [2019-12-18 20:27:21,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:21,358 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 20:27:21,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812916937] [2019-12-18 20:27:21,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:21,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:27:21,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840911053] [2019-12-18 20:27:21,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:27:21,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:21,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:27:21,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:27:21,360 INFO L87 Difference]: Start difference. First operand 34880 states and 116186 transitions. Second operand 4 states. [2019-12-18 20:27:21,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:21,423 INFO L93 Difference]: Finished difference Result 13858 states and 42891 transitions. [2019-12-18 20:27:21,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:27:21,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 20:27:21,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:21,442 INFO L225 Difference]: With dead ends: 13858 [2019-12-18 20:27:21,442 INFO L226 Difference]: Without dead ends: 13858 [2019-12-18 20:27:21,443 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 20:27:21,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13858 states. [2019-12-18 20:27:21,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13858 to 13658. [2019-12-18 20:27:21,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13658 states. [2019-12-18 20:27:21,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13658 states to 13658 states and 42311 transitions. [2019-12-18 20:27:21,637 INFO L78 Accepts]: Start accepts. Automaton has 13658 states and 42311 transitions. Word has length 25 [2019-12-18 20:27:21,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:21,637 INFO L462 AbstractCegarLoop]: Abstraction has 13658 states and 42311 transitions. [2019-12-18 20:27:21,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:27:21,637 INFO L276 IsEmpty]: Start isEmpty. Operand 13658 states and 42311 transitions. [2019-12-18 20:27:21,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 20:27:21,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:21,662 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 20:27:21,662 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:21,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:21,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1724321301, now seen corresponding path program 1 times [2019-12-18 20:27:21,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:21,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021453495] [2019-12-18 20:27:21,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:21,779 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 20:27:21,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021453495] [2019-12-18 20:27:21,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:21,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:27:21,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612865829] [2019-12-18 20:27:21,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:27:21,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:21,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:27:21,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:27:21,782 INFO L87 Difference]: Start difference. First operand 13658 states and 42311 transitions. Second operand 3 states. [2019-12-18 20:27:21,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:21,845 INFO L93 Difference]: Finished difference Result 13073 states and 39994 transitions. [2019-12-18 20:27:21,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:27:21,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 20:27:21,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:21,868 INFO L225 Difference]: With dead ends: 13073 [2019-12-18 20:27:21,868 INFO L226 Difference]: Without dead ends: 13073 [2019-12-18 20:27:21,869 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 20:27:21,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13073 states. [2019-12-18 20:27:22,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13073 to 13057. [2019-12-18 20:27:22,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13057 states. [2019-12-18 20:27:22,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13057 states to 13057 states and 39954 transitions. [2019-12-18 20:27:22,071 INFO L78 Accepts]: Start accepts. Automaton has 13057 states and 39954 transitions. Word has length 39 [2019-12-18 20:27:22,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:22,071 INFO L462 AbstractCegarLoop]: Abstraction has 13057 states and 39954 transitions. [2019-12-18 20:27:22,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:27:22,072 INFO L276 IsEmpty]: Start isEmpty. Operand 13057 states and 39954 transitions. [2019-12-18 20:27:22,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:27:22,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:22,088 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] [2019-12-18 20:27:22,089 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:22,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:22,089 INFO L82 PathProgramCache]: Analyzing trace with hash 32452997, now seen corresponding path program 1 times [2019-12-18 20:27:22,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:22,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897961675] [2019-12-18 20:27:22,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:22,163 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 20:27:22,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897961675] [2019-12-18 20:27:22,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:22,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:27:22,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393996922] [2019-12-18 20:27:22,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:27:22,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:22,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:27:22,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:27:22,165 INFO L87 Difference]: Start difference. First operand 13057 states and 39954 transitions. Second operand 5 states. [2019-12-18 20:27:22,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:22,236 INFO L93 Difference]: Finished difference Result 11813 states and 36768 transitions. [2019-12-18 20:27:22,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:27:22,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 20:27:22,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:22,254 INFO L225 Difference]: With dead ends: 11813 [2019-12-18 20:27:22,254 INFO L226 Difference]: Without dead ends: 11813 [2019-12-18 20:27:22,255 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 20:27:22,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11813 states. [2019-12-18 20:27:22,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11813 to 11328. [2019-12-18 20:27:22,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11328 states. [2019-12-18 20:27:22,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11328 states to 11328 states and 35412 transitions. [2019-12-18 20:27:22,418 INFO L78 Accepts]: Start accepts. Automaton has 11328 states and 35412 transitions. Word has length 40 [2019-12-18 20:27:22,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:22,418 INFO L462 AbstractCegarLoop]: Abstraction has 11328 states and 35412 transitions. [2019-12-18 20:27:22,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:27:22,419 INFO L276 IsEmpty]: Start isEmpty. Operand 11328 states and 35412 transitions. [2019-12-18 20:27:22,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:27:22,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:22,698 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] [2019-12-18 20:27:22,698 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:22,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:22,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1496416331, now seen corresponding path program 1 times [2019-12-18 20:27:22,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:22,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282019000] [2019-12-18 20:27:22,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:22,771 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 20:27:22,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282019000] [2019-12-18 20:27:22,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:22,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:27:22,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566985155] [2019-12-18 20:27:22,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:27:22,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:22,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:27:22,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:27:22,774 INFO L87 Difference]: Start difference. First operand 11328 states and 35412 transitions. Second operand 3 states. [2019-12-18 20:27:22,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:22,893 INFO L93 Difference]: Finished difference Result 15447 states and 47327 transitions. [2019-12-18 20:27:22,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:27:22,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 20:27:22,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:22,926 INFO L225 Difference]: With dead ends: 15447 [2019-12-18 20:27:22,927 INFO L226 Difference]: Without dead ends: 15447 [2019-12-18 20:27:22,927 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 20:27:23,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15447 states. [2019-12-18 20:27:23,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15447 to 12870. [2019-12-18 20:27:23,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12870 states. [2019-12-18 20:27:23,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12870 states to 12870 states and 39991 transitions. [2019-12-18 20:27:23,222 INFO L78 Accepts]: Start accepts. Automaton has 12870 states and 39991 transitions. Word has length 55 [2019-12-18 20:27:23,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:23,223 INFO L462 AbstractCegarLoop]: Abstraction has 12870 states and 39991 transitions. [2019-12-18 20:27:23,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:27:23,223 INFO L276 IsEmpty]: Start isEmpty. Operand 12870 states and 39991 transitions. [2019-12-18 20:27:23,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:27:23,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:23,244 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] [2019-12-18 20:27:23,244 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:23,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:23,245 INFO L82 PathProgramCache]: Analyzing trace with hash 460816343, now seen corresponding path program 1 times [2019-12-18 20:27:23,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:23,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969660583] [2019-12-18 20:27:23,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:23,316 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 20:27:23,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969660583] [2019-12-18 20:27:23,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:23,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:27:23,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21080841] [2019-12-18 20:27:23,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:27:23,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:23,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:27:23,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:27:23,319 INFO L87 Difference]: Start difference. First operand 12870 states and 39991 transitions. Second operand 4 states. [2019-12-18 20:27:23,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:23,409 INFO L93 Difference]: Finished difference Result 23213 states and 72057 transitions. [2019-12-18 20:27:23,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:27:23,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-18 20:27:23,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:23,424 INFO L225 Difference]: With dead ends: 23213 [2019-12-18 20:27:23,425 INFO L226 Difference]: Without dead ends: 10663 [2019-12-18 20:27:23,425 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 20:27:23,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10663 states. [2019-12-18 20:27:23,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10663 to 10663. [2019-12-18 20:27:23,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10663 states. [2019-12-18 20:27:23,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10663 states to 10663 states and 32939 transitions. [2019-12-18 20:27:23,589 INFO L78 Accepts]: Start accepts. Automaton has 10663 states and 32939 transitions. Word has length 55 [2019-12-18 20:27:23,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:23,590 INFO L462 AbstractCegarLoop]: Abstraction has 10663 states and 32939 transitions. [2019-12-18 20:27:23,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:27:23,590 INFO L276 IsEmpty]: Start isEmpty. Operand 10663 states and 32939 transitions. [2019-12-18 20:27:23,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:27:23,603 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:23,603 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] [2019-12-18 20:27:23,603 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:23,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:23,604 INFO L82 PathProgramCache]: Analyzing trace with hash 809241269, now seen corresponding path program 2 times [2019-12-18 20:27:23,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:23,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960254194] [2019-12-18 20:27:23,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:23,699 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 20:27:23,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960254194] [2019-12-18 20:27:23,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:23,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:27:23,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295666433] [2019-12-18 20:27:23,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:27:23,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:23,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:27:23,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:27:23,702 INFO L87 Difference]: Start difference. First operand 10663 states and 32939 transitions. Second operand 7 states. [2019-12-18 20:27:24,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:24,151 INFO L93 Difference]: Finished difference Result 30375 states and 92342 transitions. [2019-12-18 20:27:24,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:27:24,152 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-18 20:27:24,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:24,199 INFO L225 Difference]: With dead ends: 30375 [2019-12-18 20:27:24,199 INFO L226 Difference]: Without dead ends: 21467 [2019-12-18 20:27:24,200 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 20:27:24,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21467 states. [2019-12-18 20:27:24,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21467 to 12991. [2019-12-18 20:27:24,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12991 states. [2019-12-18 20:27:24,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12991 states to 12991 states and 39995 transitions. [2019-12-18 20:27:24,708 INFO L78 Accepts]: Start accepts. Automaton has 12991 states and 39995 transitions. Word has length 55 [2019-12-18 20:27:24,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:24,708 INFO L462 AbstractCegarLoop]: Abstraction has 12991 states and 39995 transitions. [2019-12-18 20:27:24,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:27:24,708 INFO L276 IsEmpty]: Start isEmpty. Operand 12991 states and 39995 transitions. [2019-12-18 20:27:24,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:27:24,724 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:24,724 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] [2019-12-18 20:27:24,724 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:24,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:24,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1445433601, now seen corresponding path program 3 times [2019-12-18 20:27:24,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:24,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283858081] [2019-12-18 20:27:24,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:24,880 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 20:27:24,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283858081] [2019-12-18 20:27:24,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:24,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:27:24,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196290987] [2019-12-18 20:27:24,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:27:24,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:24,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:27:24,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:27:24,882 INFO L87 Difference]: Start difference. First operand 12991 states and 39995 transitions. Second operand 8 states. [2019-12-18 20:27:26,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:26,086 INFO L93 Difference]: Finished difference Result 24892 states and 76263 transitions. [2019-12-18 20:27:26,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 20:27:26,086 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-18 20:27:26,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:26,113 INFO L225 Difference]: With dead ends: 24892 [2019-12-18 20:27:26,113 INFO L226 Difference]: Without dead ends: 19970 [2019-12-18 20:27:26,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-12-18 20:27:26,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19970 states. [2019-12-18 20:27:26,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19970 to 13557. [2019-12-18 20:27:26,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13557 states. [2019-12-18 20:27:26,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13557 states to 13557 states and 41466 transitions. [2019-12-18 20:27:26,356 INFO L78 Accepts]: Start accepts. Automaton has 13557 states and 41466 transitions. Word has length 55 [2019-12-18 20:27:26,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:26,357 INFO L462 AbstractCegarLoop]: Abstraction has 13557 states and 41466 transitions. [2019-12-18 20:27:26,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:27:26,357 INFO L276 IsEmpty]: Start isEmpty. Operand 13557 states and 41466 transitions. [2019-12-18 20:27:26,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:27:26,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:26,372 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] [2019-12-18 20:27:26,372 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:26,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:26,373 INFO L82 PathProgramCache]: Analyzing trace with hash -473354833, now seen corresponding path program 4 times [2019-12-18 20:27:26,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:26,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182689855] [2019-12-18 20:27:26,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:26,498 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 20:27:26,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182689855] [2019-12-18 20:27:26,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:26,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:27:26,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236276983] [2019-12-18 20:27:26,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:27:26,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:26,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:27:26,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:27:26,500 INFO L87 Difference]: Start difference. First operand 13557 states and 41466 transitions. Second operand 9 states. [2019-12-18 20:27:27,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:27,639 INFO L93 Difference]: Finished difference Result 22288 states and 67917 transitions. [2019-12-18 20:27:27,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 20:27:27,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-18 20:27:27,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:27,668 INFO L225 Difference]: With dead ends: 22288 [2019-12-18 20:27:27,668 INFO L226 Difference]: Without dead ends: 19666 [2019-12-18 20:27:27,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 20:27:27,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19666 states. [2019-12-18 20:27:28,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19666 to 13405. [2019-12-18 20:27:28,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13405 states. [2019-12-18 20:27:28,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13405 states to 13405 states and 40970 transitions. [2019-12-18 20:27:28,028 INFO L78 Accepts]: Start accepts. Automaton has 13405 states and 40970 transitions. Word has length 55 [2019-12-18 20:27:28,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:28,028 INFO L462 AbstractCegarLoop]: Abstraction has 13405 states and 40970 transitions. [2019-12-18 20:27:28,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:27:28,029 INFO L276 IsEmpty]: Start isEmpty. Operand 13405 states and 40970 transitions. [2019-12-18 20:27:28,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:27:28,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:28,048 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] [2019-12-18 20:27:28,049 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:28,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:28,049 INFO L82 PathProgramCache]: Analyzing trace with hash -301087463, now seen corresponding path program 5 times [2019-12-18 20:27:28,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:28,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245922980] [2019-12-18 20:27:28,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:28,216 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 20:27:28,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245922980] [2019-12-18 20:27:28,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:28,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 20:27:28,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755450758] [2019-12-18 20:27:28,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:27:28,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:28,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:27:28,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:27:28,218 INFO L87 Difference]: Start difference. First operand 13405 states and 40970 transitions. Second operand 10 states. [2019-12-18 20:27:30,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:30,821 INFO L93 Difference]: Finished difference Result 26895 states and 79731 transitions. [2019-12-18 20:27:30,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 20:27:30,822 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-18 20:27:30,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:30,864 INFO L225 Difference]: With dead ends: 26895 [2019-12-18 20:27:30,864 INFO L226 Difference]: Without dead ends: 26679 [2019-12-18 20:27:30,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2019-12-18 20:27:30,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26679 states. [2019-12-18 20:27:31,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26679 to 18138. [2019-12-18 20:27:31,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18138 states. [2019-12-18 20:27:31,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18138 states to 18138 states and 54902 transitions. [2019-12-18 20:27:31,384 INFO L78 Accepts]: Start accepts. Automaton has 18138 states and 54902 transitions. Word has length 55 [2019-12-18 20:27:31,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:31,384 INFO L462 AbstractCegarLoop]: Abstraction has 18138 states and 54902 transitions. [2019-12-18 20:27:31,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:27:31,384 INFO L276 IsEmpty]: Start isEmpty. Operand 18138 states and 54902 transitions. [2019-12-18 20:27:31,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:27:31,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:31,412 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] [2019-12-18 20:27:31,412 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:31,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:31,413 INFO L82 PathProgramCache]: Analyzing trace with hash -559913207, now seen corresponding path program 6 times [2019-12-18 20:27:31,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:31,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064012321] [2019-12-18 20:27:31,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:31,508 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 20:27:31,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064012321] [2019-12-18 20:27:31,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:31,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:27:31,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38497745] [2019-12-18 20:27:31,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:27:31,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:31,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:27:31,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:27:31,510 INFO L87 Difference]: Start difference. First operand 18138 states and 54902 transitions. Second operand 7 states. [2019-12-18 20:27:32,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:32,611 INFO L93 Difference]: Finished difference Result 28240 states and 83318 transitions. [2019-12-18 20:27:32,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 20:27:32,611 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-18 20:27:32,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:32,648 INFO L225 Difference]: With dead ends: 28240 [2019-12-18 20:27:32,649 INFO L226 Difference]: Without dead ends: 28142 [2019-12-18 20:27:32,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-18 20:27:32,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28142 states. [2019-12-18 20:27:32,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28142 to 19313. [2019-12-18 20:27:32,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19313 states. [2019-12-18 20:27:33,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19313 states to 19313 states and 58293 transitions. [2019-12-18 20:27:33,002 INFO L78 Accepts]: Start accepts. Automaton has 19313 states and 58293 transitions. Word has length 55 [2019-12-18 20:27:33,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:33,002 INFO L462 AbstractCegarLoop]: Abstraction has 19313 states and 58293 transitions. [2019-12-18 20:27:33,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:27:33,002 INFO L276 IsEmpty]: Start isEmpty. Operand 19313 states and 58293 transitions. [2019-12-18 20:27:33,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:27:33,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:33,022 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] [2019-12-18 20:27:33,022 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:33,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:33,022 INFO L82 PathProgramCache]: Analyzing trace with hash -586394009, now seen corresponding path program 7 times [2019-12-18 20:27:33,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:33,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927763752] [2019-12-18 20:27:33,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:33,260 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 20:27:33,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927763752] [2019-12-18 20:27:33,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:33,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 20:27:33,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925330167] [2019-12-18 20:27:33,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:27:33,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:33,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:27:33,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:27:33,264 INFO L87 Difference]: Start difference. First operand 19313 states and 58293 transitions. Second operand 11 states. [2019-12-18 20:27:35,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:35,642 INFO L93 Difference]: Finished difference Result 31732 states and 93421 transitions. [2019-12-18 20:27:35,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 20:27:35,643 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 20:27:35,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:35,684 INFO L225 Difference]: With dead ends: 31732 [2019-12-18 20:27:35,684 INFO L226 Difference]: Without dead ends: 31732 [2019-12-18 20:27:35,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2019-12-18 20:27:35,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31732 states. [2019-12-18 20:27:36,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31732 to 19829. [2019-12-18 20:27:36,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19829 states. [2019-12-18 20:27:36,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19829 states to 19829 states and 59829 transitions. [2019-12-18 20:27:36,047 INFO L78 Accepts]: Start accepts. Automaton has 19829 states and 59829 transitions. Word has length 55 [2019-12-18 20:27:36,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:36,047 INFO L462 AbstractCegarLoop]: Abstraction has 19829 states and 59829 transitions. [2019-12-18 20:27:36,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:27:36,047 INFO L276 IsEmpty]: Start isEmpty. Operand 19829 states and 59829 transitions. [2019-12-18 20:27:36,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:27:36,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:36,068 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] [2019-12-18 20:27:36,068 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:36,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:36,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1810872584, now seen corresponding path program 1 times [2019-12-18 20:27:36,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:36,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044975437] [2019-12-18 20:27:36,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:36,114 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 20:27:36,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044975437] [2019-12-18 20:27:36,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:36,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:27:36,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216665930] [2019-12-18 20:27:36,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:27:36,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:36,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:27:36,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:27:36,116 INFO L87 Difference]: Start difference. First operand 19829 states and 59829 transitions. Second operand 3 states. [2019-12-18 20:27:36,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:36,238 INFO L93 Difference]: Finished difference Result 21463 states and 62557 transitions. [2019-12-18 20:27:36,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:27:36,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 20:27:36,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:36,283 INFO L225 Difference]: With dead ends: 21463 [2019-12-18 20:27:36,283 INFO L226 Difference]: Without dead ends: 21463 [2019-12-18 20:27:36,284 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 20:27:36,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21463 states. [2019-12-18 20:27:36,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21463 to 19589. [2019-12-18 20:27:36,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19589 states. [2019-12-18 20:27:36,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19589 states to 19589 states and 57204 transitions. [2019-12-18 20:27:36,689 INFO L78 Accepts]: Start accepts. Automaton has 19589 states and 57204 transitions. Word has length 55 [2019-12-18 20:27:36,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:36,690 INFO L462 AbstractCegarLoop]: Abstraction has 19589 states and 57204 transitions. [2019-12-18 20:27:36,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:27:36,690 INFO L276 IsEmpty]: Start isEmpty. Operand 19589 states and 57204 transitions. [2019-12-18 20:27:36,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:27:36,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:36,709 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] [2019-12-18 20:27:36,709 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:36,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:36,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1209922647, now seen corresponding path program 8 times [2019-12-18 20:27:36,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:36,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531144121] [2019-12-18 20:27:36,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:36,850 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 20:27:36,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531144121] [2019-12-18 20:27:36,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:36,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 20:27:36,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243473071] [2019-12-18 20:27:36,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:27:36,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:36,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:27:36,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:27:36,854 INFO L87 Difference]: Start difference. First operand 19589 states and 57204 transitions. Second operand 10 states. [2019-12-18 20:27:39,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:39,707 INFO L93 Difference]: Finished difference Result 31835 states and 90934 transitions. [2019-12-18 20:27:39,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-18 20:27:39,708 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-18 20:27:39,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:39,755 INFO L225 Difference]: With dead ends: 31835 [2019-12-18 20:27:39,755 INFO L226 Difference]: Without dead ends: 31835 [2019-12-18 20:27:39,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=1107, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 20:27:39,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31835 states. [2019-12-18 20:27:40,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31835 to 17661. [2019-12-18 20:27:40,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17661 states. [2019-12-18 20:27:40,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17661 states to 17661 states and 51807 transitions. [2019-12-18 20:27:40,085 INFO L78 Accepts]: Start accepts. Automaton has 17661 states and 51807 transitions. Word has length 55 [2019-12-18 20:27:40,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:40,085 INFO L462 AbstractCegarLoop]: Abstraction has 17661 states and 51807 transitions. [2019-12-18 20:27:40,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:27:40,086 INFO L276 IsEmpty]: Start isEmpty. Operand 17661 states and 51807 transitions. [2019-12-18 20:27:40,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:27:40,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:40,102 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] [2019-12-18 20:27:40,103 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:40,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:40,103 INFO L82 PathProgramCache]: Analyzing trace with hash -453565697, now seen corresponding path program 9 times [2019-12-18 20:27:40,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:40,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928053629] [2019-12-18 20:27:40,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:40,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:40,282 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 20:27:40,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928053629] [2019-12-18 20:27:40,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:40,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 20:27:40,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738980541] [2019-12-18 20:27:40,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 20:27:40,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:40,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 20:27:40,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-18 20:27:40,284 INFO L87 Difference]: Start difference. First operand 17661 states and 51807 transitions. Second operand 12 states. [2019-12-18 20:27:42,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:42,288 INFO L93 Difference]: Finished difference Result 23748 states and 69787 transitions. [2019-12-18 20:27:42,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 20:27:42,288 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-18 20:27:42,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:42,317 INFO L225 Difference]: With dead ends: 23748 [2019-12-18 20:27:42,317 INFO L226 Difference]: Without dead ends: 22680 [2019-12-18 20:27:42,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2019-12-18 20:27:42,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22680 states. [2019-12-18 20:27:42,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22680 to 18909. [2019-12-18 20:27:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18909 states. [2019-12-18 20:27:42,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18909 states to 18909 states and 55278 transitions. [2019-12-18 20:27:42,608 INFO L78 Accepts]: Start accepts. Automaton has 18909 states and 55278 transitions. Word has length 55 [2019-12-18 20:27:42,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:42,608 INFO L462 AbstractCegarLoop]: Abstraction has 18909 states and 55278 transitions. [2019-12-18 20:27:42,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 20:27:42,609 INFO L276 IsEmpty]: Start isEmpty. Operand 18909 states and 55278 transitions. [2019-12-18 20:27:42,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:27:42,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:42,636 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] [2019-12-18 20:27:42,636 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:42,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:42,637 INFO L82 PathProgramCache]: Analyzing trace with hash 171636295, now seen corresponding path program 10 times [2019-12-18 20:27:42,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:42,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294688224] [2019-12-18 20:27:42,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:42,821 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 20:27:42,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294688224] [2019-12-18 20:27:42,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:42,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 20:27:42,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30438622] [2019-12-18 20:27:42,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 20:27:42,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:42,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 20:27:42,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 20:27:42,825 INFO L87 Difference]: Start difference. First operand 18909 states and 55278 transitions. Second operand 12 states. [2019-12-18 20:27:44,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:44,517 INFO L93 Difference]: Finished difference Result 25332 states and 73801 transitions. [2019-12-18 20:27:44,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 20:27:44,518 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-18 20:27:44,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:44,550 INFO L225 Difference]: With dead ends: 25332 [2019-12-18 20:27:44,550 INFO L226 Difference]: Without dead ends: 22608 [2019-12-18 20:27:44,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2019-12-18 20:27:44,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22608 states. [2019-12-18 20:27:44,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22608 to 17993. [2019-12-18 20:27:44,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17993 states. [2019-12-18 20:27:44,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17993 states to 17993 states and 52639 transitions. [2019-12-18 20:27:44,857 INFO L78 Accepts]: Start accepts. Automaton has 17993 states and 52639 transitions. Word has length 55 [2019-12-18 20:27:44,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:44,858 INFO L462 AbstractCegarLoop]: Abstraction has 17993 states and 52639 transitions. [2019-12-18 20:27:44,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 20:27:44,858 INFO L276 IsEmpty]: Start isEmpty. Operand 17993 states and 52639 transitions. [2019-12-18 20:27:44,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:27:44,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:44,876 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] [2019-12-18 20:27:44,876 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:44,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:44,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1856740831, now seen corresponding path program 11 times [2019-12-18 20:27:44,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:44,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791453426] [2019-12-18 20:27:44,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:45,508 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 20:27:45,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791453426] [2019-12-18 20:27:45,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:45,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 20:27:45,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140985962] [2019-12-18 20:27:45,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 20:27:45,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:45,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 20:27:45,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-12-18 20:27:45,512 INFO L87 Difference]: Start difference. First operand 17993 states and 52639 transitions. Second operand 15 states. [2019-12-18 20:27:49,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:49,927 INFO L93 Difference]: Finished difference Result 30699 states and 87701 transitions. [2019-12-18 20:27:49,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-18 20:27:49,927 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-18 20:27:49,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:49,964 INFO L225 Difference]: With dead ends: 30699 [2019-12-18 20:27:49,964 INFO L226 Difference]: Without dead ends: 26775 [2019-12-18 20:27:49,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=341, Invalid=1915, Unknown=0, NotChecked=0, Total=2256 [2019-12-18 20:27:50,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26775 states. [2019-12-18 20:27:50,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26775 to 18521. [2019-12-18 20:27:50,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18521 states. [2019-12-18 20:27:50,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18521 states to 18521 states and 53888 transitions. [2019-12-18 20:27:50,291 INFO L78 Accepts]: Start accepts. Automaton has 18521 states and 53888 transitions. Word has length 55 [2019-12-18 20:27:50,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:50,291 INFO L462 AbstractCegarLoop]: Abstraction has 18521 states and 53888 transitions. [2019-12-18 20:27:50,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 20:27:50,291 INFO L276 IsEmpty]: Start isEmpty. Operand 18521 states and 53888 transitions. [2019-12-18 20:27:50,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:27:50,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:50,309 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] [2019-12-18 20:27:50,310 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:50,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:50,310 INFO L82 PathProgramCache]: Analyzing trace with hash 8245863, now seen corresponding path program 12 times [2019-12-18 20:27:50,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:50,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495206651] [2019-12-18 20:27:50,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:50,458 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 20:27:50,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495206651] [2019-12-18 20:27:50,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:50,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 20:27:50,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149459360] [2019-12-18 20:27:50,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 20:27:50,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:50,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 20:27:50,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 20:27:50,460 INFO L87 Difference]: Start difference. First operand 18521 states and 53888 transitions. Second operand 12 states. [2019-12-18 20:27:52,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:52,257 INFO L93 Difference]: Finished difference Result 24940 states and 72001 transitions. [2019-12-18 20:27:52,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 20:27:52,258 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-18 20:27:52,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:52,289 INFO L225 Difference]: With dead ends: 24940 [2019-12-18 20:27:52,289 INFO L226 Difference]: Without dead ends: 23569 [2019-12-18 20:27:52,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2019-12-18 20:27:52,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23569 states. [2019-12-18 20:27:52,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23569 to 18311. [2019-12-18 20:27:52,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18311 states. [2019-12-18 20:27:52,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18311 states to 18311 states and 53341 transitions. [2019-12-18 20:27:52,595 INFO L78 Accepts]: Start accepts. Automaton has 18311 states and 53341 transitions. Word has length 55 [2019-12-18 20:27:52,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:52,595 INFO L462 AbstractCegarLoop]: Abstraction has 18311 states and 53341 transitions. [2019-12-18 20:27:52,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 20:27:52,595 INFO L276 IsEmpty]: Start isEmpty. Operand 18311 states and 53341 transitions. [2019-12-18 20:27:52,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:27:52,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:52,614 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] [2019-12-18 20:27:52,614 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:52,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:52,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1821859409, now seen corresponding path program 13 times [2019-12-18 20:27:52,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:52,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360554425] [2019-12-18 20:27:52,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:52,675 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 20:27:52,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360554425] [2019-12-18 20:27:52,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:52,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:27:52,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567966339] [2019-12-18 20:27:52,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:27:52,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:52,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:27:52,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:27:52,677 INFO L87 Difference]: Start difference. First operand 18311 states and 53341 transitions. Second operand 3 states. [2019-12-18 20:27:52,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:52,752 INFO L93 Difference]: Finished difference Result 18311 states and 53339 transitions. [2019-12-18 20:27:52,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:27:52,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 20:27:52,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:52,785 INFO L225 Difference]: With dead ends: 18311 [2019-12-18 20:27:52,785 INFO L226 Difference]: Without dead ends: 18311 [2019-12-18 20:27:52,786 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 20:27:52,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18311 states. [2019-12-18 20:27:53,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18311 to 14447. [2019-12-18 20:27:53,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14447 states. [2019-12-18 20:27:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14447 states to 14447 states and 42747 transitions. [2019-12-18 20:27:53,049 INFO L78 Accepts]: Start accepts. Automaton has 14447 states and 42747 transitions. Word has length 55 [2019-12-18 20:27:53,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:53,049 INFO L462 AbstractCegarLoop]: Abstraction has 14447 states and 42747 transitions. [2019-12-18 20:27:53,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:27:53,050 INFO L276 IsEmpty]: Start isEmpty. Operand 14447 states and 42747 transitions. [2019-12-18 20:27:53,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:27:53,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:53,066 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] [2019-12-18 20:27:53,066 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:53,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:53,067 INFO L82 PathProgramCache]: Analyzing trace with hash -879531663, now seen corresponding path program 1 times [2019-12-18 20:27:53,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:53,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023359782] [2019-12-18 20:27:53,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:53,265 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 20:27:53,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023359782] [2019-12-18 20:27:53,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:53,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 20:27:53,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235603397] [2019-12-18 20:27:53,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 20:27:53,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:53,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 20:27:53,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-18 20:27:53,269 INFO L87 Difference]: Start difference. First operand 14447 states and 42747 transitions. Second operand 14 states. [2019-12-18 20:27:55,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:55,271 INFO L93 Difference]: Finished difference Result 21027 states and 61204 transitions. [2019-12-18 20:27:55,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 20:27:55,271 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-18 20:27:55,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:55,298 INFO L225 Difference]: With dead ends: 21027 [2019-12-18 20:27:55,299 INFO L226 Difference]: Without dead ends: 18741 [2019-12-18 20:27:55,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2019-12-18 20:27:55,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18741 states. [2019-12-18 20:27:55,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18741 to 14112. [2019-12-18 20:27:55,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14112 states. [2019-12-18 20:27:55,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14112 states to 14112 states and 41862 transitions. [2019-12-18 20:27:55,540 INFO L78 Accepts]: Start accepts. Automaton has 14112 states and 41862 transitions. Word has length 56 [2019-12-18 20:27:55,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:55,540 INFO L462 AbstractCegarLoop]: Abstraction has 14112 states and 41862 transitions. [2019-12-18 20:27:55,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 20:27:55,540 INFO L276 IsEmpty]: Start isEmpty. Operand 14112 states and 41862 transitions. [2019-12-18 20:27:55,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:27:55,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:55,559 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] [2019-12-18 20:27:55,560 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:55,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:55,560 INFO L82 PathProgramCache]: Analyzing trace with hash -255568507, now seen corresponding path program 2 times [2019-12-18 20:27:55,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:55,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736361023] [2019-12-18 20:27:55,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:55,825 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 20:27:55,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736361023] [2019-12-18 20:27:55,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:55,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:27:55,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032577618] [2019-12-18 20:27:55,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:27:55,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:55,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:27:55,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:27:55,827 INFO L87 Difference]: Start difference. First operand 14112 states and 41862 transitions. Second operand 11 states. [2019-12-18 20:27:57,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:57,142 INFO L93 Difference]: Finished difference Result 25389 states and 74630 transitions. [2019-12-18 20:27:57,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 20:27:57,142 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 20:27:57,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:57,172 INFO L225 Difference]: With dead ends: 25389 [2019-12-18 20:27:57,172 INFO L226 Difference]: Without dead ends: 20818 [2019-12-18 20:27:57,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=861, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 20:27:57,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20818 states. [2019-12-18 20:27:57,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20818 to 13167. [2019-12-18 20:27:57,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13167 states. [2019-12-18 20:27:57,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13167 states to 13167 states and 39253 transitions. [2019-12-18 20:27:57,431 INFO L78 Accepts]: Start accepts. Automaton has 13167 states and 39253 transitions. Word has length 56 [2019-12-18 20:27:57,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:57,431 INFO L462 AbstractCegarLoop]: Abstraction has 13167 states and 39253 transitions. [2019-12-18 20:27:57,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:27:57,432 INFO L276 IsEmpty]: Start isEmpty. Operand 13167 states and 39253 transitions. [2019-12-18 20:27:57,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:27:57,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:57,447 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] [2019-12-18 20:27:57,448 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:57,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:57,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1279960527, now seen corresponding path program 3 times [2019-12-18 20:27:57,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:57,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970287475] [2019-12-18 20:27:57,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:57,658 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 20:27:57,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970287475] [2019-12-18 20:27:57,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:57,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:27:57,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451416141] [2019-12-18 20:27:57,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:27:57,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:57,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:27:57,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:27:57,661 INFO L87 Difference]: Start difference. First operand 13167 states and 39253 transitions. Second operand 11 states. [2019-12-18 20:27:59,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:59,217 INFO L93 Difference]: Finished difference Result 16810 states and 49651 transitions. [2019-12-18 20:27:59,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 20:27:59,217 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 20:27:59,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:59,240 INFO L225 Difference]: With dead ends: 16810 [2019-12-18 20:27:59,240 INFO L226 Difference]: Without dead ends: 16526 [2019-12-18 20:27:59,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-18 20:27:59,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16526 states. [2019-12-18 20:27:59,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16526 to 13021. [2019-12-18 20:27:59,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13021 states. [2019-12-18 20:27:59,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13021 states to 13021 states and 38909 transitions. [2019-12-18 20:27:59,447 INFO L78 Accepts]: Start accepts. Automaton has 13021 states and 38909 transitions. Word has length 56 [2019-12-18 20:27:59,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:59,447 INFO L462 AbstractCegarLoop]: Abstraction has 13021 states and 38909 transitions. [2019-12-18 20:27:59,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:27:59,447 INFO L276 IsEmpty]: Start isEmpty. Operand 13021 states and 38909 transitions. [2019-12-18 20:27:59,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:27:59,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:59,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, 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 20:27:59,461 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:59,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:59,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1908396633, now seen corresponding path program 4 times [2019-12-18 20:27:59,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:59,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763914069] [2019-12-18 20:27:59,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:27:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:27:59,579 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:27:59,580 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:27:59,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~weak$$choice0~0_8) (= v_~x$r_buff1_thd2~0_17 0) (= 0 v_~x$r_buff0_thd2~0_26) (= v_~__unbuffered_p2_EBX~0_10 0) (= 0 v_~x$r_buff0_thd1~0_68) (= 0 v_~__unbuffered_cnt~0_20) (= 0 v_~__unbuffered_p1_EAX~0_11) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t412~0.base_30| 1)) (= 0 v_~x$w_buff0_used~0_106) (= 0 v_~x$w_buff1~0_25) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t412~0.base_30| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t412~0.base_30|) |v_ULTIMATE.start_main_~#t412~0.offset_23| 0)) |v_#memory_int_17|) (= 0 v_~x$r_buff0_thd0~0_21) (= 0 v_~__unbuffered_p0_EAX~0_12) (= v_~x~0_26 0) (= v_~main$tmp_guard0~0_8 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~weak$$choice2~0_34) (= (select .cse0 |v_ULTIMATE.start_main_~#t412~0.base_30|) 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$read_delayed~0_6) (= v_~x$r_buff1_thd1~0_41 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (= v_~x$r_buff1_thd0~0_21 0) (= |v_ULTIMATE.start_main_~#t412~0.offset_23| 0) (= v_~x$flush_delayed~0_14 0) (= v_~x$w_buff1_used~0_65 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t412~0.base_30|) (= 0 v_~x$r_buff0_thd3~0_20) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t412~0.base_30| 4)) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_15 0) (= v_~x$mem_tmp~0_11 0) (= 0 v_~z~0_9) (= v_~y~0_10 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 |v_#NULL.base_5|) (= v_~x$r_buff1_thd3~0_16 0) (= 0 v_~x$w_buff0~0_28))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ULTIMATE.start_main_~#t414~0.base=|v_ULTIMATE.start_main_~#t414~0.base_17|, ~x$flush_delayed~0=v_~x$flush_delayed~0_14, ULTIMATE.start_main_~#t412~0.offset=|v_ULTIMATE.start_main_~#t412~0.offset_23|, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_41, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_26, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_68, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_17|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~y~0=v_~y~0_10, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_9|, ULTIMATE.start_main_~#t412~0.base=|v_ULTIMATE.start_main_~#t412~0.base_30|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ULTIMATE.start_main_~#t413~0.base=|v_ULTIMATE.start_main_~#t413~0.base_22|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_21, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ULTIMATE.start_main_~#t414~0.offset=|v_ULTIMATE.start_main_~#t414~0.offset_15|, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_10|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_34, ULTIMATE.start_main_~#t413~0.offset=|v_ULTIMATE.start_main_~#t413~0.offset_18|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t414~0.base, ~x$flush_delayed~0, ULTIMATE.start_main_~#t412~0.offset, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t412~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t413~0.base, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t414~0.offset, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t413~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 20:27:59,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L823-1-->L825: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t413~0.base_11|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t413~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t413~0.base_11|) |v_ULTIMATE.start_main_~#t413~0.offset_10| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t413~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t413~0.offset_10|) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t413~0.base_11| 1) |v_#valid_37|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t413~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t413~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_15|, ULTIMATE.start_main_~#t413~0.base=|v_ULTIMATE.start_main_~#t413~0.base_11|, ULTIMATE.start_main_~#t413~0.offset=|v_ULTIMATE.start_main_~#t413~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t413~0.base, ULTIMATE.start_main_~#t413~0.offset] because there is no mapped edge [2019-12-18 20:27:59,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= 1 v_~x$w_buff0_used~0_71) (= v_~x$w_buff1_used~0_41 v_~x$w_buff0_used~0_72) (= 1 v_~x$w_buff0~0_16) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= (mod v_~x$w_buff1_used~0_41 256) 0) (= v_~x$w_buff0~0_17 v_~x$w_buff1~0_13) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_17, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_16, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~x$w_buff1~0=v_~x$w_buff1~0_13, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_41, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 20:27:59,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L825-1-->L827: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t414~0.offset_10|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t414~0.base_11|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t414~0.base_11|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t414~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t414~0.base_11|) |v_ULTIMATE.start_main_~#t414~0.offset_10| 2))) (= (store |v_#valid_34| |v_ULTIMATE.start_main_~#t414~0.base_11| 1) |v_#valid_33|) (not (= |v_ULTIMATE.start_main_~#t414~0.base_11| 0)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t414~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t414~0.base=|v_ULTIMATE.start_main_~#t414~0.base_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|, ULTIMATE.start_main_~#t414~0.offset=|v_ULTIMATE.start_main_~#t414~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t414~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t414~0.offset] because there is no mapped edge [2019-12-18 20:27:59,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L800-2-->L800-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-938440796 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-938440796 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite32_Out-938440796| ~x~0_In-938440796) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out-938440796| ~x$w_buff1~0_In-938440796)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-938440796, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-938440796, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-938440796, ~x~0=~x~0_In-938440796} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-938440796|, ~x$w_buff1~0=~x$w_buff1~0_In-938440796, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-938440796, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-938440796, ~x~0=~x~0_In-938440796} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 20:27:59,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In870863923 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In870863923 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out870863923| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out870863923| ~x$w_buff0_used~0_In870863923)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In870863923, ~x$w_buff0_used~0=~x$w_buff0_used~0_In870863923} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In870863923, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out870863923|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In870863923} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 20:27:59,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L779-->L779-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd2~0_In-1178489581 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1178489581 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1178489581 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1178489581 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-1178489581|)) (and (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-1178489581 |P1Thread1of1ForFork0_#t~ite29_Out-1178489581|) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1178489581, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1178489581, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1178489581, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1178489581} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1178489581, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1178489581, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1178489581, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1178489581|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1178489581} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 20:27:59,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-791624301 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-791624301 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out-791624301 0)) (and (= ~x$r_buff0_thd2~0_Out-791624301 ~x$r_buff0_thd2~0_In-791624301) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-791624301, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-791624301} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-791624301|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-791624301, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-791624301} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 20:27:59,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L781-->L781-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-435938567 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-435938567 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-435938567 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-435938567 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out-435938567| 0)) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out-435938567| ~x$r_buff1_thd2~0_In-435938567) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-435938567, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-435938567, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-435938567, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-435938567} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-435938567|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-435938567, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-435938567, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-435938567, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-435938567} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 20:27:59,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 20:27:59,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L744-->L744-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1148633820 256)))) (or (and (= ~x$w_buff0_used~0_In1148633820 |P0Thread1of1ForFork2_#t~ite15_Out1148633820|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In1148633820| |P0Thread1of1ForFork2_#t~ite14_Out1148633820|)) (and (= ~x$w_buff0_used~0_In1148633820 |P0Thread1of1ForFork2_#t~ite14_Out1148633820|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1148633820 256) 0))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1148633820 256))) (and .cse1 (= (mod ~x$w_buff1_used~0_In1148633820 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In1148633820 256)))) .cse0 (= |P0Thread1of1ForFork2_#t~ite14_Out1148633820| |P0Thread1of1ForFork2_#t~ite15_Out1148633820|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1148633820, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1148633820, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1148633820, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1148633820|, ~weak$$choice2~0=~weak$$choice2~0_In1148633820, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1148633820} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1148633820, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1148633820, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1148633820|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1148633820, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1148633820|, ~weak$$choice2~0=~weak$$choice2~0_In1148633820, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1148633820} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 20:27:59,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In974418487 256))) (.cse3 (= |P0Thread1of1ForFork2_#t~ite18_Out974418487| |P0Thread1of1ForFork2_#t~ite17_Out974418487|)) (.cse5 (= (mod ~x$w_buff1_used~0_In974418487 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In974418487 256))) (.cse6 (= 0 (mod ~x$r_buff0_thd1~0_In974418487 256))) (.cse4 (= 0 (mod ~x$w_buff0_used~0_In974418487 256)))) (or (let ((.cse1 (not .cse6))) (and .cse0 (= 0 |P0Thread1of1ForFork2_#t~ite16_Out974418487|) (= |P0Thread1of1ForFork2_#t~ite17_Out974418487| |P0Thread1of1ForFork2_#t~ite16_Out974418487|) (or .cse1 (not .cse2)) .cse3 (not .cse4) (or (not .cse5) .cse1))) (and (or (and (= ~x$w_buff1_used~0_In974418487 |P0Thread1of1ForFork2_#t~ite18_Out974418487|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In974418487| |P0Thread1of1ForFork2_#t~ite17_Out974418487|)) (and .cse0 (= ~x$w_buff1_used~0_In974418487 |P0Thread1of1ForFork2_#t~ite17_Out974418487|) .cse3 (or (and .cse5 .cse6) (and .cse2 .cse6) .cse4))) (= |P0Thread1of1ForFork2_#t~ite16_In974418487| |P0Thread1of1ForFork2_#t~ite16_Out974418487|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In974418487, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In974418487|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In974418487, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_In974418487|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In974418487, ~weak$$choice2~0=~weak$$choice2~0_In974418487, ~x$w_buff0_used~0=~x$w_buff0_used~0_In974418487} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In974418487, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out974418487|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out974418487|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In974418487, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_Out974418487|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In974418487, ~weak$$choice2~0=~weak$$choice2~0_In974418487, ~x$w_buff0_used~0=~x$w_buff0_used~0_In974418487} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17, P0Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 20:27:59,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L746-->L747: Formula: (and (= v_~x$r_buff0_thd1~0_36 v_~x$r_buff0_thd1~0_35) (not (= 0 (mod v_~weak$$choice2~0_16 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_36, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_7|, ~weak$$choice2~0=v_~weak$$choice2~0_16, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 20:27:59,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L800-4-->L801: Formula: (= v_~x~0_17 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 20:27:59,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L749-->L757: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_20) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 20:27:59,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1197211209 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1197211209 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-1197211209|)) (and (= ~x$w_buff0_used~0_In-1197211209 |P2Thread1of1ForFork1_#t~ite34_Out-1197211209|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1197211209, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1197211209} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1197211209|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1197211209, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1197211209} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 20:27:59,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In-1232643493 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1232643493 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1232643493 256))) (.cse3 (= (mod ~x$r_buff0_thd3~0_In-1232643493 256) 0))) (or (and (= ~x$w_buff1_used~0_In-1232643493 |P2Thread1of1ForFork1_#t~ite35_Out-1232643493|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-1232643493|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1232643493, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1232643493, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1232643493, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1232643493} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1232643493|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1232643493, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1232643493, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1232643493, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1232643493} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 20:27:59,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1146038034 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-1146038034 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out-1146038034| ~x$r_buff0_thd3~0_In-1146038034) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out-1146038034| 0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1146038034, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1146038034} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1146038034|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1146038034, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1146038034} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 20:27:59,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L804-->L804-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-1547910989 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-1547910989 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-1547910989 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In-1547910989 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out-1547910989| ~x$r_buff1_thd3~0_In-1547910989) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-1547910989|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1547910989, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1547910989, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1547910989, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1547910989} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1547910989|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1547910989, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1547910989, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1547910989, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1547910989} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 20:27:59,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L804-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 20:27:59,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L827-1-->L833: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 20:27:59,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L833-2-->L833-5: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-516035502 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-516035502 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite41_Out-516035502| |ULTIMATE.start_main_#t~ite42_Out-516035502|))) (or (and (not .cse0) (not .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite41_Out-516035502| ~x$w_buff1~0_In-516035502)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite41_Out-516035502| ~x~0_In-516035502) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-516035502, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-516035502, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-516035502, ~x~0=~x~0_In-516035502} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-516035502|, ~x$w_buff1~0=~x$w_buff1~0_In-516035502, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-516035502, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-516035502, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-516035502|, ~x~0=~x~0_In-516035502} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 20:27:59,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1804491132 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1804491132 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out1804491132|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite43_Out1804491132| ~x$w_buff0_used~0_In1804491132) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1804491132, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1804491132} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1804491132, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1804491132|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1804491132} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 20:27:59,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L835-->L835-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In672760160 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In672760160 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In672760160 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In672760160 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite44_Out672760160|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite44_Out672760160| ~x$w_buff1_used~0_In672760160)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In672760160, ~x$w_buff1_used~0=~x$w_buff1_used~0_In672760160, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In672760160, ~x$w_buff0_used~0=~x$w_buff0_used~0_In672760160} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In672760160, ~x$w_buff1_used~0=~x$w_buff1_used~0_In672760160, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In672760160, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out672760160|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In672760160} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 20:27:59,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1116219980 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1116219980 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1116219980| ~x$r_buff0_thd0~0_In1116219980)) (and (= |ULTIMATE.start_main_#t~ite45_Out1116219980| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1116219980, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1116219980} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1116219980, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1116219980|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1116219980} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 20:27:59,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L837-->L837-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1074711048 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1074711048 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-1074711048 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1074711048 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-1074711048| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite46_Out-1074711048| ~x$r_buff1_thd0~0_In-1074711048) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1074711048, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1074711048, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1074711048, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1074711048} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1074711048, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1074711048|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1074711048, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1074711048, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1074711048} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 20:27:59,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L837-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p0_EAX~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~x$r_buff1_thd0~0_16 |v_ULTIMATE.start_main_#t~ite46_11|) (= v_~main$tmp_guard1~0_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= 0 v_~__unbuffered_p1_EAX~0_8) (= v_~__unbuffered_p2_EAX~0_7 1) (= v_~__unbuffered_p2_EBX~0_7 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:27:59,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:27:59 BasicIcfg [2019-12-18 20:27:59,699 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:27:59,703 INFO L168 Benchmark]: Toolchain (without parser) took 80635.27 ms. Allocated memory was 148.4 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 105.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 20:27:59,704 INFO L168 Benchmark]: CDTParser took 0.70 ms. Allocated memory is still 148.4 MB. Free memory was 124.7 MB in the beginning and 124.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 20:27:59,704 INFO L168 Benchmark]: CACSL2BoogieTranslator took 800.09 ms. Allocated memory was 148.4 MB in the beginning and 205.0 MB in the end (delta: 56.6 MB). Free memory was 104.7 MB in the beginning and 159.3 MB in the end (delta: -54.6 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-18 20:27:59,705 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.53 ms. Allocated memory is still 205.0 MB. Free memory was 158.7 MB in the beginning and 156.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 20:27:59,706 INFO L168 Benchmark]: Boogie Preprocessor took 46.06 ms. Allocated memory is still 205.0 MB. Free memory was 156.1 MB in the beginning and 154.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 20:27:59,708 INFO L168 Benchmark]: RCFGBuilder took 811.30 ms. Allocated memory is still 205.0 MB. Free memory was 154.2 MB in the beginning and 107.0 MB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. [2019-12-18 20:27:59,709 INFO L168 Benchmark]: TraceAbstraction took 78909.61 ms. Allocated memory was 205.0 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 106.3 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-18 20:27:59,718 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.70 ms. Allocated memory is still 148.4 MB. Free memory was 124.7 MB in the beginning and 124.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 800.09 ms. Allocated memory was 148.4 MB in the beginning and 205.0 MB in the end (delta: 56.6 MB). Free memory was 104.7 MB in the beginning and 159.3 MB in the end (delta: -54.6 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.53 ms. Allocated memory is still 205.0 MB. Free memory was 158.7 MB in the beginning and 156.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.06 ms. Allocated memory is still 205.0 MB. Free memory was 156.1 MB in the beginning and 154.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 811.30 ms. Allocated memory is still 205.0 MB. Free memory was 154.2 MB in the beginning and 107.0 MB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 78909.61 ms. Allocated memory was 205.0 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 106.3 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 165 ProgramPointsBefore, 85 ProgramPointsAfterwards, 196 TransitionsBefore, 94 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 26 ChoiceCompositions, 6815 VarBasedMoverChecksPositive, 208 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 79642 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t412, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L825] FCALL, FORK 0 pthread_create(&t413, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L827] FCALL, FORK 0 pthread_create(&t414, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L791] 3 y = 1 [L794] 3 __unbuffered_p2_EAX = y [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L800] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L734] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L741] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L742] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L743] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L745] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L747] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L801] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L802] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L803] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L835] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L836] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 78.5s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 35.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5732 SDtfs, 7254 SDslu, 25036 SDs, 0 SdLazy, 22848 SolverSat, 378 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 453 GetRequests, 54 SyntacticMatches, 16 SemanticMatches, 383 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2164 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95102occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 19.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 138959 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1220 NumberOfCodeBlocks, 1220 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1138 ConstructedInterpolants, 0 QuantifiedInterpolants, 274522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...