/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:50:12,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:50:12,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:50:12,693 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:50:12,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:50:12,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:50:12,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:50:12,701 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:50:12,703 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:50:12,704 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:50:12,711 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:50:12,712 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:50:12,712 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:50:12,715 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:50:12,716 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:50:12,719 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:50:12,720 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:50:12,721 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:50:12,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:50:12,727 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:50:12,730 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:50:12,731 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:50:12,734 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:50:12,735 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:50:12,740 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:50:12,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:50:12,740 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:50:12,742 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:50:12,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:50:12,745 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:50:12,745 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:50:12,747 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:50:12,748 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:50:12,749 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:50:12,753 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:50:12,753 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:50:12,754 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:50:12,754 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:50:12,754 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:50:12,758 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:50:12,759 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:50:12,760 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 16:50:12,795 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:50:12,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:50:12,796 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:50:12,796 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:50:12,800 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:50:12,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:50:12,800 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:50:12,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:50:12,800 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:50:12,801 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:50:12,801 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:50:12,801 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:50:12,801 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:50:12,801 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:50:12,801 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:50:12,802 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:50:12,802 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:50:12,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:50:12,802 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:50:12,802 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:50:12,803 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:50:12,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:50:12,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:50:12,803 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:50:12,803 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:50:12,804 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:50:12,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:50:12,804 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:50:12,804 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:50:13,097 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:50:13,121 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:50:13,126 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:50:13,128 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:50:13,128 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:50:13,129 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_rmo.opt.i [2019-12-18 16:50:13,202 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f580d705e/6259a88041694512b293f92b5c9cb180/FLAG38845ba80 [2019-12-18 16:50:13,799 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:50:13,799 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_rmo.opt.i [2019-12-18 16:50:13,819 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f580d705e/6259a88041694512b293f92b5c9cb180/FLAG38845ba80 [2019-12-18 16:50:14,047 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f580d705e/6259a88041694512b293f92b5c9cb180 [2019-12-18 16:50:14,056 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:50:14,058 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:50:14,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:50:14,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:50:14,063 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:50:14,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:50:14" (1/1) ... [2019-12-18 16:50:14,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42ffe542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:14, skipping insertion in model container [2019-12-18 16:50:14,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:50:14" (1/1) ... [2019-12-18 16:50:14,076 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:50:14,153 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:50:14,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:50:14,689 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:50:14,768 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:50:14,844 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:50:14,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:14 WrapperNode [2019-12-18 16:50:14,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:50:14,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:50:14,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:50:14,845 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:50:14,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:14" (1/1) ... [2019-12-18 16:50:14,874 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:14" (1/1) ... [2019-12-18 16:50:14,906 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:50:14,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:50:14,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:50:14,907 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:50:14,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:14" (1/1) ... [2019-12-18 16:50:14,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:14" (1/1) ... [2019-12-18 16:50:14,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:14" (1/1) ... [2019-12-18 16:50:14,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:14" (1/1) ... [2019-12-18 16:50:14,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:14" (1/1) ... [2019-12-18 16:50:14,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:14" (1/1) ... [2019-12-18 16:50:14,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:14" (1/1) ... [2019-12-18 16:50:14,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:50:14,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:50:14,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:50:14,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:50:14,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:14" (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 16:50:15,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:50:15,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:50:15,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:50:15,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:50:15,015 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:50:15,015 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:50:15,016 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:50:15,016 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:50:15,016 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 16:50:15,016 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 16:50:15,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:50:15,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:50:15,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:50:15,018 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 16:50:15,779 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:50:15,779 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:50:15,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:50:15 BoogieIcfgContainer [2019-12-18 16:50:15,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:50:15,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:50:15,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:50:15,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:50:15,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:50:14" (1/3) ... [2019-12-18 16:50:15,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1061a39b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:50:15, skipping insertion in model container [2019-12-18 16:50:15,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:14" (2/3) ... [2019-12-18 16:50:15,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1061a39b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:50:15, skipping insertion in model container [2019-12-18 16:50:15,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:50:15" (3/3) ... [2019-12-18 16:50:15,789 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_rmo.opt.i [2019-12-18 16:50:15,800 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:50:15,800 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:50:15,808 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:50:15,809 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:50:15,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,852 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,853 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,893 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,893 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,893 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,893 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,894 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,900 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,900 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,910 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,912 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,917 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,918 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,918 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,924 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,924 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:50:15,940 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 16:50:15,962 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:50:15,962 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:50:15,962 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:50:15,962 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:50:15,963 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:50:15,963 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:50:15,963 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:50:15,963 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:50:15,985 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 197 transitions [2019-12-18 16:50:15,987 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-18 16:50:16,112 INFO L126 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-18 16:50:16,112 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:50:16,135 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 9/160 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 16:50:16,160 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-18 16:50:16,252 INFO L126 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-18 16:50:16,253 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:50:16,262 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 9/160 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 16:50:16,286 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 16:50:16,288 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:50:22,160 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 16:50:22,336 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 16:50:22,368 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74173 [2019-12-18 16:50:22,368 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 16:50:22,399 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 90 transitions [2019-12-18 16:50:32,156 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 82802 states. [2019-12-18 16:50:32,158 INFO L276 IsEmpty]: Start isEmpty. Operand 82802 states. [2019-12-18 16:50:32,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 16:50:32,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:32,164 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 16:50:32,165 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:32,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:32,172 INFO L82 PathProgramCache]: Analyzing trace with hash 803939489, now seen corresponding path program 1 times [2019-12-18 16:50:32,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:32,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924936083] [2019-12-18 16:50:32,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:32,455 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 16:50:32,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924936083] [2019-12-18 16:50:32,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:32,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:50:32,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98572713] [2019-12-18 16:50:32,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:50:32,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:32,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:50:32,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:50:32,477 INFO L87 Difference]: Start difference. First operand 82802 states. Second operand 3 states. [2019-12-18 16:50:35,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:35,897 INFO L93 Difference]: Finished difference Result 81762 states and 350164 transitions. [2019-12-18 16:50:35,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:50:35,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 16:50:35,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:36,469 INFO L225 Difference]: With dead ends: 81762 [2019-12-18 16:50:36,469 INFO L226 Difference]: Without dead ends: 77082 [2019-12-18 16:50:36,471 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 16:50:39,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77082 states. [2019-12-18 16:50:41,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77082 to 77082. [2019-12-18 16:50:41,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77082 states. [2019-12-18 16:50:42,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77082 states to 77082 states and 329650 transitions. [2019-12-18 16:50:42,104 INFO L78 Accepts]: Start accepts. Automaton has 77082 states and 329650 transitions. Word has length 5 [2019-12-18 16:50:42,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:42,104 INFO L462 AbstractCegarLoop]: Abstraction has 77082 states and 329650 transitions. [2019-12-18 16:50:42,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:50:42,105 INFO L276 IsEmpty]: Start isEmpty. Operand 77082 states and 329650 transitions. [2019-12-18 16:50:42,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 16:50:42,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:42,114 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:50:42,114 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:42,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:42,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1596901179, now seen corresponding path program 1 times [2019-12-18 16:50:42,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:42,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670084175] [2019-12-18 16:50:42,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:42,189 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 16:50:42,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670084175] [2019-12-18 16:50:42,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:42,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:50:42,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763995611] [2019-12-18 16:50:42,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:50:42,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:42,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:50:42,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:50:42,194 INFO L87 Difference]: Start difference. First operand 77082 states and 329650 transitions. Second operand 3 states. [2019-12-18 16:50:42,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:42,509 INFO L93 Difference]: Finished difference Result 20478 states and 70372 transitions. [2019-12-18 16:50:42,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:50:42,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 16:50:42,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:42,577 INFO L225 Difference]: With dead ends: 20478 [2019-12-18 16:50:42,578 INFO L226 Difference]: Without dead ends: 20478 [2019-12-18 16:50:42,579 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 16:50:42,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20478 states. [2019-12-18 16:50:43,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20478 to 20478. [2019-12-18 16:50:43,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20478 states. [2019-12-18 16:50:43,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20478 states to 20478 states and 70372 transitions. [2019-12-18 16:50:43,125 INFO L78 Accepts]: Start accepts. Automaton has 20478 states and 70372 transitions. Word has length 13 [2019-12-18 16:50:43,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:43,125 INFO L462 AbstractCegarLoop]: Abstraction has 20478 states and 70372 transitions. [2019-12-18 16:50:43,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:50:43,125 INFO L276 IsEmpty]: Start isEmpty. Operand 20478 states and 70372 transitions. [2019-12-18 16:50:43,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 16:50:43,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:43,127 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:50:43,128 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:43,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:43,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1662041210, now seen corresponding path program 1 times [2019-12-18 16:50:43,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:43,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976482290] [2019-12-18 16:50:43,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:43,210 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 16:50:43,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976482290] [2019-12-18 16:50:43,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:43,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:50:43,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649688402] [2019-12-18 16:50:43,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:50:43,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:43,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:50:43,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:50:43,213 INFO L87 Difference]: Start difference. First operand 20478 states and 70372 transitions. Second operand 4 states. [2019-12-18 16:50:45,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:45,028 INFO L93 Difference]: Finished difference Result 30802 states and 102312 transitions. [2019-12-18 16:50:45,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:50:45,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 16:50:45,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:45,128 INFO L225 Difference]: With dead ends: 30802 [2019-12-18 16:50:45,129 INFO L226 Difference]: Without dead ends: 30788 [2019-12-18 16:50:45,129 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 16:50:45,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30788 states. [2019-12-18 16:50:45,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30788 to 27348. [2019-12-18 16:50:45,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27348 states. [2019-12-18 16:50:45,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27348 states to 27348 states and 91824 transitions. [2019-12-18 16:50:45,940 INFO L78 Accepts]: Start accepts. Automaton has 27348 states and 91824 transitions. Word has length 13 [2019-12-18 16:50:45,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:45,940 INFO L462 AbstractCegarLoop]: Abstraction has 27348 states and 91824 transitions. [2019-12-18 16:50:45,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:50:45,940 INFO L276 IsEmpty]: Start isEmpty. Operand 27348 states and 91824 transitions. [2019-12-18 16:50:45,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 16:50:45,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:45,943 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:50:45,943 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:45,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:45,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1480512145, now seen corresponding path program 1 times [2019-12-18 16:50:45,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:45,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708714305] [2019-12-18 16:50:45,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:46,038 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 16:50:46,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708714305] [2019-12-18 16:50:46,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:46,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:50:46,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245224079] [2019-12-18 16:50:46,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:50:46,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:46,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:50:46,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:50:46,044 INFO L87 Difference]: Start difference. First operand 27348 states and 91824 transitions. Second operand 4 states. [2019-12-18 16:50:46,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:46,363 INFO L93 Difference]: Finished difference Result 35523 states and 117963 transitions. [2019-12-18 16:50:46,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:50:46,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 16:50:46,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:46,466 INFO L225 Difference]: With dead ends: 35523 [2019-12-18 16:50:46,466 INFO L226 Difference]: Without dead ends: 35512 [2019-12-18 16:50:46,467 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 16:50:46,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35512 states. [2019-12-18 16:50:47,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35512 to 30900. [2019-12-18 16:50:47,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30900 states. [2019-12-18 16:50:47,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30900 states to 30900 states and 103384 transitions. [2019-12-18 16:50:47,517 INFO L78 Accepts]: Start accepts. Automaton has 30900 states and 103384 transitions. Word has length 14 [2019-12-18 16:50:47,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:47,518 INFO L462 AbstractCegarLoop]: Abstraction has 30900 states and 103384 transitions. [2019-12-18 16:50:47,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:50:47,519 INFO L276 IsEmpty]: Start isEmpty. Operand 30900 states and 103384 transitions. [2019-12-18 16:50:47,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 16:50:47,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:47,521 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:50:47,521 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:47,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:47,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1480362260, now seen corresponding path program 1 times [2019-12-18 16:50:47,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:47,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492871424] [2019-12-18 16:50:47,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:47,580 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 16:50:47,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492871424] [2019-12-18 16:50:47,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:47,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:50:47,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674180041] [2019-12-18 16:50:47,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:50:47,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:47,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:50:47,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:50:47,583 INFO L87 Difference]: Start difference. First operand 30900 states and 103384 transitions. Second operand 4 states. [2019-12-18 16:50:47,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:47,940 INFO L93 Difference]: Finished difference Result 38443 states and 127475 transitions. [2019-12-18 16:50:47,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:50:47,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 16:50:47,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:48,018 INFO L225 Difference]: With dead ends: 38443 [2019-12-18 16:50:48,018 INFO L226 Difference]: Without dead ends: 38432 [2019-12-18 16:50:48,018 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 16:50:48,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38432 states. [2019-12-18 16:50:48,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38432 to 30923. [2019-12-18 16:50:48,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30923 states. [2019-12-18 16:50:48,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30923 states to 30923 states and 103333 transitions. [2019-12-18 16:50:48,656 INFO L78 Accepts]: Start accepts. Automaton has 30923 states and 103333 transitions. Word has length 14 [2019-12-18 16:50:48,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:48,657 INFO L462 AbstractCegarLoop]: Abstraction has 30923 states and 103333 transitions. [2019-12-18 16:50:48,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:50:48,657 INFO L276 IsEmpty]: Start isEmpty. Operand 30923 states and 103333 transitions. [2019-12-18 16:50:48,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:50:48,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:48,666 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 16:50:48,666 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:48,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:48,666 INFO L82 PathProgramCache]: Analyzing trace with hash 2067973460, now seen corresponding path program 1 times [2019-12-18 16:50:48,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:48,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184271643] [2019-12-18 16:50:48,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:50:48,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184271643] [2019-12-18 16:50:48,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:48,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:50:48,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087188259] [2019-12-18 16:50:48,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:50:48,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:48,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:50:48,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:50:48,763 INFO L87 Difference]: Start difference. First operand 30923 states and 103333 transitions. Second operand 5 states. [2019-12-18 16:50:49,150 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-12-18 16:50:49,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:49,547 INFO L93 Difference]: Finished difference Result 45281 states and 149378 transitions. [2019-12-18 16:50:49,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:50:49,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 16:50:49,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:49,623 INFO L225 Difference]: With dead ends: 45281 [2019-12-18 16:50:49,623 INFO L226 Difference]: Without dead ends: 45258 [2019-12-18 16:50:49,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:50:49,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45258 states. [2019-12-18 16:50:50,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45258 to 32469. [2019-12-18 16:50:50,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32469 states. [2019-12-18 16:50:50,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32469 states to 32469 states and 108463 transitions. [2019-12-18 16:50:50,262 INFO L78 Accepts]: Start accepts. Automaton has 32469 states and 108463 transitions. Word has length 22 [2019-12-18 16:50:50,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:50,263 INFO L462 AbstractCegarLoop]: Abstraction has 32469 states and 108463 transitions. [2019-12-18 16:50:50,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:50:50,263 INFO L276 IsEmpty]: Start isEmpty. Operand 32469 states and 108463 transitions. [2019-12-18 16:50:50,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:50:50,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:50,272 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 16:50:50,272 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:50,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:50,272 INFO L82 PathProgramCache]: Analyzing trace with hash 2068123345, now seen corresponding path program 1 times [2019-12-18 16:50:50,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:50,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204767453] [2019-12-18 16:50:50,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:50,355 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 16:50:50,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204767453] [2019-12-18 16:50:50,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:50,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:50:50,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000641701] [2019-12-18 16:50:50,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:50:50,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:50,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:50:50,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:50:50,357 INFO L87 Difference]: Start difference. First operand 32469 states and 108463 transitions. Second operand 5 states. [2019-12-18 16:50:50,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:50,936 INFO L93 Difference]: Finished difference Result 46044 states and 151821 transitions. [2019-12-18 16:50:50,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:50:50,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 16:50:50,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:51,018 INFO L225 Difference]: With dead ends: 46044 [2019-12-18 16:50:51,019 INFO L226 Difference]: Without dead ends: 46021 [2019-12-18 16:50:51,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:50:51,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46021 states. [2019-12-18 16:50:51,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46021 to 30490. [2019-12-18 16:50:51,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30490 states. [2019-12-18 16:50:51,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30490 states to 30490 states and 101754 transitions. [2019-12-18 16:50:51,922 INFO L78 Accepts]: Start accepts. Automaton has 30490 states and 101754 transitions. Word has length 22 [2019-12-18 16:50:51,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:51,923 INFO L462 AbstractCegarLoop]: Abstraction has 30490 states and 101754 transitions. [2019-12-18 16:50:51,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:50:51,923 INFO L276 IsEmpty]: Start isEmpty. Operand 30490 states and 101754 transitions. [2019-12-18 16:50:51,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 16:50:51,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:51,938 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 16:50:51,938 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:51,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:51,939 INFO L82 PathProgramCache]: Analyzing trace with hash 668919418, now seen corresponding path program 1 times [2019-12-18 16:50:51,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:51,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320697258] [2019-12-18 16:50:51,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:52,020 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 16:50:52,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320697258] [2019-12-18 16:50:52,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:52,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:50:52,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103594421] [2019-12-18 16:50:52,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:50:52,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:52,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:50:52,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:50:52,023 INFO L87 Difference]: Start difference. First operand 30490 states and 101754 transitions. Second operand 4 states. [2019-12-18 16:50:52,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:52,109 INFO L93 Difference]: Finished difference Result 11657 states and 35881 transitions. [2019-12-18 16:50:52,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:50:52,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 16:50:52,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:52,137 INFO L225 Difference]: With dead ends: 11657 [2019-12-18 16:50:52,138 INFO L226 Difference]: Without dead ends: 11657 [2019-12-18 16:50:52,139 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 16:50:52,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11657 states. [2019-12-18 16:50:52,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11657 to 11489. [2019-12-18 16:50:52,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11489 states. [2019-12-18 16:50:52,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11489 states to 11489 states and 35393 transitions. [2019-12-18 16:50:52,434 INFO L78 Accepts]: Start accepts. Automaton has 11489 states and 35393 transitions. Word has length 25 [2019-12-18 16:50:52,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:52,434 INFO L462 AbstractCegarLoop]: Abstraction has 11489 states and 35393 transitions. [2019-12-18 16:50:52,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:50:52,434 INFO L276 IsEmpty]: Start isEmpty. Operand 11489 states and 35393 transitions. [2019-12-18 16:50:52,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 16:50:52,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:52,455 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 16:50:52,455 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:52,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:52,455 INFO L82 PathProgramCache]: Analyzing trace with hash 954456655, now seen corresponding path program 1 times [2019-12-18 16:50:52,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:52,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856905460] [2019-12-18 16:50:52,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:52,518 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 16:50:52,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856905460] [2019-12-18 16:50:52,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:52,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:50:52,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491880212] [2019-12-18 16:50:52,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:50:52,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:52,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:50:52,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:50:52,522 INFO L87 Difference]: Start difference. First operand 11489 states and 35393 transitions. Second operand 3 states. [2019-12-18 16:50:52,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:52,615 INFO L93 Difference]: Finished difference Result 15100 states and 45684 transitions. [2019-12-18 16:50:52,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:50:52,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 16:50:52,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:52,645 INFO L225 Difference]: With dead ends: 15100 [2019-12-18 16:50:52,646 INFO L226 Difference]: Without dead ends: 15100 [2019-12-18 16:50:52,646 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 16:50:52,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15100 states. [2019-12-18 16:50:52,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15100 to 12271. [2019-12-18 16:50:52,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12271 states. [2019-12-18 16:50:52,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12271 states to 12271 states and 37679 transitions. [2019-12-18 16:50:52,847 INFO L78 Accepts]: Start accepts. Automaton has 12271 states and 37679 transitions. Word has length 39 [2019-12-18 16:50:52,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:52,847 INFO L462 AbstractCegarLoop]: Abstraction has 12271 states and 37679 transitions. [2019-12-18 16:50:52,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:50:52,848 INFO L276 IsEmpty]: Start isEmpty. Operand 12271 states and 37679 transitions. [2019-12-18 16:50:52,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 16:50:52,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:52,868 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 16:50:52,868 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:52,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:52,868 INFO L82 PathProgramCache]: Analyzing trace with hash 515851026, now seen corresponding path program 1 times [2019-12-18 16:50:52,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:52,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352882556] [2019-12-18 16:50:52,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:52,952 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 16:50:52,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352882556] [2019-12-18 16:50:52,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:52,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:50:52,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156701986] [2019-12-18 16:50:52,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:50:52,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:52,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:50:52,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:50:52,954 INFO L87 Difference]: Start difference. First operand 12271 states and 37679 transitions. Second operand 5 states. [2019-12-18 16:50:53,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:53,027 INFO L93 Difference]: Finished difference Result 11017 states and 34440 transitions. [2019-12-18 16:50:53,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:50:53,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 16:50:53,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:53,044 INFO L225 Difference]: With dead ends: 11017 [2019-12-18 16:50:53,044 INFO L226 Difference]: Without dead ends: 11017 [2019-12-18 16:50:53,045 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 16:50:53,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11017 states. [2019-12-18 16:50:53,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11017 to 10393. [2019-12-18 16:50:53,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10393 states. [2019-12-18 16:50:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10393 states to 10393 states and 32688 transitions. [2019-12-18 16:50:53,212 INFO L78 Accepts]: Start accepts. Automaton has 10393 states and 32688 transitions. Word has length 39 [2019-12-18 16:50:53,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:53,212 INFO L462 AbstractCegarLoop]: Abstraction has 10393 states and 32688 transitions. [2019-12-18 16:50:53,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:50:53,212 INFO L276 IsEmpty]: Start isEmpty. Operand 10393 states and 32688 transitions. [2019-12-18 16:50:53,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:50:53,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:53,229 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] [2019-12-18 16:50:53,230 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:53,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:53,230 INFO L82 PathProgramCache]: Analyzing trace with hash 165786421, now seen corresponding path program 1 times [2019-12-18 16:50:53,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:53,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507383463] [2019-12-18 16:50:53,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:53,310 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 16:50:53,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507383463] [2019-12-18 16:50:53,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:53,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:50:53,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465704102] [2019-12-18 16:50:53,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:50:53,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:53,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:50:53,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:50:53,312 INFO L87 Difference]: Start difference. First operand 10393 states and 32688 transitions. Second operand 4 states. [2019-12-18 16:50:53,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:53,400 INFO L93 Difference]: Finished difference Result 18723 states and 58888 transitions. [2019-12-18 16:50:53,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:50:53,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-18 16:50:53,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:53,418 INFO L225 Difference]: With dead ends: 18723 [2019-12-18 16:50:53,419 INFO L226 Difference]: Without dead ends: 8627 [2019-12-18 16:50:53,419 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 16:50:53,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8627 states. [2019-12-18 16:50:53,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8627 to 8627. [2019-12-18 16:50:53,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8627 states. [2019-12-18 16:50:53,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8627 states to 8627 states and 27021 transitions. [2019-12-18 16:50:53,583 INFO L78 Accepts]: Start accepts. Automaton has 8627 states and 27021 transitions. Word has length 53 [2019-12-18 16:50:53,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:53,584 INFO L462 AbstractCegarLoop]: Abstraction has 8627 states and 27021 transitions. [2019-12-18 16:50:53,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:50:53,584 INFO L276 IsEmpty]: Start isEmpty. Operand 8627 states and 27021 transitions. [2019-12-18 16:50:53,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:50:53,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:53,597 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] [2019-12-18 16:50:53,597 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:53,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:53,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1891813083, now seen corresponding path program 2 times [2019-12-18 16:50:53,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:53,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237344291] [2019-12-18 16:50:53,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:53,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 16:50:53,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237344291] [2019-12-18 16:50:53,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:53,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:50:53,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737121328] [2019-12-18 16:50:53,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:50:53,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:53,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:50:53,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:50:53,828 INFO L87 Difference]: Start difference. First operand 8627 states and 27021 transitions. Second operand 7 states. [2019-12-18 16:50:54,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:54,227 INFO L93 Difference]: Finished difference Result 24029 states and 75191 transitions. [2019-12-18 16:50:54,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:50:54,228 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 16:50:54,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:54,263 INFO L225 Difference]: With dead ends: 24029 [2019-12-18 16:50:54,264 INFO L226 Difference]: Without dead ends: 18333 [2019-12-18 16:50:54,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 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 16:50:54,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18333 states. [2019-12-18 16:50:54,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18333 to 10739. [2019-12-18 16:50:54,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10739 states. [2019-12-18 16:50:54,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10739 states to 10739 states and 33937 transitions. [2019-12-18 16:50:54,507 INFO L78 Accepts]: Start accepts. Automaton has 10739 states and 33937 transitions. Word has length 53 [2019-12-18 16:50:54,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:54,508 INFO L462 AbstractCegarLoop]: Abstraction has 10739 states and 33937 transitions. [2019-12-18 16:50:54,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:50:54,508 INFO L276 IsEmpty]: Start isEmpty. Operand 10739 states and 33937 transitions. [2019-12-18 16:50:54,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:50:54,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:54,524 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] [2019-12-18 16:50:54,524 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:54,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:54,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1878615555, now seen corresponding path program 3 times [2019-12-18 16:50:54,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:54,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399754163] [2019-12-18 16:50:54,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:54,601 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 16:50:54,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399754163] [2019-12-18 16:50:54,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:54,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:50:54,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023238099] [2019-12-18 16:50:54,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:50:54,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:54,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:50:54,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:50:54,604 INFO L87 Difference]: Start difference. First operand 10739 states and 33937 transitions. Second operand 7 states. [2019-12-18 16:50:54,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:54,992 INFO L93 Difference]: Finished difference Result 29619 states and 91701 transitions. [2019-12-18 16:50:54,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:50:54,992 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 16:50:54,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:55,023 INFO L225 Difference]: With dead ends: 29619 [2019-12-18 16:50:55,023 INFO L226 Difference]: Without dead ends: 21040 [2019-12-18 16:50:55,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 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 16:50:55,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21040 states. [2019-12-18 16:50:55,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21040 to 13259. [2019-12-18 16:50:55,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13259 states. [2019-12-18 16:50:55,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13259 states to 13259 states and 41902 transitions. [2019-12-18 16:50:55,285 INFO L78 Accepts]: Start accepts. Automaton has 13259 states and 41902 transitions. Word has length 53 [2019-12-18 16:50:55,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:55,285 INFO L462 AbstractCegarLoop]: Abstraction has 13259 states and 41902 transitions. [2019-12-18 16:50:55,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:50:55,285 INFO L276 IsEmpty]: Start isEmpty. Operand 13259 states and 41902 transitions. [2019-12-18 16:50:55,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:50:55,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:55,301 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] [2019-12-18 16:50:55,301 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:55,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:55,302 INFO L82 PathProgramCache]: Analyzing trace with hash 193726155, now seen corresponding path program 4 times [2019-12-18 16:50:55,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:55,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103943] [2019-12-18 16:50:55,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:55,361 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 16:50:55,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103943] [2019-12-18 16:50:55,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:55,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:50:55,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857853851] [2019-12-18 16:50:55,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:50:55,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:55,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:50:55,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:50:55,363 INFO L87 Difference]: Start difference. First operand 13259 states and 41902 transitions. Second operand 3 states. [2019-12-18 16:50:55,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:55,448 INFO L93 Difference]: Finished difference Result 19683 states and 62661 transitions. [2019-12-18 16:50:55,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:50:55,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 16:50:55,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:55,462 INFO L225 Difference]: With dead ends: 19683 [2019-12-18 16:50:55,463 INFO L226 Difference]: Without dead ends: 6496 [2019-12-18 16:50:55,464 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 16:50:55,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6496 states. [2019-12-18 16:50:55,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6496 to 6496. [2019-12-18 16:50:55,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6496 states. [2019-12-18 16:50:55,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6496 states to 6496 states and 20893 transitions. [2019-12-18 16:50:55,563 INFO L78 Accepts]: Start accepts. Automaton has 6496 states and 20893 transitions. Word has length 53 [2019-12-18 16:50:55,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:55,563 INFO L462 AbstractCegarLoop]: Abstraction has 6496 states and 20893 transitions. [2019-12-18 16:50:55,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:50:55,564 INFO L276 IsEmpty]: Start isEmpty. Operand 6496 states and 20893 transitions. [2019-12-18 16:50:55,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:50:55,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:55,571 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] [2019-12-18 16:50:55,571 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:55,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:55,572 INFO L82 PathProgramCache]: Analyzing trace with hash 819014287, now seen corresponding path program 5 times [2019-12-18 16:50:55,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:55,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518329922] [2019-12-18 16:50:55,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:55,696 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 16:50:55,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518329922] [2019-12-18 16:50:55,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:55,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:50:55,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859949716] [2019-12-18 16:50:55,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:50:55,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:55,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:50:55,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:50:55,698 INFO L87 Difference]: Start difference. First operand 6496 states and 20893 transitions. Second operand 9 states. [2019-12-18 16:50:57,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:57,082 INFO L93 Difference]: Finished difference Result 34361 states and 106385 transitions. [2019-12-18 16:50:57,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 16:50:57,083 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-18 16:50:57,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:57,123 INFO L225 Difference]: With dead ends: 34361 [2019-12-18 16:50:57,124 INFO L226 Difference]: Without dead ends: 27058 [2019-12-18 16:50:57,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=339, Invalid=1143, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 16:50:57,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27058 states. [2019-12-18 16:50:57,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27058 to 8895. [2019-12-18 16:50:57,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8895 states. [2019-12-18 16:50:57,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8895 states to 8895 states and 28920 transitions. [2019-12-18 16:50:57,480 INFO L78 Accepts]: Start accepts. Automaton has 8895 states and 28920 transitions. Word has length 53 [2019-12-18 16:50:57,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:57,481 INFO L462 AbstractCegarLoop]: Abstraction has 8895 states and 28920 transitions. [2019-12-18 16:50:57,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:50:57,481 INFO L276 IsEmpty]: Start isEmpty. Operand 8895 states and 28920 transitions. [2019-12-18 16:50:57,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:50:57,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:57,492 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] [2019-12-18 16:50:57,492 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:57,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:57,492 INFO L82 PathProgramCache]: Analyzing trace with hash 743806145, now seen corresponding path program 6 times [2019-12-18 16:50:57,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:57,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122874491] [2019-12-18 16:50:57,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:57,597 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 16:50:57,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122874491] [2019-12-18 16:50:57,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:57,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:50:57,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151389627] [2019-12-18 16:50:57,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:50:57,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:57,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:50:57,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:50:57,599 INFO L87 Difference]: Start difference. First operand 8895 states and 28920 transitions. Second operand 9 states. [2019-12-18 16:50:58,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:58,827 INFO L93 Difference]: Finished difference Result 25540 states and 79803 transitions. [2019-12-18 16:50:58,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 16:50:58,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-18 16:50:58,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:58,862 INFO L225 Difference]: With dead ends: 25540 [2019-12-18 16:50:58,863 INFO L226 Difference]: Without dead ends: 23475 [2019-12-18 16:50:58,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 16:50:58,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23475 states. [2019-12-18 16:50:59,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23475 to 8823. [2019-12-18 16:50:59,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8823 states. [2019-12-18 16:50:59,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8823 states to 8823 states and 28692 transitions. [2019-12-18 16:50:59,105 INFO L78 Accepts]: Start accepts. Automaton has 8823 states and 28692 transitions. Word has length 53 [2019-12-18 16:50:59,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:59,106 INFO L462 AbstractCegarLoop]: Abstraction has 8823 states and 28692 transitions. [2019-12-18 16:50:59,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:50:59,106 INFO L276 IsEmpty]: Start isEmpty. Operand 8823 states and 28692 transitions. [2019-12-18 16:50:59,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:50:59,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:59,119 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] [2019-12-18 16:50:59,119 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:59,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:59,119 INFO L82 PathProgramCache]: Analyzing trace with hash -249470771, now seen corresponding path program 7 times [2019-12-18 16:50:59,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:59,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988697087] [2019-12-18 16:50:59,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:59,179 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 16:50:59,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988697087] [2019-12-18 16:50:59,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:59,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:50:59,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826656022] [2019-12-18 16:50:59,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:50:59,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:59,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:50:59,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:50:59,181 INFO L87 Difference]: Start difference. First operand 8823 states and 28692 transitions. Second operand 3 states. [2019-12-18 16:50:59,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:59,221 INFO L93 Difference]: Finished difference Result 7806 states and 24655 transitions. [2019-12-18 16:50:59,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:50:59,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 16:50:59,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:59,236 INFO L225 Difference]: With dead ends: 7806 [2019-12-18 16:50:59,236 INFO L226 Difference]: Without dead ends: 7806 [2019-12-18 16:50:59,237 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 16:50:59,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7806 states. [2019-12-18 16:50:59,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7806 to 7630. [2019-12-18 16:50:59,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7630 states. [2019-12-18 16:50:59,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7630 states to 7630 states and 24077 transitions. [2019-12-18 16:50:59,357 INFO L78 Accepts]: Start accepts. Automaton has 7630 states and 24077 transitions. Word has length 53 [2019-12-18 16:50:59,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:59,357 INFO L462 AbstractCegarLoop]: Abstraction has 7630 states and 24077 transitions. [2019-12-18 16:50:59,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:50:59,357 INFO L276 IsEmpty]: Start isEmpty. Operand 7630 states and 24077 transitions. [2019-12-18 16:50:59,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 16:50:59,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:59,367 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] [2019-12-18 16:50:59,367 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:59,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:59,368 INFO L82 PathProgramCache]: Analyzing trace with hash 537172061, now seen corresponding path program 1 times [2019-12-18 16:50:59,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:59,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689550877] [2019-12-18 16:50:59,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:59,475 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 16:50:59,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689550877] [2019-12-18 16:50:59,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:59,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:50:59,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621171764] [2019-12-18 16:50:59,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:50:59,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:59,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:50:59,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:50:59,478 INFO L87 Difference]: Start difference. First operand 7630 states and 24077 transitions. Second operand 9 states. [2019-12-18 16:51:00,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:51:00,433 INFO L93 Difference]: Finished difference Result 13524 states and 42092 transitions. [2019-12-18 16:51:00,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 16:51:00,433 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 16:51:00,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:51:00,447 INFO L225 Difference]: With dead ends: 13524 [2019-12-18 16:51:00,448 INFO L226 Difference]: Without dead ends: 9340 [2019-12-18 16:51:00,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2019-12-18 16:51:00,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9340 states. [2019-12-18 16:51:00,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9340 to 7948. [2019-12-18 16:51:00,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7948 states. [2019-12-18 16:51:00,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7948 states to 7948 states and 24811 transitions. [2019-12-18 16:51:00,582 INFO L78 Accepts]: Start accepts. Automaton has 7948 states and 24811 transitions. Word has length 54 [2019-12-18 16:51:00,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:51:00,582 INFO L462 AbstractCegarLoop]: Abstraction has 7948 states and 24811 transitions. [2019-12-18 16:51:00,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:51:00,583 INFO L276 IsEmpty]: Start isEmpty. Operand 7948 states and 24811 transitions. [2019-12-18 16:51:00,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 16:51:00,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:51:00,591 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] [2019-12-18 16:51:00,591 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:51:00,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:51:00,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1663404977, now seen corresponding path program 2 times [2019-12-18 16:51:00,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:51:00,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948536229] [2019-12-18 16:51:00,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:51:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:51:00,721 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 16:51:00,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948536229] [2019-12-18 16:51:00,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:51:00,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:51:00,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276112955] [2019-12-18 16:51:00,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:51:00,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:51:00,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:51:00,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:51:00,725 INFO L87 Difference]: Start difference. First operand 7948 states and 24811 transitions. Second operand 9 states. [2019-12-18 16:51:02,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:51:02,120 INFO L93 Difference]: Finished difference Result 17269 states and 51692 transitions. [2019-12-18 16:51:02,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 16:51:02,121 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 16:51:02,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:51:02,148 INFO L225 Difference]: With dead ends: 17269 [2019-12-18 16:51:02,148 INFO L226 Difference]: Without dead ends: 17065 [2019-12-18 16:51:02,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2019-12-18 16:51:02,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17065 states. [2019-12-18 16:51:02,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17065 to 13336. [2019-12-18 16:51:02,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13336 states. [2019-12-18 16:51:02,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13336 states to 13336 states and 40648 transitions. [2019-12-18 16:51:02,466 INFO L78 Accepts]: Start accepts. Automaton has 13336 states and 40648 transitions. Word has length 54 [2019-12-18 16:51:02,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:51:02,467 INFO L462 AbstractCegarLoop]: Abstraction has 13336 states and 40648 transitions. [2019-12-18 16:51:02,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:51:02,467 INFO L276 IsEmpty]: Start isEmpty. Operand 13336 states and 40648 transitions. [2019-12-18 16:51:02,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 16:51:02,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:51:02,483 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] [2019-12-18 16:51:02,483 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:51:02,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:51:02,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1876186184, now seen corresponding path program 1 times [2019-12-18 16:51:02,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:51:02,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203064675] [2019-12-18 16:51:02,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:51:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:51:02,527 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 16:51:02,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203064675] [2019-12-18 16:51:02,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:51:02,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:51:02,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600160107] [2019-12-18 16:51:02,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:51:02,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:51:02,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:51:02,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:51:02,529 INFO L87 Difference]: Start difference. First operand 13336 states and 40648 transitions. Second operand 3 states. [2019-12-18 16:51:02,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:51:02,624 INFO L93 Difference]: Finished difference Result 15137 states and 45063 transitions. [2019-12-18 16:51:02,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:51:02,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 16:51:02,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:51:02,652 INFO L225 Difference]: With dead ends: 15137 [2019-12-18 16:51:02,652 INFO L226 Difference]: Without dead ends: 15137 [2019-12-18 16:51:02,653 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 16:51:02,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15137 states. [2019-12-18 16:51:02,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15137 to 10529. [2019-12-18 16:51:02,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10529 states. [2019-12-18 16:51:02,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10529 states to 10529 states and 31259 transitions. [2019-12-18 16:51:02,854 INFO L78 Accepts]: Start accepts. Automaton has 10529 states and 31259 transitions. Word has length 54 [2019-12-18 16:51:02,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:51:02,854 INFO L462 AbstractCegarLoop]: Abstraction has 10529 states and 31259 transitions. [2019-12-18 16:51:02,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:51:02,854 INFO L276 IsEmpty]: Start isEmpty. Operand 10529 states and 31259 transitions. [2019-12-18 16:51:02,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 16:51:02,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:51:02,866 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] [2019-12-18 16:51:02,866 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:51:02,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:51:02,866 INFO L82 PathProgramCache]: Analyzing trace with hash 225488507, now seen corresponding path program 3 times [2019-12-18 16:51:02,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:51:02,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075493338] [2019-12-18 16:51:02,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:51:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:51:02,936 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 16:51:02,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075493338] [2019-12-18 16:51:02,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:51:02,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:51:02,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420437031] [2019-12-18 16:51:02,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:51:02,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:51:02,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:51:02,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:51:02,938 INFO L87 Difference]: Start difference. First operand 10529 states and 31259 transitions. Second operand 5 states. [2019-12-18 16:51:03,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:51:03,447 INFO L93 Difference]: Finished difference Result 15324 states and 44385 transitions. [2019-12-18 16:51:03,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:51:03,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-12-18 16:51:03,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:51:03,476 INFO L225 Difference]: With dead ends: 15324 [2019-12-18 16:51:03,476 INFO L226 Difference]: Without dead ends: 15240 [2019-12-18 16:51:03,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:51:03,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15240 states. [2019-12-18 16:51:03,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15240 to 11226. [2019-12-18 16:51:03,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11226 states. [2019-12-18 16:51:03,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11226 states to 11226 states and 33137 transitions. [2019-12-18 16:51:03,692 INFO L78 Accepts]: Start accepts. Automaton has 11226 states and 33137 transitions. Word has length 54 [2019-12-18 16:51:03,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:51:03,692 INFO L462 AbstractCegarLoop]: Abstraction has 11226 states and 33137 transitions. [2019-12-18 16:51:03,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:51:03,692 INFO L276 IsEmpty]: Start isEmpty. Operand 11226 states and 33137 transitions. [2019-12-18 16:51:03,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 16:51:03,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:51:03,704 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] [2019-12-18 16:51:03,704 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:51:03,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:51:03,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1966745669, now seen corresponding path program 4 times [2019-12-18 16:51:03,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:51:03,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812991268] [2019-12-18 16:51:03,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:51:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:51:03,872 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 16:51:03,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812991268] [2019-12-18 16:51:03,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:51:03,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:51:03,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194303556] [2019-12-18 16:51:03,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:51:03,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:51:03,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:51:03,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:51:03,877 INFO L87 Difference]: Start difference. First operand 11226 states and 33137 transitions. Second operand 11 states. [2019-12-18 16:51:04,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:51:04,778 INFO L93 Difference]: Finished difference Result 15040 states and 44007 transitions. [2019-12-18 16:51:04,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 16:51:04,779 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-18 16:51:04,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:51:04,811 INFO L225 Difference]: With dead ends: 15040 [2019-12-18 16:51:04,812 INFO L226 Difference]: Without dead ends: 14470 [2019-12-18 16:51:04,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2019-12-18 16:51:04,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14470 states. [2019-12-18 16:51:05,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14470 to 13306. [2019-12-18 16:51:05,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13306 states. [2019-12-18 16:51:05,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13306 states to 13306 states and 39002 transitions. [2019-12-18 16:51:05,222 INFO L78 Accepts]: Start accepts. Automaton has 13306 states and 39002 transitions. Word has length 54 [2019-12-18 16:51:05,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:51:05,222 INFO L462 AbstractCegarLoop]: Abstraction has 13306 states and 39002 transitions. [2019-12-18 16:51:05,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:51:05,222 INFO L276 IsEmpty]: Start isEmpty. Operand 13306 states and 39002 transitions. [2019-12-18 16:51:05,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 16:51:05,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:51:05,249 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] [2019-12-18 16:51:05,249 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:51:05,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:51:05,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1143336617, now seen corresponding path program 5 times [2019-12-18 16:51:05,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:51:05,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136686950] [2019-12-18 16:51:05,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:51:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:51:05,362 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 16:51:05,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136686950] [2019-12-18 16:51:05,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:51:05,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:51:05,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129080392] [2019-12-18 16:51:05,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:51:05,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:51:05,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:51:05,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:51:05,364 INFO L87 Difference]: Start difference. First operand 13306 states and 39002 transitions. Second operand 3 states. [2019-12-18 16:51:05,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:51:05,430 INFO L93 Difference]: Finished difference Result 13304 states and 38997 transitions. [2019-12-18 16:51:05,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:51:05,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 16:51:05,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:51:05,456 INFO L225 Difference]: With dead ends: 13304 [2019-12-18 16:51:05,456 INFO L226 Difference]: Without dead ends: 13304 [2019-12-18 16:51:05,456 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 16:51:05,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13304 states. [2019-12-18 16:51:05,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13304 to 10495. [2019-12-18 16:51:05,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10495 states. [2019-12-18 16:51:05,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10495 states to 10495 states and 31256 transitions. [2019-12-18 16:51:05,679 INFO L78 Accepts]: Start accepts. Automaton has 10495 states and 31256 transitions. Word has length 54 [2019-12-18 16:51:05,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:51:05,679 INFO L462 AbstractCegarLoop]: Abstraction has 10495 states and 31256 transitions. [2019-12-18 16:51:05,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:51:05,679 INFO L276 IsEmpty]: Start isEmpty. Operand 10495 states and 31256 transitions. [2019-12-18 16:51:05,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 16:51:05,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:51:05,689 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 16:51:05,689 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:51:05,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:51:05,689 INFO L82 PathProgramCache]: Analyzing trace with hash 905870895, now seen corresponding path program 1 times [2019-12-18 16:51:05,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:51:05,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085664365] [2019-12-18 16:51:05,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:51:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:51:06,402 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 16:51:06,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085664365] [2019-12-18 16:51:06,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:51:06,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 16:51:06,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006902776] [2019-12-18 16:51:06,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 16:51:06,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:51:06,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 16:51:06,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-12-18 16:51:06,409 INFO L87 Difference]: Start difference. First operand 10495 states and 31256 transitions. Second operand 18 states. [2019-12-18 16:51:10,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:51:10,582 INFO L93 Difference]: Finished difference Result 15647 states and 45164 transitions. [2019-12-18 16:51:10,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-18 16:51:10,582 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2019-12-18 16:51:10,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:51:10,601 INFO L225 Difference]: With dead ends: 15647 [2019-12-18 16:51:10,602 INFO L226 Difference]: Without dead ends: 12863 [2019-12-18 16:51:10,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=491, Invalid=2701, Unknown=0, NotChecked=0, Total=3192 [2019-12-18 16:51:10,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12863 states. [2019-12-18 16:51:10,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12863 to 10717. [2019-12-18 16:51:10,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10717 states. [2019-12-18 16:51:10,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10717 states to 10717 states and 31759 transitions. [2019-12-18 16:51:10,774 INFO L78 Accepts]: Start accepts. Automaton has 10717 states and 31759 transitions. Word has length 55 [2019-12-18 16:51:10,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:51:10,775 INFO L462 AbstractCegarLoop]: Abstraction has 10717 states and 31759 transitions. [2019-12-18 16:51:10,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 16:51:10,775 INFO L276 IsEmpty]: Start isEmpty. Operand 10717 states and 31759 transitions. [2019-12-18 16:51:10,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 16:51:10,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:51:10,786 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 16:51:10,786 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:51:10,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:51:10,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1093024805, now seen corresponding path program 2 times [2019-12-18 16:51:10,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:51:10,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136165836] [2019-12-18 16:51:10,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:51:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:51:10,936 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 16:51:10,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136165836] [2019-12-18 16:51:10,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:51:10,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:51:10,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73693113] [2019-12-18 16:51:10,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 16:51:10,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:51:10,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 16:51:10,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:51:10,938 INFO L87 Difference]: Start difference. First operand 10717 states and 31759 transitions. Second operand 10 states. [2019-12-18 16:51:11,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:51:11,481 INFO L93 Difference]: Finished difference Result 13075 states and 38289 transitions. [2019-12-18 16:51:11,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 16:51:11,481 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-18 16:51:11,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:51:11,497 INFO L225 Difference]: With dead ends: 13075 [2019-12-18 16:51:11,497 INFO L226 Difference]: Without dead ends: 11525 [2019-12-18 16:51:11,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-18 16:51:11,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11525 states. [2019-12-18 16:51:11,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11525 to 10287. [2019-12-18 16:51:11,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10287 states. [2019-12-18 16:51:11,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10287 states to 10287 states and 30607 transitions. [2019-12-18 16:51:11,654 INFO L78 Accepts]: Start accepts. Automaton has 10287 states and 30607 transitions. Word has length 55 [2019-12-18 16:51:11,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:51:11,654 INFO L462 AbstractCegarLoop]: Abstraction has 10287 states and 30607 transitions. [2019-12-18 16:51:11,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 16:51:11,654 INFO L276 IsEmpty]: Start isEmpty. Operand 10287 states and 30607 transitions. [2019-12-18 16:51:11,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 16:51:11,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:51:11,664 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 16:51:11,664 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:51:11,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:51:11,664 INFO L82 PathProgramCache]: Analyzing trace with hash 408163443, now seen corresponding path program 3 times [2019-12-18 16:51:11,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:51:11,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333157668] [2019-12-18 16:51:11,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:51:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:51:11,803 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 16:51:11,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333157668] [2019-12-18 16:51:11,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:51:11,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:51:11,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093833174] [2019-12-18 16:51:11,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:51:11,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:51:11,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:51:11,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:51:11,806 INFO L87 Difference]: Start difference. First operand 10287 states and 30607 transitions. Second operand 11 states. [2019-12-18 16:51:12,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:51:12,434 INFO L93 Difference]: Finished difference Result 11394 states and 33477 transitions. [2019-12-18 16:51:12,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 16:51:12,435 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 16:51:12,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:51:12,450 INFO L225 Difference]: With dead ends: 11394 [2019-12-18 16:51:12,450 INFO L226 Difference]: Without dead ends: 9129 [2019-12-18 16:51:12,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-12-18 16:51:12,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9129 states. [2019-12-18 16:51:12,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9129 to 8227. [2019-12-18 16:51:12,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8227 states. [2019-12-18 16:51:12,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8227 states to 8227 states and 24810 transitions. [2019-12-18 16:51:12,580 INFO L78 Accepts]: Start accepts. Automaton has 8227 states and 24810 transitions. Word has length 55 [2019-12-18 16:51:12,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:51:12,580 INFO L462 AbstractCegarLoop]: Abstraction has 8227 states and 24810 transitions. [2019-12-18 16:51:12,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:51:12,580 INFO L276 IsEmpty]: Start isEmpty. Operand 8227 states and 24810 transitions. [2019-12-18 16:51:12,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 16:51:12,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:51:12,588 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 16:51:12,589 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:51:12,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:51:12,589 INFO L82 PathProgramCache]: Analyzing trace with hash 406067685, now seen corresponding path program 4 times [2019-12-18 16:51:12,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:51:12,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970192853] [2019-12-18 16:51:12,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:51:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:51:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:51:12,695 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:51:12,696 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:51:12,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$r_buff0_thd1~0_335 0) (= 0 v_~y$r_buff1_thd3~0_125) (= v_~x~0_35 0) (= v_~y$w_buff1~0_269 0) (= 0 v_~y$r_buff1_thd2~0_133) (= v_~a~0_54 0) (= v_~y$w_buff1_used~0_559 0) (= v_~main$tmp_guard1~0_48 0) (= |v_#NULL.offset_3| 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t648~0.base_28| 4)) (= 0 v_~__unbuffered_p2_EAX~0_59) (= 0 v_~y$r_buff0_thd2~0_172) (= |v_ULTIMATE.start_main_~#t648~0.offset_19| 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t648~0.base_28|) (= v_~y$read_delayed~0_6 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$w_buff0_used~0_854 0) (= 0 v_~__unbuffered_p0_EAX~0_68) (= v_~__unbuffered_p0_EBX~0_53 0) (= v_~z~0_107 0) (= 0 v_~y$r_buff0_thd3~0_136) (= v_~weak$$choice2~0_153 0) (= v_~y$mem_tmp~0_47 0) (= v_~__unbuffered_p2_EBX~0_59 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_cnt~0_162 0) (= 0 v_~y$flush_delayed~0_90) (= 0 |v_#NULL.base_3|) (= v_~y$r_buff0_thd0~0_138 0) (= 0 v_~y$w_buff0~0_440) (= v_~y$r_buff1_thd1~0_236 0) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t648~0.base_28| 1)) (= 0 v_~y$read_delayed_var~0.offset_6) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t648~0.base_28| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t648~0.base_28|) |v_ULTIMATE.start_main_~#t648~0.offset_19| 0)) |v_#memory_int_17|) (= 0 v_~weak$$choice0~0_34) (= v_~y$r_buff1_thd0~0_136 0) (= v_~y~0_214 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t648~0.base_28|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t648~0.offset=|v_ULTIMATE.start_main_~#t648~0.offset_19|, ULTIMATE.start_main_~#t650~0.base=|v_ULTIMATE.start_main_~#t650~0.base_23|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_37|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_33|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~a~0=v_~a~0_54, ~y$mem_tmp~0=v_~y$mem_tmp~0_47, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_125, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_335, ~y$flush_delayed~0=v_~y$flush_delayed~0_90, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_59, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_59, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_53, ULTIMATE.start_main_~#t650~0.offset=|v_ULTIMATE.start_main_~#t650~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$w_buff1~0=v_~y$w_buff1~0_269, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_172, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_162, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_136, ~x~0=v_~x~0_35, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_854, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_95|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_67|, ULTIMATE.start_main_~#t648~0.base=|v_ULTIMATE.start_main_~#t648~0.base_28|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_37|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_236, ~y$w_buff0~0=v_~y$w_buff0~0_440, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_136, ULTIMATE.start_main_~#t649~0.offset=|v_ULTIMATE.start_main_~#t649~0.offset_17|, ~y~0=v_~y~0_214, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_17|, ULTIMATE.start_main_~#t649~0.base=|v_ULTIMATE.start_main_~#t649~0.base_23|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_133, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_138, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_107, ~weak$$choice2~0=v_~weak$$choice2~0_153, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_559} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t648~0.offset, ULTIMATE.start_main_~#t650~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t650~0.offset, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t648~0.base, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t649~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t649~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 16:51:12,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L831-1-->L833: Formula: (and (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t649~0.base_11| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t649~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t649~0.base_11|) |v_ULTIMATE.start_main_~#t649~0.offset_10| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t649~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t649~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t649~0.offset_10|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t649~0.base_11|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t649~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t649~0.base=|v_ULTIMATE.start_main_~#t649~0.base_11|, ULTIMATE.start_main_~#t649~0.offset=|v_ULTIMATE.start_main_~#t649~0.offset_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t649~0.base, ULTIMATE.start_main_~#t649~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 16:51:12,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L833-1-->L835: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t650~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t650~0.base_11|) |v_ULTIMATE.start_main_~#t650~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t650~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t650~0.offset_10| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t650~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t650~0.base_11| 0)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t650~0.base_11| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t650~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t650~0.base=|v_ULTIMATE.start_main_~#t650~0.base_11|, ULTIMATE.start_main_~#t650~0.offset=|v_ULTIMATE.start_main_~#t650~0.offset_10|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t650~0.base, ULTIMATE.start_main_~#t650~0.offset, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 16:51:12,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] P1ENTRY-->L5-3: Formula: (and (= ~y$w_buff0_used~0_Out-365828432 1) (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-365828432 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-365828432|) (= P1Thread1of1ForFork1_~arg.base_Out-365828432 |P1Thread1of1ForFork1_#in~arg.base_In-365828432|) (= (mod ~y$w_buff1_used~0_Out-365828432 256) 0) (= 1 ~y$w_buff0~0_Out-365828432) (= ~y$w_buff1~0_Out-365828432 ~y$w_buff0~0_In-365828432) (= |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-365828432| 1) (= |P1Thread1of1ForFork1_#in~arg.offset_In-365828432| P1Thread1of1ForFork1_~arg.offset_Out-365828432) (= ~y$w_buff0_used~0_In-365828432 ~y$w_buff1_used~0_Out-365828432)) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-365828432, ~y$w_buff0~0=~y$w_buff0~0_In-365828432, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-365828432|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-365828432|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-365828432, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out-365828432, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out-365828432, ~y$w_buff1~0=~y$w_buff1~0_Out-365828432, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-365828432|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out-365828432, ~y$w_buff0~0=~y$w_buff0~0_Out-365828432, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-365828432|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-365828432|, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-365828432} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 16:51:12,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L808-2-->L808-5: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In-1022331374 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1022331374 256) 0)) (.cse2 (= |P2Thread1of1ForFork2_#t~ite32_Out-1022331374| |P2Thread1of1ForFork2_#t~ite33_Out-1022331374|))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite32_Out-1022331374| ~y~0_In-1022331374) .cse2) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite32_Out-1022331374| ~y$w_buff1~0_In-1022331374) .cse2))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1022331374, ~y$w_buff1~0=~y$w_buff1~0_In-1022331374, ~y~0=~y~0_In-1022331374, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1022331374} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1022331374, ~y$w_buff1~0=~y$w_buff1~0_In-1022331374, P2Thread1of1ForFork2_#t~ite33=|P2Thread1of1ForFork2_#t~ite33_Out-1022331374|, P2Thread1of1ForFork2_#t~ite32=|P2Thread1of1ForFork2_#t~ite32_Out-1022331374|, ~y~0=~y~0_In-1022331374, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1022331374} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-18 16:51:12,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1852211607 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1852211607 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_Out-1852211607| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite28_Out-1852211607| ~y$w_buff0_used~0_In-1852211607) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1852211607, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1852211607} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1852211607, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1852211607, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1852211607|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 16:51:12,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-101460405 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-101460405 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite34_Out-101460405| ~y$w_buff0_used~0_In-101460405)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite34_Out-101460405| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-101460405, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-101460405} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out-101460405|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-101460405, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-101460405} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34] because there is no mapped edge [2019-12-18 16:51:12,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-385052297 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-385052297 256))) (.cse3 (= (mod ~y$r_buff0_thd3~0_In-385052297 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-385052297 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite35_Out-385052297| ~y$w_buff1_used~0_In-385052297) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite35_Out-385052297| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-385052297, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-385052297, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-385052297, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-385052297} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out-385052297|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-385052297, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-385052297, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-385052297, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-385052297} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35] because there is no mapped edge [2019-12-18 16:51:12,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1065333326 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1065333326 256) 0))) (or (and (= ~y$r_buff0_thd3~0_In-1065333326 |P2Thread1of1ForFork2_#t~ite36_Out-1065333326|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork2_#t~ite36_Out-1065333326|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1065333326, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1065333326} OutVars{P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out-1065333326|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1065333326, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1065333326} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-18 16:51:12,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L812-->L812-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd3~0_In-899610097 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-899610097 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-899610097 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-899610097 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In-899610097 |P2Thread1of1ForFork2_#t~ite37_Out-899610097|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork2_#t~ite37_Out-899610097|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-899610097, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-899610097, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-899610097, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-899610097} OutVars{P2Thread1of1ForFork2_#t~ite37=|P2Thread1of1ForFork2_#t~ite37_Out-899610097|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-899610097, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-899610097, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-899610097, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-899610097} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37] because there is no mapped edge [2019-12-18 16:51:12,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L812-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite37_40| v_~y$r_buff1_thd3~0_74) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1))) InVars {P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_39|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_74, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 16:51:12,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L787-->L787-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1165407166 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1165407166 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1165407166 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1165407166 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite29_Out1165407166| 0)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out1165407166| ~y$w_buff1_used~0_In1165407166) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1165407166, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1165407166, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1165407166, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1165407166} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1165407166, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1165407166|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1165407166, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1165407166, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1165407166} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-18 16:51:12,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L788-->L789: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1945184130 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1945184130 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In1945184130 ~y$r_buff0_thd2~0_Out1945184130)) (and (= 0 ~y$r_buff0_thd2~0_Out1945184130) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1945184130, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1945184130} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1945184130|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1945184130, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1945184130} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 16:51:12,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L789-->L789-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-368306162 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-368306162 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-368306162 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-368306162 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite31_Out-368306162| ~y$r_buff1_thd2~0_In-368306162)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite31_Out-368306162| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-368306162, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-368306162, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-368306162, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-368306162} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-368306162, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-368306162, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-368306162|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-368306162, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-368306162} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 16:51:12,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L789-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P1Thread1of1ForFork1_#t~ite31_40| v_~y$r_buff1_thd2~0_54) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 16:51:12,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L750-->L750-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1422684360 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1422684360| ~y$w_buff0~0_In1422684360) (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In1422684360 256) 0))) (or (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In1422684360 256))) (= 0 (mod ~y$w_buff0_used~0_In1422684360 256)) (and .cse0 (= 0 (mod ~y$r_buff1_thd1~0_In1422684360 256))))) .cse1 (= |P0Thread1of1ForFork0_#t~ite8_Out1422684360| |P0Thread1of1ForFork0_#t~ite9_Out1422684360|)) (and (= |P0Thread1of1ForFork0_#t~ite9_Out1422684360| ~y$w_buff0~0_In1422684360) (= |P0Thread1of1ForFork0_#t~ite8_In1422684360| |P0Thread1of1ForFork0_#t~ite8_Out1422684360|) (not .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1422684360, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1422684360, ~y$w_buff0~0=~y$w_buff0~0_In1422684360, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1422684360, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_In1422684360|, ~weak$$choice2~0=~weak$$choice2~0_In1422684360, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1422684360} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1422684360, P0Thread1of1ForFork0_#t~ite9=|P0Thread1of1ForFork0_#t~ite9_Out1422684360|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1422684360, ~y$w_buff0~0=~y$w_buff0~0_In1422684360, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1422684360|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1422684360, ~weak$$choice2~0=~weak$$choice2~0_In1422684360, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1422684360} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite9, P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 16:51:12,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L751-->L751-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-846260952 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite11_Out-846260952| |P0Thread1of1ForFork0_#t~ite12_Out-846260952|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-846260952 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-846260952 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-846260952 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-846260952 256))))) (= |P0Thread1of1ForFork0_#t~ite11_Out-846260952| ~y$w_buff1~0_In-846260952)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite11_In-846260952| |P0Thread1of1ForFork0_#t~ite11_Out-846260952|) (= |P0Thread1of1ForFork0_#t~ite12_Out-846260952| ~y$w_buff1~0_In-846260952)))) InVars {P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_In-846260952|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-846260952, ~y$w_buff1~0=~y$w_buff1~0_In-846260952, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-846260952, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-846260952, ~weak$$choice2~0=~weak$$choice2~0_In-846260952, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-846260952} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out-846260952|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-846260952, ~y$w_buff1~0=~y$w_buff1~0_In-846260952, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-846260952, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-846260952, ~weak$$choice2~0=~weak$$choice2~0_In-846260952, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out-846260952|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-846260952} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11, P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 16:51:12,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [812] [812] L754-->L755-8: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite22_35| |v_P0Thread1of1ForFork0_#t~ite22_34|) (= |v_P0Thread1of1ForFork0_#t~ite23_31| |v_P0Thread1of1ForFork0_#t~ite23_30|) (= v_~y$r_buff1_thd1~0_224 |v_P0Thread1of1ForFork0_#t~ite24_32|) (= v_~y$r_buff0_thd1~0_326 v_~y$r_buff0_thd1~0_325) (not (= 0 (mod v_~weak$$choice2~0_143 256)))) InVars {P0Thread1of1ForFork0_#t~ite22=|v_P0Thread1of1ForFork0_#t~ite22_35|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_224, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_326, ~weak$$choice2~0=v_~weak$$choice2~0_143, P0Thread1of1ForFork0_#t~ite23=|v_P0Thread1of1ForFork0_#t~ite23_31|} OutVars{P0Thread1of1ForFork0_#t~ite22=|v_P0Thread1of1ForFork0_#t~ite22_34|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_224, P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_37|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_48|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_325, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_33|, ~weak$$choice2~0=v_~weak$$choice2~0_143, P0Thread1of1ForFork0_#t~ite24=|v_P0Thread1of1ForFork0_#t~ite24_32|, P0Thread1of1ForFork0_#t~ite23=|v_P0Thread1of1ForFork0_#t~ite23_30|} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite22, P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19, P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-18 16:51:12,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L757-->L765: Formula: (and (not (= (mod v_~y$flush_delayed~0_17 256) 0)) (= v_~y~0_46 v_~y$mem_tmp~0_7) (= 0 v_~y$flush_delayed~0_16) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_21|, ~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~y~0=v_~y~0_46} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-18 16:51:12,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L835-1-->L841: Formula: (and (= 3 v_~__unbuffered_cnt~0_42) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 16:51:12,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L841-2-->L841-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In1285057752 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1285057752 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In1285057752 |ULTIMATE.start_main_#t~ite41_Out1285057752|) (not .cse1)) (and (= ~y~0_In1285057752 |ULTIMATE.start_main_#t~ite41_Out1285057752|) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1285057752, ~y~0=~y~0_In1285057752, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1285057752, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1285057752} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1285057752|, ~y$w_buff1~0=~y$w_buff1~0_In1285057752, ~y~0=~y~0_In1285057752, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1285057752, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1285057752} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 16:51:12,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L841-4-->L842: Formula: (= v_~y~0_14 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ~y~0=v_~y~0_14, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 16:51:12,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L842-->L842-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1930966666 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1930966666 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1930966666 |ULTIMATE.start_main_#t~ite43_Out-1930966666|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-1930966666| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1930966666, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1930966666} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1930966666, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1930966666, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1930966666|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 16:51:12,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L843-->L843-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In2046881407 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In2046881407 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In2046881407 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In2046881407 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out2046881407| 0)) (and (= |ULTIMATE.start_main_#t~ite44_Out2046881407| ~y$w_buff1_used~0_In2046881407) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2046881407, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2046881407, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2046881407, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2046881407} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2046881407, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2046881407, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2046881407, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2046881407|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2046881407} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 16:51:12,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L844-->L844-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-271592950 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-271592950 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-271592950| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-271592950| ~y$r_buff0_thd0~0_In-271592950)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-271592950, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-271592950} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-271592950, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-271592950, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-271592950|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 16:51:12,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L845-->L845-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1108302590 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1108302590 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1108302590 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1108302590 256)))) (or (and (= ~y$r_buff1_thd0~0_In-1108302590 |ULTIMATE.start_main_#t~ite46_Out-1108302590|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-1108302590|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1108302590, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1108302590, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1108302590, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1108302590} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1108302590, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1108302590, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1108302590|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1108302590, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1108302590} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 16:51:12,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L845-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~main$tmp_guard1~0_17 0) (= v_~z~0_50 2) (= 1 v_~__unbuffered_p0_EAX~0_34) (= v_~__unbuffered_p0_EBX~0_19 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= 2 v_~__unbuffered_p2_EAX~0_22) (= |v_ULTIMATE.start_main_#t~ite46_39| v_~y$r_buff1_thd0~0_74) (= v_~__unbuffered_p2_EBX~0_22 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_39|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~z~0=v_~z~0_50} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_38|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~z~0=v_~z~0_50, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_74, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 16:51:12,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:51:12 BasicIcfg [2019-12-18 16:51:12,806 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:51:12,813 INFO L168 Benchmark]: Toolchain (without parser) took 58753.27 ms. Allocated memory was 139.5 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 102.8 MB in the beginning and 746.5 MB in the end (delta: -643.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 16:51:12,814 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 16:51:12,814 INFO L168 Benchmark]: CACSL2BoogieTranslator took 785.27 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 102.4 MB in the beginning and 156.5 MB in the end (delta: -54.0 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2019-12-18 16:51:12,815 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.39 ms. Allocated memory is still 202.9 MB. Free memory was 156.5 MB in the beginning and 153.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 16:51:12,815 INFO L168 Benchmark]: Boogie Preprocessor took 37.92 ms. Allocated memory is still 202.9 MB. Free memory was 153.9 MB in the beginning and 151.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 16:51:12,816 INFO L168 Benchmark]: RCFGBuilder took 836.20 ms. Allocated memory is still 202.9 MB. Free memory was 151.9 MB in the beginning and 104.7 MB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. [2019-12-18 16:51:12,816 INFO L168 Benchmark]: TraceAbstraction took 57024.48 ms. Allocated memory was 202.9 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 104.1 MB in the beginning and 746.5 MB in the end (delta: -642.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 16:51:12,824 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.51 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 785.27 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 102.4 MB in the beginning and 156.5 MB in the end (delta: -54.0 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.39 ms. Allocated memory is still 202.9 MB. Free memory was 156.5 MB in the beginning and 153.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.92 ms. Allocated memory is still 202.9 MB. Free memory was 153.9 MB in the beginning and 151.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 836.20 ms. Allocated memory is still 202.9 MB. Free memory was 151.9 MB in the beginning and 104.7 MB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 57024.48 ms. Allocated memory was 202.9 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 104.1 MB in the beginning and 746.5 MB in the end (delta: -642.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.4s, 166 ProgramPointsBefore, 83 ProgramPointsAfterwards, 197 TransitionsBefore, 90 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 28 ChoiceCompositions, 6616 VarBasedMoverChecksPositive, 243 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 263 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 74173 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t648, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L833] FCALL, FORK 0 pthread_create(&t649, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L835] FCALL, FORK 0 pthread_create(&t650, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L775] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L776] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L777] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L778] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L779] 2 y$r_buff0_thd2 = (_Bool)1 [L782] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 z = 2 [L802] 3 __unbuffered_p2_EAX = z [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L808] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L810] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L811] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L786] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L787] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L736] 1 a = 1 [L739] 1 x = 1 [L742] 1 __unbuffered_p0_EAX = x [L745] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L746] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L747] 1 y$flush_delayed = weak$$choice2 [L748] 1 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L750] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L751] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L752] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L753] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 __unbuffered_p0_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L841] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L842] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L843] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L844] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 56.7s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 22.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4862 SDtfs, 7575 SDslu, 16587 SDs, 0 SdLazy, 9244 SolverSat, 383 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 356 GetRequests, 47 SyntacticMatches, 17 SemanticMatches, 292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1947 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82802occurred 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: 14.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 117870 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1121 NumberOfCodeBlocks, 1121 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1040 ConstructedInterpolants, 0 QuantifiedInterpolants, 182144 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...