/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/safe013_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:39:57,789 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:39:57,791 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:39:57,804 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:39:57,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:39:57,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:39:57,807 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:39:57,809 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:39:57,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:39:57,811 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:39:57,812 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:39:57,814 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:39:57,814 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:39:57,815 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:39:57,816 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:39:57,817 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:39:57,818 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:39:57,819 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:39:57,820 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:39:57,823 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:39:57,824 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:39:57,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:39:57,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:39:57,827 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:39:57,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:39:57,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:39:57,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:39:57,831 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:39:57,831 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:39:57,832 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:39:57,833 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:39:57,833 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:39:57,834 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:39:57,835 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:39:57,836 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:39:57,836 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:39:57,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:39:57,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:39:57,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:39:57,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:39:57,839 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:39:57,840 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-27 03:39:57,854 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:39:57,855 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:39:57,856 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:39:57,856 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:39:57,856 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:39:57,857 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:39:57,857 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:39:57,857 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:39:57,857 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:39:57,857 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:39:57,858 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:39:57,858 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:39:57,858 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:39:57,858 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:39:57,858 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:39:57,859 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:39:57,859 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:39:57,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:39:57,859 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:39:57,859 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:39:57,860 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:39:57,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:39:57,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:39:57,860 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:39:57,861 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:39:57,861 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:39:57,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:39:57,861 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:39:57,861 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:39:58,181 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:39:58,204 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:39:58,209 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:39:58,211 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:39:58,211 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:39:58,212 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_power.oepc.i [2019-12-27 03:39:58,299 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d61ce83d7/5aadc1e54daa48a39e518211423a5422/FLAG61bf0a931 [2019-12-27 03:39:58,871 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:39:58,872 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_power.oepc.i [2019-12-27 03:39:58,897 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d61ce83d7/5aadc1e54daa48a39e518211423a5422/FLAG61bf0a931 [2019-12-27 03:39:59,162 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d61ce83d7/5aadc1e54daa48a39e518211423a5422 [2019-12-27 03:39:59,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:39:59,176 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:39:59,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:39:59,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:39:59,184 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:39:59,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:39:59" (1/1) ... [2019-12-27 03:39:59,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fdaac8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:59, skipping insertion in model container [2019-12-27 03:39:59,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:39:59" (1/1) ... [2019-12-27 03:39:59,197 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:39:59,264 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:39:59,776 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:39:59,788 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:39:59,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:39:59,949 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:39:59,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:59 WrapperNode [2019-12-27 03:39:59,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:39:59,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:39:59,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:39:59,951 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:39:59,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:59" (1/1) ... [2019-12-27 03:39:59,978 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:59" (1/1) ... [2019-12-27 03:40:00,011 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:40:00,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:40:00,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:40:00,011 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:40:00,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:59" (1/1) ... [2019-12-27 03:40:00,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:59" (1/1) ... [2019-12-27 03:40:00,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:59" (1/1) ... [2019-12-27 03:40:00,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:59" (1/1) ... [2019-12-27 03:40:00,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:59" (1/1) ... [2019-12-27 03:40:00,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:59" (1/1) ... [2019-12-27 03:40:00,070 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:59" (1/1) ... [2019-12-27 03:40:00,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:40:00,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:40:00,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:40:00,081 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:40:00,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:59" (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-27 03:40:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:40:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:40:00,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:40:00,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:40:00,137 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:40:00,138 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:40:00,139 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:40:00,139 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:40:00,140 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 03:40:00,140 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 03:40:00,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:40:00,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:40:00,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:40:00,145 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 03:40:00,830 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:40:00,830 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:40:00,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:40:00 BoogieIcfgContainer [2019-12-27 03:40:00,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:40:00,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:40:00,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:40:00,838 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:40:00,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:39:59" (1/3) ... [2019-12-27 03:40:00,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3910b228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:40:00, skipping insertion in model container [2019-12-27 03:40:00,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:59" (2/3) ... [2019-12-27 03:40:00,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3910b228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:40:00, skipping insertion in model container [2019-12-27 03:40:00,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:40:00" (3/3) ... [2019-12-27 03:40:00,843 INFO L109 eAbstractionObserver]: Analyzing ICFG safe013_power.oepc.i [2019-12-27 03:40:00,853 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:40:00,854 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:40:00,871 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:40:00,872 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:40:00,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,934 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,934 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,965 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,966 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,966 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,967 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,968 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,988 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:00,988 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,028 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,028 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,029 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,034 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,034 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,038 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,039 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:40:01,058 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 03:40:01,077 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:40:01,077 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:40:01,077 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:40:01,077 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:40:01,077 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:40:01,077 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:40:01,077 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:40:01,077 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:40:01,093 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-27 03:40:01,094 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 03:40:01,223 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 03:40:01,223 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:40:01,240 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 03:40:01,260 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 03:40:01,343 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 03:40:01,344 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:40:01,354 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 03:40:01,378 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 03:40:01,379 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:40:06,858 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 03:40:06,981 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 03:40:07,093 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66094 [2019-12-27 03:40:07,099 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 03:40:07,103 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-27 03:40:18,370 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-27 03:40:18,372 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-27 03:40:18,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 03:40:18,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:40:18,378 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 03:40:18,378 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:40:18,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:40:18,385 INFO L82 PathProgramCache]: Analyzing trace with hash 794637732, now seen corresponding path program 1 times [2019-12-27 03:40:18,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:40:18,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298449974] [2019-12-27 03:40:18,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:40:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:40:18,662 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-27 03:40:18,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298449974] [2019-12-27 03:40:18,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:40:18,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:40:18,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471238899] [2019-12-27 03:40:18,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:40:18,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:40:18,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:40:18,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:40:18,686 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-27 03:40:21,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:40:21,637 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-27 03:40:21,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:40:21,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 03:40:21,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:40:22,218 INFO L225 Difference]: With dead ends: 85012 [2019-12-27 03:40:22,219 INFO L226 Difference]: Without dead ends: 80140 [2019-12-27 03:40:22,220 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-27 03:40:25,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-27 03:40:29,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-27 03:40:29,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-27 03:40:29,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-27 03:40:29,744 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-27 03:40:29,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:40:29,745 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-27 03:40:29,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:40:29,745 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-27 03:40:29,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:40:29,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:40:29,758 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:40:29,758 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:40:29,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:40:29,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1795694344, now seen corresponding path program 1 times [2019-12-27 03:40:29,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:40:29,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894752440] [2019-12-27 03:40:29,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:40:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:40:29,884 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-27 03:40:29,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894752440] [2019-12-27 03:40:29,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:40:29,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:40:29,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142443873] [2019-12-27 03:40:29,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:40:29,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:40:29,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:40:29,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:40:29,888 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-27 03:40:33,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:40:33,584 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-27 03:40:33,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:40:33,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 03:40:33,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:40:34,169 INFO L225 Difference]: With dead ends: 123388 [2019-12-27 03:40:34,169 INFO L226 Difference]: Without dead ends: 123290 [2019-12-27 03:40:34,170 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-27 03:40:38,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-27 03:40:40,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-27 03:40:40,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-27 03:40:45,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-27 03:40:45,751 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-27 03:40:45,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:40:45,752 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-27 03:40:45,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:40:45,753 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-27 03:40:45,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:40:45,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:40:45,756 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:40:45,757 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:40:45,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:40:45,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1307118492, now seen corresponding path program 1 times [2019-12-27 03:40:45,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:40:45,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029390157] [2019-12-27 03:40:45,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:40:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:40:45,855 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-27 03:40:45,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029390157] [2019-12-27 03:40:45,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:40:45,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:40:45,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894409885] [2019-12-27 03:40:45,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:40:45,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:40:45,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:40:45,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:40:45,858 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-27 03:40:47,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:40:47,994 INFO L93 Difference]: Finished difference Result 159677 states and 652290 transitions. [2019-12-27 03:40:47,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:40:47,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 03:40:47,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:40:48,464 INFO L225 Difference]: With dead ends: 159677 [2019-12-27 03:40:48,465 INFO L226 Difference]: Without dead ends: 159565 [2019-12-27 03:40:48,465 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-27 03:40:57,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159565 states. [2019-12-27 03:41:00,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159565 to 136035. [2019-12-27 03:41:00,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136035 states. [2019-12-27 03:41:00,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136035 states to 136035 states and 564894 transitions. [2019-12-27 03:41:00,549 INFO L78 Accepts]: Start accepts. Automaton has 136035 states and 564894 transitions. Word has length 13 [2019-12-27 03:41:00,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:41:00,550 INFO L462 AbstractCegarLoop]: Abstraction has 136035 states and 564894 transitions. [2019-12-27 03:41:00,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:41:00,550 INFO L276 IsEmpty]: Start isEmpty. Operand 136035 states and 564894 transitions. [2019-12-27 03:41:00,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:41:00,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:41:00,553 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:41:00,554 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:41:00,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:41:00,554 INFO L82 PathProgramCache]: Analyzing trace with hash 2137171342, now seen corresponding path program 1 times [2019-12-27 03:41:00,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:41:00,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129873380] [2019-12-27 03:41:00,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:41:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:41:00,621 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-27 03:41:00,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129873380] [2019-12-27 03:41:00,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:41:00,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:41:00,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149600836] [2019-12-27 03:41:00,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:41:00,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:41:00,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:41:00,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:41:00,624 INFO L87 Difference]: Start difference. First operand 136035 states and 564894 transitions. Second operand 3 states. [2019-12-27 03:41:02,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:41:02,555 INFO L93 Difference]: Finished difference Result 181618 states and 742473 transitions. [2019-12-27 03:41:02,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:41:02,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 03:41:02,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:41:03,079 INFO L225 Difference]: With dead ends: 181618 [2019-12-27 03:41:03,080 INFO L226 Difference]: Without dead ends: 181618 [2019-12-27 03:41:03,080 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-27 03:41:14,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181618 states. [2019-12-27 03:41:17,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181618 to 152081. [2019-12-27 03:41:17,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152081 states. [2019-12-27 03:41:17,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152081 states to 152081 states and 628919 transitions. [2019-12-27 03:41:17,802 INFO L78 Accepts]: Start accepts. Automaton has 152081 states and 628919 transitions. Word has length 14 [2019-12-27 03:41:17,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:41:17,802 INFO L462 AbstractCegarLoop]: Abstraction has 152081 states and 628919 transitions. [2019-12-27 03:41:17,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:41:17,802 INFO L276 IsEmpty]: Start isEmpty. Operand 152081 states and 628919 transitions. [2019-12-27 03:41:17,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:41:17,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:41:17,806 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:41:17,806 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:41:17,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:41:17,806 INFO L82 PathProgramCache]: Analyzing trace with hash 2137037670, now seen corresponding path program 1 times [2019-12-27 03:41:17,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:41:17,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245702644] [2019-12-27 03:41:17,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:41:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:41:17,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-27 03:41:17,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245702644] [2019-12-27 03:41:17,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:41:17,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:41:17,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589066063] [2019-12-27 03:41:17,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:41:17,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:41:17,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:41:17,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:41:17,877 INFO L87 Difference]: Start difference. First operand 152081 states and 628919 transitions. Second operand 4 states. [2019-12-27 03:41:23,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:41:23,608 INFO L93 Difference]: Finished difference Result 179622 states and 732719 transitions. [2019-12-27 03:41:23,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:41:23,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 03:41:23,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:41:24,176 INFO L225 Difference]: With dead ends: 179622 [2019-12-27 03:41:24,176 INFO L226 Difference]: Without dead ends: 179542 [2019-12-27 03:41:24,177 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-27 03:41:32,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179542 states. [2019-12-27 03:41:34,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179542 to 157787. [2019-12-27 03:41:34,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157787 states. [2019-12-27 03:41:36,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157787 states to 157787 states and 651479 transitions. [2019-12-27 03:41:36,128 INFO L78 Accepts]: Start accepts. Automaton has 157787 states and 651479 transitions. Word has length 14 [2019-12-27 03:41:36,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:41:36,128 INFO L462 AbstractCegarLoop]: Abstraction has 157787 states and 651479 transitions. [2019-12-27 03:41:36,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:41:36,129 INFO L276 IsEmpty]: Start isEmpty. Operand 157787 states and 651479 transitions. [2019-12-27 03:41:36,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:41:36,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:41:36,132 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:41:36,133 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:41:36,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:41:36,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1997758702, now seen corresponding path program 1 times [2019-12-27 03:41:36,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:41:36,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829433667] [2019-12-27 03:41:36,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:41:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:41:36,182 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-27 03:41:36,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829433667] [2019-12-27 03:41:36,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:41:36,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:41:36,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351631889] [2019-12-27 03:41:36,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:41:36,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:41:36,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:41:36,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:41:36,185 INFO L87 Difference]: Start difference. First operand 157787 states and 651479 transitions. Second operand 4 states. [2019-12-27 03:41:43,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:41:43,285 INFO L93 Difference]: Finished difference Result 189091 states and 772001 transitions. [2019-12-27 03:41:43,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:41:43,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 03:41:43,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:41:43,865 INFO L225 Difference]: With dead ends: 189091 [2019-12-27 03:41:43,865 INFO L226 Difference]: Without dead ends: 188995 [2019-12-27 03:41:43,865 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-27 03:41:48,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188995 states. [2019-12-27 03:41:50,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188995 to 161868. [2019-12-27 03:41:50,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161868 states. [2019-12-27 03:41:51,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161868 states to 161868 states and 668265 transitions. [2019-12-27 03:41:51,497 INFO L78 Accepts]: Start accepts. Automaton has 161868 states and 668265 transitions. Word has length 14 [2019-12-27 03:41:51,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:41:51,497 INFO L462 AbstractCegarLoop]: Abstraction has 161868 states and 668265 transitions. [2019-12-27 03:41:51,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:41:51,498 INFO L276 IsEmpty]: Start isEmpty. Operand 161868 states and 668265 transitions. [2019-12-27 03:41:51,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 03:41:51,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:41:51,515 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:41:51,515 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:41:51,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:41:51,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1754746770, now seen corresponding path program 1 times [2019-12-27 03:41:51,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:41:51,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322420965] [2019-12-27 03:41:51,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:41:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:41:52,577 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-27 03:41:52,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322420965] [2019-12-27 03:41:52,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:41:52,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:41:52,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993132864] [2019-12-27 03:41:52,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:41:52,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:41:52,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:41:52,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:41:52,579 INFO L87 Difference]: Start difference. First operand 161868 states and 668265 transitions. Second operand 3 states. [2019-12-27 03:41:53,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:41:53,357 INFO L93 Difference]: Finished difference Result 160940 states and 664422 transitions. [2019-12-27 03:41:53,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:41:53,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 03:41:53,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:41:53,808 INFO L225 Difference]: With dead ends: 160940 [2019-12-27 03:41:53,808 INFO L226 Difference]: Without dead ends: 160940 [2019-12-27 03:41:53,809 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-27 03:42:04,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160940 states. [2019-12-27 03:42:06,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160940 to 160940. [2019-12-27 03:42:06,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160940 states. [2019-12-27 03:42:07,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160940 states to 160940 states and 664422 transitions. [2019-12-27 03:42:07,616 INFO L78 Accepts]: Start accepts. Automaton has 160940 states and 664422 transitions. Word has length 18 [2019-12-27 03:42:07,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:07,617 INFO L462 AbstractCegarLoop]: Abstraction has 160940 states and 664422 transitions. [2019-12-27 03:42:07,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:42:07,617 INFO L276 IsEmpty]: Start isEmpty. Operand 160940 states and 664422 transitions. [2019-12-27 03:42:07,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 03:42:07,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:07,639 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:42:07,639 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:07,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:07,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1406595818, now seen corresponding path program 1 times [2019-12-27 03:42:07,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:07,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117541457] [2019-12-27 03:42:07,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:07,738 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-27 03:42:07,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117541457] [2019-12-27 03:42:07,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:07,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:42:07,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950149297] [2019-12-27 03:42:07,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:42:07,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:07,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:42:07,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:42:07,740 INFO L87 Difference]: Start difference. First operand 160940 states and 664422 transitions. Second operand 4 states. [2019-12-27 03:42:14,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:14,711 INFO L93 Difference]: Finished difference Result 255238 states and 1058186 transitions. [2019-12-27 03:42:14,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:42:14,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-27 03:42:14,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:15,123 INFO L225 Difference]: With dead ends: 255238 [2019-12-27 03:42:15,123 INFO L226 Difference]: Without dead ends: 128270 [2019-12-27 03:42:15,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:42:19,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128270 states. [2019-12-27 03:42:21,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128270 to 128270. [2019-12-27 03:42:21,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128270 states. [2019-12-27 03:42:22,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128270 states to 128270 states and 523459 transitions. [2019-12-27 03:42:22,281 INFO L78 Accepts]: Start accepts. Automaton has 128270 states and 523459 transitions. Word has length 19 [2019-12-27 03:42:22,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:22,281 INFO L462 AbstractCegarLoop]: Abstraction has 128270 states and 523459 transitions. [2019-12-27 03:42:22,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:42:22,282 INFO L276 IsEmpty]: Start isEmpty. Operand 128270 states and 523459 transitions. [2019-12-27 03:42:22,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 03:42:22,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:22,295 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:42:22,295 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:22,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:22,295 INFO L82 PathProgramCache]: Analyzing trace with hash -2069277611, now seen corresponding path program 1 times [2019-12-27 03:42:22,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:22,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403327522] [2019-12-27 03:42:22,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:22,374 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-27 03:42:22,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403327522] [2019-12-27 03:42:22,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:22,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:42:22,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505998731] [2019-12-27 03:42:22,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:42:22,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:22,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:42:22,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:42:22,377 INFO L87 Difference]: Start difference. First operand 128270 states and 523459 transitions. Second operand 4 states. [2019-12-27 03:42:22,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:22,594 INFO L93 Difference]: Finished difference Result 36423 states and 125388 transitions. [2019-12-27 03:42:22,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:42:22,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-27 03:42:22,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:22,668 INFO L225 Difference]: With dead ends: 36423 [2019-12-27 03:42:22,669 INFO L226 Difference]: Without dead ends: 28545 [2019-12-27 03:42:22,669 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-27 03:42:22,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28545 states. [2019-12-27 03:42:24,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28545 to 28545. [2019-12-27 03:42:24,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28545 states. [2019-12-27 03:42:24,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28545 states to 28545 states and 94430 transitions. [2019-12-27 03:42:24,344 INFO L78 Accepts]: Start accepts. Automaton has 28545 states and 94430 transitions. Word has length 19 [2019-12-27 03:42:24,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:24,345 INFO L462 AbstractCegarLoop]: Abstraction has 28545 states and 94430 transitions. [2019-12-27 03:42:24,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:42:24,345 INFO L276 IsEmpty]: Start isEmpty. Operand 28545 states and 94430 transitions. [2019-12-27 03:42:24,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 03:42:24,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:24,350 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-27 03:42:24,350 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:24,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:24,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1918737222, now seen corresponding path program 1 times [2019-12-27 03:42:24,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:24,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850548466] [2019-12-27 03:42:24,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:24,421 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-27 03:42:24,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850548466] [2019-12-27 03:42:24,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:24,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:42:24,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928875817] [2019-12-27 03:42:24,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:42:24,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:24,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:42:24,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:42:24,423 INFO L87 Difference]: Start difference. First operand 28545 states and 94430 transitions. Second operand 5 states. [2019-12-27 03:42:24,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:24,812 INFO L93 Difference]: Finished difference Result 37265 states and 121195 transitions. [2019-12-27 03:42:24,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 03:42:24,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 03:42:24,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:24,871 INFO L225 Difference]: With dead ends: 37265 [2019-12-27 03:42:24,872 INFO L226 Difference]: Without dead ends: 36963 [2019-12-27 03:42:24,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:42:25,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36963 states. [2019-12-27 03:42:25,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36963 to 29525. [2019-12-27 03:42:25,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29525 states. [2019-12-27 03:42:25,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29525 states to 29525 states and 97651 transitions. [2019-12-27 03:42:25,423 INFO L78 Accepts]: Start accepts. Automaton has 29525 states and 97651 transitions. Word has length 22 [2019-12-27 03:42:25,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:25,424 INFO L462 AbstractCegarLoop]: Abstraction has 29525 states and 97651 transitions. [2019-12-27 03:42:25,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:42:25,424 INFO L276 IsEmpty]: Start isEmpty. Operand 29525 states and 97651 transitions. [2019-12-27 03:42:25,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 03:42:25,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:25,430 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-27 03:42:25,430 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:25,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:25,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1233781658, now seen corresponding path program 1 times [2019-12-27 03:42:25,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:25,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769004286] [2019-12-27 03:42:25,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:25,493 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-27 03:42:25,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769004286] [2019-12-27 03:42:25,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:25,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:42:25,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587028267] [2019-12-27 03:42:25,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:42:25,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:25,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:42:25,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:42:25,496 INFO L87 Difference]: Start difference. First operand 29525 states and 97651 transitions. Second operand 5 states. [2019-12-27 03:42:25,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:25,944 INFO L93 Difference]: Finished difference Result 37362 states and 121787 transitions. [2019-12-27 03:42:25,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 03:42:25,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 03:42:25,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:26,008 INFO L225 Difference]: With dead ends: 37362 [2019-12-27 03:42:26,009 INFO L226 Difference]: Without dead ends: 36942 [2019-12-27 03:42:26,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:42:26,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36942 states. [2019-12-27 03:42:27,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36942 to 28461. [2019-12-27 03:42:27,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28461 states. [2019-12-27 03:42:27,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28461 states to 28461 states and 94342 transitions. [2019-12-27 03:42:27,135 INFO L78 Accepts]: Start accepts. Automaton has 28461 states and 94342 transitions. Word has length 22 [2019-12-27 03:42:27,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:27,135 INFO L462 AbstractCegarLoop]: Abstraction has 28461 states and 94342 transitions. [2019-12-27 03:42:27,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:42:27,135 INFO L276 IsEmpty]: Start isEmpty. Operand 28461 states and 94342 transitions. [2019-12-27 03:42:27,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:42:27,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:27,143 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-27 03:42:27,143 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:27,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:27,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1628067424, now seen corresponding path program 1 times [2019-12-27 03:42:27,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:27,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693562738] [2019-12-27 03:42:27,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:27,217 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-27 03:42:27,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693562738] [2019-12-27 03:42:27,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:27,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:42:27,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568269467] [2019-12-27 03:42:27,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:42:27,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:27,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:42:27,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:42:27,219 INFO L87 Difference]: Start difference. First operand 28461 states and 94342 transitions. Second operand 5 states. [2019-12-27 03:42:27,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:27,595 INFO L93 Difference]: Finished difference Result 28874 states and 95112 transitions. [2019-12-27 03:42:27,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:42:27,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 03:42:27,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:27,680 INFO L225 Difference]: With dead ends: 28874 [2019-12-27 03:42:27,680 INFO L226 Difference]: Without dead ends: 28434 [2019-12-27 03:42:27,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:42:27,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28434 states. [2019-12-27 03:42:28,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28434 to 28291. [2019-12-27 03:42:28,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28291 states. [2019-12-27 03:42:28,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28291 states to 28291 states and 93821 transitions. [2019-12-27 03:42:28,374 INFO L78 Accepts]: Start accepts. Automaton has 28291 states and 93821 transitions. Word has length 25 [2019-12-27 03:42:28,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:28,375 INFO L462 AbstractCegarLoop]: Abstraction has 28291 states and 93821 transitions. [2019-12-27 03:42:28,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:42:28,375 INFO L276 IsEmpty]: Start isEmpty. Operand 28291 states and 93821 transitions. [2019-12-27 03:42:28,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 03:42:28,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:28,388 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] [2019-12-27 03:42:28,388 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:28,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:28,389 INFO L82 PathProgramCache]: Analyzing trace with hash -126544367, now seen corresponding path program 1 times [2019-12-27 03:42:28,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:28,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853973867] [2019-12-27 03:42:28,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:28,443 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-27 03:42:28,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853973867] [2019-12-27 03:42:28,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:28,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:42:28,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527574094] [2019-12-27 03:42:28,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:42:28,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:28,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:42:28,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:42:28,445 INFO L87 Difference]: Start difference. First operand 28291 states and 93821 transitions. Second operand 5 states. [2019-12-27 03:42:28,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:28,821 INFO L93 Difference]: Finished difference Result 37145 states and 121294 transitions. [2019-12-27 03:42:28,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:42:28,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 03:42:28,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:29,154 INFO L225 Difference]: With dead ends: 37145 [2019-12-27 03:42:29,154 INFO L226 Difference]: Without dead ends: 36771 [2019-12-27 03:42:29,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:42:29,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36771 states. [2019-12-27 03:42:29,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36771 to 29755. [2019-12-27 03:42:29,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29755 states. [2019-12-27 03:42:29,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29755 states to 29755 states and 98514 transitions. [2019-12-27 03:42:29,713 INFO L78 Accepts]: Start accepts. Automaton has 29755 states and 98514 transitions. Word has length 28 [2019-12-27 03:42:29,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:29,714 INFO L462 AbstractCegarLoop]: Abstraction has 29755 states and 98514 transitions. [2019-12-27 03:42:29,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:42:29,714 INFO L276 IsEmpty]: Start isEmpty. Operand 29755 states and 98514 transitions. [2019-12-27 03:42:29,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 03:42:29,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:29,727 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] [2019-12-27 03:42:29,727 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:29,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:29,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1319845053, now seen corresponding path program 1 times [2019-12-27 03:42:29,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:29,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991868624] [2019-12-27 03:42:29,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:29,772 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-27 03:42:29,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991868624] [2019-12-27 03:42:29,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:29,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:42:29,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124362931] [2019-12-27 03:42:29,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:42:29,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:29,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:42:29,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:42:29,774 INFO L87 Difference]: Start difference. First operand 29755 states and 98514 transitions. Second operand 3 states. [2019-12-27 03:42:29,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:29,948 INFO L93 Difference]: Finished difference Result 38320 states and 126138 transitions. [2019-12-27 03:42:29,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:42:29,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-27 03:42:29,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:30,009 INFO L225 Difference]: With dead ends: 38320 [2019-12-27 03:42:30,009 INFO L226 Difference]: Without dead ends: 38320 [2019-12-27 03:42:30,010 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-27 03:42:30,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38320 states. [2019-12-27 03:42:30,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38320 to 30661. [2019-12-27 03:42:30,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30661 states. [2019-12-27 03:42:30,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30661 states to 30661 states and 100227 transitions. [2019-12-27 03:42:30,945 INFO L78 Accepts]: Start accepts. Automaton has 30661 states and 100227 transitions. Word has length 28 [2019-12-27 03:42:30,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:30,946 INFO L462 AbstractCegarLoop]: Abstraction has 30661 states and 100227 transitions. [2019-12-27 03:42:30,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:42:30,946 INFO L276 IsEmpty]: Start isEmpty. Operand 30661 states and 100227 transitions. [2019-12-27 03:42:30,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 03:42:30,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:30,961 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] [2019-12-27 03:42:30,961 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:30,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:30,962 INFO L82 PathProgramCache]: Analyzing trace with hash 234862090, now seen corresponding path program 1 times [2019-12-27 03:42:30,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:30,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785899023] [2019-12-27 03:42:30,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:31,036 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-27 03:42:31,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785899023] [2019-12-27 03:42:31,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:31,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:42:31,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221107747] [2019-12-27 03:42:31,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:42:31,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:31,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:42:31,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:42:31,038 INFO L87 Difference]: Start difference. First operand 30661 states and 100227 transitions. Second operand 5 states. [2019-12-27 03:42:31,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:31,403 INFO L93 Difference]: Finished difference Result 39205 states and 126499 transitions. [2019-12-27 03:42:31,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:42:31,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 03:42:31,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:31,463 INFO L225 Difference]: With dead ends: 39205 [2019-12-27 03:42:31,464 INFO L226 Difference]: Without dead ends: 38811 [2019-12-27 03:42:31,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:42:31,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38811 states. [2019-12-27 03:42:31,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38811 to 30894. [2019-12-27 03:42:31,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30894 states. [2019-12-27 03:42:32,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30894 states to 30894 states and 100767 transitions. [2019-12-27 03:42:32,059 INFO L78 Accepts]: Start accepts. Automaton has 30894 states and 100767 transitions. Word has length 29 [2019-12-27 03:42:32,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:32,060 INFO L462 AbstractCegarLoop]: Abstraction has 30894 states and 100767 transitions. [2019-12-27 03:42:32,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:42:32,060 INFO L276 IsEmpty]: Start isEmpty. Operand 30894 states and 100767 transitions. [2019-12-27 03:42:32,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 03:42:32,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:32,073 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] [2019-12-27 03:42:32,074 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:32,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:32,074 INFO L82 PathProgramCache]: Analyzing trace with hash 805904020, now seen corresponding path program 1 times [2019-12-27 03:42:32,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:32,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627934636] [2019-12-27 03:42:32,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:32,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:32,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627934636] [2019-12-27 03:42:32,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:32,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:42:32,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781673851] [2019-12-27 03:42:32,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:42:32,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:32,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:42:32,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:42:32,119 INFO L87 Difference]: Start difference. First operand 30894 states and 100767 transitions. Second operand 3 states. [2019-12-27 03:42:32,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:32,313 INFO L93 Difference]: Finished difference Result 49254 states and 162311 transitions. [2019-12-27 03:42:32,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:42:32,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-27 03:42:32,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:32,349 INFO L225 Difference]: With dead ends: 49254 [2019-12-27 03:42:32,349 INFO L226 Difference]: Without dead ends: 21429 [2019-12-27 03:42:32,350 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-27 03:42:32,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21429 states. [2019-12-27 03:42:32,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21429 to 20333. [2019-12-27 03:42:32,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20333 states. [2019-12-27 03:42:32,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20333 states to 20333 states and 67715 transitions. [2019-12-27 03:42:32,995 INFO L78 Accepts]: Start accepts. Automaton has 20333 states and 67715 transitions. Word has length 29 [2019-12-27 03:42:32,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:32,996 INFO L462 AbstractCegarLoop]: Abstraction has 20333 states and 67715 transitions. [2019-12-27 03:42:32,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:42:32,996 INFO L276 IsEmpty]: Start isEmpty. Operand 20333 states and 67715 transitions. [2019-12-27 03:42:33,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 03:42:33,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:33,005 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] [2019-12-27 03:42:33,005 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:33,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:33,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1673459084, now seen corresponding path program 1 times [2019-12-27 03:42:33,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:33,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118727869] [2019-12-27 03:42:33,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:33,103 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-27 03:42:33,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118727869] [2019-12-27 03:42:33,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:33,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:42:33,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436151362] [2019-12-27 03:42:33,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:42:33,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:33,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:42:33,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:42:33,105 INFO L87 Difference]: Start difference. First operand 20333 states and 67715 transitions. Second operand 5 states. [2019-12-27 03:42:33,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:33,874 INFO L93 Difference]: Finished difference Result 34767 states and 112990 transitions. [2019-12-27 03:42:33,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:42:33,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 03:42:33,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:33,971 INFO L225 Difference]: With dead ends: 34767 [2019-12-27 03:42:33,972 INFO L226 Difference]: Without dead ends: 34767 [2019-12-27 03:42:33,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-27 03:42:34,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34767 states. [2019-12-27 03:42:34,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34767 to 29090. [2019-12-27 03:42:34,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29090 states. [2019-12-27 03:42:34,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29090 states to 29090 states and 95089 transitions. [2019-12-27 03:42:34,580 INFO L78 Accepts]: Start accepts. Automaton has 29090 states and 95089 transitions. Word has length 30 [2019-12-27 03:42:34,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:34,580 INFO L462 AbstractCegarLoop]: Abstraction has 29090 states and 95089 transitions. [2019-12-27 03:42:34,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:42:34,580 INFO L276 IsEmpty]: Start isEmpty. Operand 29090 states and 95089 transitions. [2019-12-27 03:42:34,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 03:42:34,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:34,593 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:42:34,593 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:34,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:34,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1413309470, now seen corresponding path program 1 times [2019-12-27 03:42:34,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:34,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586460539] [2019-12-27 03:42:34,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:34,653 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-27 03:42:34,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586460539] [2019-12-27 03:42:34,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:34,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:42:34,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250469348] [2019-12-27 03:42:34,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:42:34,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:34,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:42:34,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:42:34,655 INFO L87 Difference]: Start difference. First operand 29090 states and 95089 transitions. Second operand 5 states. [2019-12-27 03:42:34,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:34,756 INFO L93 Difference]: Finished difference Result 13178 states and 39760 transitions. [2019-12-27 03:42:34,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:42:34,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-27 03:42:34,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:34,776 INFO L225 Difference]: With dead ends: 13178 [2019-12-27 03:42:34,777 INFO L226 Difference]: Without dead ends: 11110 [2019-12-27 03:42:34,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:42:34,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11110 states. [2019-12-27 03:42:34,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11110 to 10943. [2019-12-27 03:42:34,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10943 states. [2019-12-27 03:42:34,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10943 states to 10943 states and 32777 transitions. [2019-12-27 03:42:34,948 INFO L78 Accepts]: Start accepts. Automaton has 10943 states and 32777 transitions. Word has length 31 [2019-12-27 03:42:34,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:34,948 INFO L462 AbstractCegarLoop]: Abstraction has 10943 states and 32777 transitions. [2019-12-27 03:42:34,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:42:34,949 INFO L276 IsEmpty]: Start isEmpty. Operand 10943 states and 32777 transitions. [2019-12-27 03:42:34,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 03:42:34,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:34,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:42:34,960 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:34,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:34,960 INFO L82 PathProgramCache]: Analyzing trace with hash 483024013, now seen corresponding path program 1 times [2019-12-27 03:42:34,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:34,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46408000] [2019-12-27 03:42:34,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:35,059 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-27 03:42:35,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46408000] [2019-12-27 03:42:35,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:35,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:42:35,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739850122] [2019-12-27 03:42:35,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:42:35,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:35,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:42:35,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:42:35,062 INFO L87 Difference]: Start difference. First operand 10943 states and 32777 transitions. Second operand 6 states. [2019-12-27 03:42:35,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:35,375 INFO L93 Difference]: Finished difference Result 11069 states and 33011 transitions. [2019-12-27 03:42:35,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:42:35,375 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 03:42:35,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:35,393 INFO L225 Difference]: With dead ends: 11069 [2019-12-27 03:42:35,394 INFO L226 Difference]: Without dead ends: 10842 [2019-12-27 03:42:35,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:42:35,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10842 states. [2019-12-27 03:42:35,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10842 to 10842. [2019-12-27 03:42:35,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10842 states. [2019-12-27 03:42:35,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10842 states to 10842 states and 32566 transitions. [2019-12-27 03:42:35,579 INFO L78 Accepts]: Start accepts. Automaton has 10842 states and 32566 transitions. Word has length 40 [2019-12-27 03:42:35,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:35,579 INFO L462 AbstractCegarLoop]: Abstraction has 10842 states and 32566 transitions. [2019-12-27 03:42:35,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:42:35,579 INFO L276 IsEmpty]: Start isEmpty. Operand 10842 states and 32566 transitions. [2019-12-27 03:42:35,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 03:42:35,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:35,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:42:35,593 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:35,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:35,593 INFO L82 PathProgramCache]: Analyzing trace with hash -891252526, now seen corresponding path program 1 times [2019-12-27 03:42:35,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:35,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547550683] [2019-12-27 03:42:35,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:35,663 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-27 03:42:35,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547550683] [2019-12-27 03:42:35,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:35,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:42:35,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44771887] [2019-12-27 03:42:35,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:42:35,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:35,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:42:35,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:42:35,666 INFO L87 Difference]: Start difference. First operand 10842 states and 32566 transitions. Second operand 6 states. [2019-12-27 03:42:36,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:36,298 INFO L93 Difference]: Finished difference Result 20964 states and 62804 transitions. [2019-12-27 03:42:36,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:42:36,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 03:42:36,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:36,326 INFO L225 Difference]: With dead ends: 20964 [2019-12-27 03:42:36,327 INFO L226 Difference]: Without dead ends: 20964 [2019-12-27 03:42:36,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:42:36,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20964 states. [2019-12-27 03:42:36,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20964 to 13761. [2019-12-27 03:42:36,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13761 states. [2019-12-27 03:42:36,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13761 states to 13761 states and 41473 transitions. [2019-12-27 03:42:36,571 INFO L78 Accepts]: Start accepts. Automaton has 13761 states and 41473 transitions. Word has length 40 [2019-12-27 03:42:36,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:36,571 INFO L462 AbstractCegarLoop]: Abstraction has 13761 states and 41473 transitions. [2019-12-27 03:42:36,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:42:36,572 INFO L276 IsEmpty]: Start isEmpty. Operand 13761 states and 41473 transitions. [2019-12-27 03:42:36,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 03:42:36,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:36,590 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:42:36,591 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:36,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:36,591 INFO L82 PathProgramCache]: Analyzing trace with hash 820794198, now seen corresponding path program 2 times [2019-12-27 03:42:36,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:36,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926019223] [2019-12-27 03:42:36,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:36,639 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-27 03:42:36,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926019223] [2019-12-27 03:42:36,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:36,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:42:36,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640115109] [2019-12-27 03:42:36,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:42:36,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:36,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:42:36,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:42:36,641 INFO L87 Difference]: Start difference. First operand 13761 states and 41473 transitions. Second operand 3 states. [2019-12-27 03:42:36,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:36,685 INFO L93 Difference]: Finished difference Result 10124 states and 29791 transitions. [2019-12-27 03:42:36,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:42:36,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 03:42:36,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:36,702 INFO L225 Difference]: With dead ends: 10124 [2019-12-27 03:42:36,702 INFO L226 Difference]: Without dead ends: 10124 [2019-12-27 03:42:36,702 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-27 03:42:36,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10124 states. [2019-12-27 03:42:36,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10124 to 10086. [2019-12-27 03:42:36,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10086 states. [2019-12-27 03:42:36,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10086 states to 10086 states and 29686 transitions. [2019-12-27 03:42:36,867 INFO L78 Accepts]: Start accepts. Automaton has 10086 states and 29686 transitions. Word has length 40 [2019-12-27 03:42:36,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:36,868 INFO L462 AbstractCegarLoop]: Abstraction has 10086 states and 29686 transitions. [2019-12-27 03:42:36,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:42:36,868 INFO L276 IsEmpty]: Start isEmpty. Operand 10086 states and 29686 transitions. [2019-12-27 03:42:36,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 03:42:36,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:36,878 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] [2019-12-27 03:42:36,878 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:36,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:36,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1848652026, now seen corresponding path program 1 times [2019-12-27 03:42:36,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:36,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931577858] [2019-12-27 03:42:36,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:36,944 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-27 03:42:36,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931577858] [2019-12-27 03:42:36,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:36,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:42:36,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457178064] [2019-12-27 03:42:36,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:42:36,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:36,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:42:36,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:42:36,946 INFO L87 Difference]: Start difference. First operand 10086 states and 29686 transitions. Second operand 6 states. [2019-12-27 03:42:37,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:37,180 INFO L93 Difference]: Finished difference Result 10072 states and 29653 transitions. [2019-12-27 03:42:37,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:42:37,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 03:42:37,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:37,199 INFO L225 Difference]: With dead ends: 10072 [2019-12-27 03:42:37,200 INFO L226 Difference]: Without dead ends: 9731 [2019-12-27 03:42:37,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:42:37,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9731 states. [2019-12-27 03:42:37,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9731 to 9731. [2019-12-27 03:42:37,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9731 states. [2019-12-27 03:42:37,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9731 states to 9731 states and 28998 transitions. [2019-12-27 03:42:37,376 INFO L78 Accepts]: Start accepts. Automaton has 9731 states and 28998 transitions. Word has length 41 [2019-12-27 03:42:37,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:37,376 INFO L462 AbstractCegarLoop]: Abstraction has 9731 states and 28998 transitions. [2019-12-27 03:42:37,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:42:37,376 INFO L276 IsEmpty]: Start isEmpty. Operand 9731 states and 28998 transitions. [2019-12-27 03:42:37,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 03:42:37,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:37,386 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] [2019-12-27 03:42:37,386 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:37,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:37,386 INFO L82 PathProgramCache]: Analyzing trace with hash -55018944, now seen corresponding path program 1 times [2019-12-27 03:42:37,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:37,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118291446] [2019-12-27 03:42:37,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:37,454 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-27 03:42:37,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118291446] [2019-12-27 03:42:37,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:37,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:42:37,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170874816] [2019-12-27 03:42:37,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:42:37,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:37,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:42:37,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:42:37,456 INFO L87 Difference]: Start difference. First operand 9731 states and 28998 transitions. Second operand 6 states. [2019-12-27 03:42:38,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:38,187 INFO L93 Difference]: Finished difference Result 12715 states and 37116 transitions. [2019-12-27 03:42:38,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 03:42:38,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 03:42:38,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:38,202 INFO L225 Difference]: With dead ends: 12715 [2019-12-27 03:42:38,202 INFO L226 Difference]: Without dead ends: 12715 [2019-12-27 03:42:38,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:42:38,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12715 states. [2019-12-27 03:42:38,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12715 to 10179. [2019-12-27 03:42:38,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10179 states. [2019-12-27 03:42:38,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10179 states to 10179 states and 30296 transitions. [2019-12-27 03:42:38,352 INFO L78 Accepts]: Start accepts. Automaton has 10179 states and 30296 transitions. Word has length 41 [2019-12-27 03:42:38,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:38,352 INFO L462 AbstractCegarLoop]: Abstraction has 10179 states and 30296 transitions. [2019-12-27 03:42:38,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:42:38,352 INFO L276 IsEmpty]: Start isEmpty. Operand 10179 states and 30296 transitions. [2019-12-27 03:42:38,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 03:42:38,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:38,362 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] [2019-12-27 03:42:38,362 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:38,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:38,363 INFO L82 PathProgramCache]: Analyzing trace with hash -154907136, now seen corresponding path program 2 times [2019-12-27 03:42:38,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:38,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415693555] [2019-12-27 03:42:38,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:38,446 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-27 03:42:38,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415693555] [2019-12-27 03:42:38,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:38,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:42:38,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741126843] [2019-12-27 03:42:38,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:42:38,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:38,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:42:38,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:42:38,448 INFO L87 Difference]: Start difference. First operand 10179 states and 30296 transitions. Second operand 6 states. [2019-12-27 03:42:38,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:38,552 INFO L93 Difference]: Finished difference Result 9188 states and 27748 transitions. [2019-12-27 03:42:38,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:42:38,553 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 03:42:38,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:38,569 INFO L225 Difference]: With dead ends: 9188 [2019-12-27 03:42:38,569 INFO L226 Difference]: Without dead ends: 9032 [2019-12-27 03:42:38,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:42:38,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9032 states. [2019-12-27 03:42:38,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9032 to 8630. [2019-12-27 03:42:38,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8630 states. [2019-12-27 03:42:38,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8630 states to 8630 states and 26283 transitions. [2019-12-27 03:42:38,821 INFO L78 Accepts]: Start accepts. Automaton has 8630 states and 26283 transitions. Word has length 41 [2019-12-27 03:42:38,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:38,821 INFO L462 AbstractCegarLoop]: Abstraction has 8630 states and 26283 transitions. [2019-12-27 03:42:38,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:42:38,822 INFO L276 IsEmpty]: Start isEmpty. Operand 8630 states and 26283 transitions. [2019-12-27 03:42:38,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:42:38,838 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:38,839 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-27 03:42:38,839 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:38,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:38,840 INFO L82 PathProgramCache]: Analyzing trace with hash 2029475721, now seen corresponding path program 1 times [2019-12-27 03:42:38,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:38,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78780457] [2019-12-27 03:42:38,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:39,640 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-27 03:42:39,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78780457] [2019-12-27 03:42:39,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:39,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 03:42:39,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162914094] [2019-12-27 03:42:39,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 03:42:39,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:39,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 03:42:39,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-12-27 03:42:39,642 INFO L87 Difference]: Start difference. First operand 8630 states and 26283 transitions. Second operand 15 states. [2019-12-27 03:42:46,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:46,194 INFO L93 Difference]: Finished difference Result 26690 states and 80538 transitions. [2019-12-27 03:42:46,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 03:42:46,194 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-27 03:42:46,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:46,212 INFO L225 Difference]: With dead ends: 26690 [2019-12-27 03:42:46,213 INFO L226 Difference]: Without dead ends: 12960 [2019-12-27 03:42:46,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=551, Invalid=2989, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 03:42:46,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12960 states. [2019-12-27 03:42:46,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12960 to 10827. [2019-12-27 03:42:46,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10827 states. [2019-12-27 03:42:46,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10827 states to 10827 states and 31964 transitions. [2019-12-27 03:42:46,378 INFO L78 Accepts]: Start accepts. Automaton has 10827 states and 31964 transitions. Word has length 55 [2019-12-27 03:42:46,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:46,378 INFO L462 AbstractCegarLoop]: Abstraction has 10827 states and 31964 transitions. [2019-12-27 03:42:46,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 03:42:46,378 INFO L276 IsEmpty]: Start isEmpty. Operand 10827 states and 31964 transitions. [2019-12-27 03:42:46,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:42:46,389 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:46,389 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-27 03:42:46,389 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:46,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:46,390 INFO L82 PathProgramCache]: Analyzing trace with hash 469516855, now seen corresponding path program 2 times [2019-12-27 03:42:46,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:46,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445011425] [2019-12-27 03:42:46,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:46,605 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-27 03:42:46,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445011425] [2019-12-27 03:42:46,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:46,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:42:46,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276553000] [2019-12-27 03:42:46,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:42:46,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:46,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:42:46,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:42:46,608 INFO L87 Difference]: Start difference. First operand 10827 states and 31964 transitions. Second operand 11 states. [2019-12-27 03:42:47,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:47,579 INFO L93 Difference]: Finished difference Result 16996 states and 49780 transitions. [2019-12-27 03:42:47,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 03:42:47,580 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-27 03:42:47,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:47,600 INFO L225 Difference]: With dead ends: 16996 [2019-12-27 03:42:47,600 INFO L226 Difference]: Without dead ends: 11102 [2019-12-27 03:42:47,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2019-12-27 03:42:47,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11102 states. [2019-12-27 03:42:47,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11102 to 9960. [2019-12-27 03:42:47,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9960 states. [2019-12-27 03:42:47,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9960 states to 9960 states and 29569 transitions. [2019-12-27 03:42:47,852 INFO L78 Accepts]: Start accepts. Automaton has 9960 states and 29569 transitions. Word has length 55 [2019-12-27 03:42:47,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:47,853 INFO L462 AbstractCegarLoop]: Abstraction has 9960 states and 29569 transitions. [2019-12-27 03:42:47,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:42:47,853 INFO L276 IsEmpty]: Start isEmpty. Operand 9960 states and 29569 transitions. [2019-12-27 03:42:47,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:42:47,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:47,872 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-27 03:42:47,872 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:47,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:47,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1800572017, now seen corresponding path program 3 times [2019-12-27 03:42:47,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:47,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076573978] [2019-12-27 03:42:47,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:47,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-27 03:42:47,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076573978] [2019-12-27 03:42:47,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:47,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:42:47,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236766575] [2019-12-27 03:42:47,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:42:47,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:47,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:42:47,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:42:47,955 INFO L87 Difference]: Start difference. First operand 9960 states and 29569 transitions. Second operand 3 states. [2019-12-27 03:42:48,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:48,013 INFO L93 Difference]: Finished difference Result 9958 states and 29564 transitions. [2019-12-27 03:42:48,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:42:48,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 03:42:48,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:48,033 INFO L225 Difference]: With dead ends: 9958 [2019-12-27 03:42:48,033 INFO L226 Difference]: Without dead ends: 9958 [2019-12-27 03:42:48,034 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-27 03:42:48,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9958 states. [2019-12-27 03:42:48,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9958 to 8576. [2019-12-27 03:42:48,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8576 states. [2019-12-27 03:42:48,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8576 states to 8576 states and 25739 transitions. [2019-12-27 03:42:48,245 INFO L78 Accepts]: Start accepts. Automaton has 8576 states and 25739 transitions. Word has length 55 [2019-12-27 03:42:48,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:48,245 INFO L462 AbstractCegarLoop]: Abstraction has 8576 states and 25739 transitions. [2019-12-27 03:42:48,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:42:48,245 INFO L276 IsEmpty]: Start isEmpty. Operand 8576 states and 25739 transitions. [2019-12-27 03:42:48,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 03:42:48,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:48,257 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 03:42:48,257 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:48,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:48,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1734091201, now seen corresponding path program 1 times [2019-12-27 03:42:48,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:48,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6338875] [2019-12-27 03:42:48,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:42:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:42:48,400 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:42:48,400 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:42:48,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_cnt~0_95) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2073~0.base_30|) (= 0 v_~x~0_240) (= v_~x$r_buff1_thd0~0_309 0) (= v_~weak$$choice2~0_201 0) (= 0 v_~x$w_buff1_used~0_624) (= 0 v_~x$r_buff1_thd2~0_264) (= v_~y~0_226 0) (= v_~z~0_95 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$r_buff0_thd3~0_148) (= 0 v_~x$w_buff1~0_328) (= 0 v_~x$r_buff0_thd2~0_323) (= v_~x$flush_delayed~0_62 0) (= 0 v_~x$w_buff0_used~0_913) (= 0 |v_#NULL.base_4|) (= 0 v_~x$read_delayed~0_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t2073~0.base_30|) 0) (= v_~x$r_buff0_thd1~0_362 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2073~0.base_30| 4)) (= 0 v_~weak$$choice0~0_37) (= v_~main$tmp_guard1~0_53 0) (= v_~main$tmp_guard0~0_42 0) (= 0 v_~__unbuffered_p0_EAX~0_85) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2073~0.base_30| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2073~0.base_30|) |v_ULTIMATE.start_main_~#t2073~0.offset_22| 0))) (= 0 v_~__unbuffered_p2_EAX~0_68) (= |v_#NULL.offset_4| 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff1_thd3~0_267) (= v_~x$mem_tmp~0_40 0) (= v_~x$r_buff1_thd1~0_428 0) (= 0 v_~x$w_buff0~0_403) (= v_~x$r_buff0_thd0~0_156 0) (= |v_ULTIMATE.start_main_~#t2073~0.offset_22| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2073~0.base_30| 1) |v_#valid_64|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_403, ~x$flush_delayed~0=v_~x$flush_delayed~0_62, ULTIMATE.start_main_~#t2075~0.base=|v_ULTIMATE.start_main_~#t2075~0.base_23|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_428, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_148, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_68, ULTIMATE.start_main_~#t2074~0.offset=|v_ULTIMATE.start_main_~#t2074~0.offset_22|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~x$w_buff1~0=v_~x$w_buff1~0_328, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_624, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_264, ULTIMATE.start_main_~#t2074~0.base=|v_ULTIMATE.start_main_~#t2074~0.base_31|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t2073~0.offset=|v_ULTIMATE.start_main_~#t2073~0.offset_22|, ~weak$$choice0~0=v_~weak$$choice0~0_37, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, ~x~0=v_~x~0_240, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_362, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_114|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_267, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_53, ~x$mem_tmp~0=v_~x$mem_tmp~0_40, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_~#t2075~0.offset=|v_ULTIMATE.start_main_~#t2075~0.offset_14|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_~#t2073~0.base=|v_ULTIMATE.start_main_~#t2073~0.base_30|, ~y~0=v_~y~0_226, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_309, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_323, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_913, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_62|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_201, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t2075~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t2075~0.offset, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2073~0.base, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2074~0.offset, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2074~0.base, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_~#t2073~0.offset, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 03:42:48,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L818-1-->L820: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2074~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2074~0.base_10|) |v_ULTIMATE.start_main_~#t2074~0.offset_9| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t2074~0.offset_9| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2074~0.base_10|) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2074~0.base_10|) 0) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2074~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2074~0.base_10|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2074~0.base_10| 4) |v_#length_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2074~0.offset=|v_ULTIMATE.start_main_~#t2074~0.offset_9|, ULTIMATE.start_main_~#t2074~0.base=|v_ULTIMATE.start_main_~#t2074~0.base_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2074~0.offset, ULTIMATE.start_main_~#t2074~0.base] because there is no mapped edge [2019-12-27 03:42:48,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_19) (= v_P1Thread1of1ForFork0_~arg.offset_6 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_P1Thread1of1ForFork0_~arg.base_6 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= 0 (mod v_~x$w_buff1_used~0_52 256)) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_~x$w_buff1_used~0_52 v_~x$w_buff0_used~0_98) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= 1 v_~x$w_buff0_used~0_97) (= 1 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_6, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_6, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|, ~x$w_buff1~0=v_~x$w_buff1~0_19, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_97} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 03:42:48,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L820-1-->L822: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2075~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2075~0.base_11|) |v_ULTIMATE.start_main_~#t2075~0.offset_10| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2075~0.base_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2075~0.base_11| 1)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2075~0.base_11|)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2075~0.base_11| 4) |v_#length_13|) (= |v_ULTIMATE.start_main_~#t2075~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t2075~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2075~0.base=|v_ULTIMATE.start_main_~#t2075~0.base_11|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t2075~0.offset=|v_ULTIMATE.start_main_~#t2075~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2075~0.base, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2075~0.offset] because there is no mapped edge [2019-12-27 03:42:48,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In-2016020199 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-2016020199 256) 0))) (or (and (= ~x$w_buff1~0_In-2016020199 |P2Thread1of1ForFork1_#t~ite32_Out-2016020199|) (not .cse0) (not .cse1)) (and (= ~x~0_In-2016020199 |P2Thread1of1ForFork1_#t~ite32_Out-2016020199|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2016020199, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2016020199, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2016020199, ~x~0=~x~0_In-2016020199} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-2016020199|, ~x$w_buff1~0=~x$w_buff1~0_In-2016020199, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2016020199, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2016020199, ~x~0=~x~0_In-2016020199} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 03:42:48,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_21 |v_P2Thread1of1ForFork1_#t~ite32_10|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_10|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_13|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 03:42:48,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-2118281877 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-2118281877 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-2118281877|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-2118281877 |P2Thread1of1ForFork1_#t~ite34_Out-2118281877|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2118281877, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2118281877} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-2118281877|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2118281877, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2118281877} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 03:42:48,412 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-219617483 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-219617483 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-219617483|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-219617483 |P1Thread1of1ForFork0_#t~ite28_Out-219617483|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-219617483, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-219617483} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-219617483, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-219617483|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-219617483} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 03:42:48,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In1136007049 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1136007049 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1136007049 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1136007049 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out1136007049| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite29_Out1136007049| ~x$w_buff1_used~0_In1136007049)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1136007049, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1136007049, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1136007049, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1136007049} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1136007049, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1136007049, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1136007049, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1136007049|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1136007049} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 03:42:48,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L778-->L779: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-497726159 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-497726159 256)))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out-497726159) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-497726159 ~x$r_buff0_thd2~0_Out-497726159)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-497726159, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-497726159} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-497726159|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-497726159, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-497726159} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 03:42:48,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd2~0_In-1244460242 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1244460242 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1244460242 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1244460242 256)))) (or (and (= ~x$r_buff1_thd2~0_In-1244460242 |P1Thread1of1ForFork0_#t~ite31_Out-1244460242|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1244460242|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1244460242, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1244460242, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1244460242, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1244460242} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1244460242|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1244460242, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1244460242, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1244460242, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1244460242} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 03:42:48,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L779-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd2~0_46 |v_P1Thread1of1ForFork0_#t~ite31_30|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_29|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_46, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 03:42:48,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1621958739 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite9_Out-1621958739| ~x$w_buff0~0_In-1621958739) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite8_In-1621958739| |P0Thread1of1ForFork2_#t~ite8_Out-1621958739|)) (and (= |P0Thread1of1ForFork2_#t~ite9_Out-1621958739| |P0Thread1of1ForFork2_#t~ite8_Out-1621958739|) (= ~x$w_buff0~0_In-1621958739 |P0Thread1of1ForFork2_#t~ite8_Out-1621958739|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1621958739 256) 0))) (or (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-1621958739 256) 0)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1621958739 256))) (= (mod ~x$w_buff0_used~0_In-1621958739 256) 0))) .cse0))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1621958739, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1621958739, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-1621958739|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1621958739, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1621958739, ~weak$$choice2~0=~weak$$choice2~0_In-1621958739, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1621958739} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1621958739, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1621958739, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1621958739|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1621958739, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-1621958739|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1621958739, ~weak$$choice2~0=~weak$$choice2~0_In-1621958739, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1621958739} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 03:42:48,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1527959496 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-1527959496 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1527959496 256))) (.cse3 (= (mod ~x$r_buff0_thd3~0_In-1527959496 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite35_Out-1527959496| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork1_#t~ite35_Out-1527959496| ~x$w_buff1_used~0_In-1527959496) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1527959496, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1527959496, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1527959496, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1527959496} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1527959496|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1527959496, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1527959496, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1527959496, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1527959496} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 03:42:48,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In745011690 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In745011690 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In745011690 |P2Thread1of1ForFork1_#t~ite36_Out745011690|)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out745011690|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In745011690, ~x$w_buff0_used~0=~x$w_buff0_used~0_In745011690} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out745011690|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In745011690, ~x$w_buff0_used~0=~x$w_buff0_used~0_In745011690} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 03:42:48,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In95734126 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In95734126 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In95734126 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In95734126 256) 0))) (or (and (= ~x$r_buff1_thd3~0_In95734126 |P2Thread1of1ForFork1_#t~ite37_Out95734126|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out95734126| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In95734126, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In95734126, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In95734126, ~x$w_buff0_used~0=~x$w_buff0_used~0_In95734126} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out95734126|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In95734126, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In95734126, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In95734126, ~x$w_buff0_used~0=~x$w_buff0_used~0_In95734126} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 03:42:48,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_48 |v_P2Thread1of1ForFork1_#t~ite37_30|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_48, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 03:42:48,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-71042983 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-71042983 256)))) (or (and (= (mod ~x$w_buff1_used~0_In-71042983 256) 0) .cse0) (and (= (mod ~x$r_buff1_thd1~0_In-71042983 256) 0) .cse0) (= 0 (mod ~x$w_buff0_used~0_In-71042983 256)))) (= |P0Thread1of1ForFork2_#t~ite18_Out-71042983| |P0Thread1of1ForFork2_#t~ite17_Out-71042983|) .cse1 (= ~x$w_buff1_used~0_In-71042983 |P0Thread1of1ForFork2_#t~ite17_Out-71042983|)) (and (= ~x$w_buff1_used~0_In-71042983 |P0Thread1of1ForFork2_#t~ite18_Out-71042983|) (= |P0Thread1of1ForFork2_#t~ite17_In-71042983| |P0Thread1of1ForFork2_#t~ite17_Out-71042983|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-71042983, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-71042983|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-71042983, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-71042983, ~weak$$choice2~0=~weak$$choice2~0_In-71042983, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-71042983} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-71042983, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-71042983|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-71042983|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-71042983, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-71042983, ~weak$$choice2~0=~weak$$choice2~0_In-71042983, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-71042983} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 03:42:48,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_101 v_~x$r_buff0_thd1~0_100) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_11|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_100, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 03:42:48,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1302035246 256) 0))) (or (and (= ~x$r_buff1_thd1~0_In1302035246 |P0Thread1of1ForFork2_#t~ite24_Out1302035246|) (= |P0Thread1of1ForFork2_#t~ite23_In1302035246| |P0Thread1of1ForFork2_#t~ite23_Out1302035246|) (not .cse0)) (and (= ~x$r_buff1_thd1~0_In1302035246 |P0Thread1of1ForFork2_#t~ite23_Out1302035246|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1302035246 256) 0))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In1302035246 256)) .cse1) (= (mod ~x$w_buff0_used~0_In1302035246 256) 0) (and (= (mod ~x$w_buff1_used~0_In1302035246 256) 0) .cse1))) (= |P0Thread1of1ForFork2_#t~ite23_Out1302035246| |P0Thread1of1ForFork2_#t~ite24_Out1302035246|) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1302035246, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1302035246, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1302035246, ~weak$$choice2~0=~weak$$choice2~0_In1302035246, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In1302035246|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1302035246} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1302035246, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1302035246, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1302035246, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out1302035246|, ~weak$$choice2~0=~weak$$choice2~0_In1302035246, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out1302035246|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1302035246} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-27 03:42:48,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x~0_34 v_~x$mem_tmp~0_10) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_34} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 03:42:48,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_158 256)) (= 0 (mod v_~x$r_buff0_thd0~0_26 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 03:42:48,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L828-2-->L828-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-1017182308 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1017182308 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite41_Out-1017182308| ~x~0_In-1017182308)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out-1017182308| ~x$w_buff1~0_In-1017182308)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1017182308, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1017182308, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1017182308, ~x~0=~x~0_In-1017182308} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1017182308|, ~x$w_buff1~0=~x$w_buff1~0_In-1017182308, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1017182308, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1017182308, ~x~0=~x~0_In-1017182308} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 03:42:48,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 03:42:48,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-1217169614 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1217169614 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out-1217169614|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-1217169614 |ULTIMATE.start_main_#t~ite43_Out-1217169614|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1217169614, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1217169614} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1217169614, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1217169614|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1217169614} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 03:42:48,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1969219412 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1969219412 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In1969219412 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In1969219412 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out1969219412| ~x$w_buff1_used~0_In1969219412) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite44_Out1969219412| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1969219412, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1969219412, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1969219412, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1969219412} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1969219412, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1969219412, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1969219412, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1969219412|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1969219412} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 03:42:48,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In518923399 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In518923399 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out518923399| ~x$r_buff0_thd0~0_In518923399)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out518923399| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In518923399, ~x$w_buff0_used~0=~x$w_buff0_used~0_In518923399} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In518923399, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out518923399|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In518923399} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 03:42:48,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L832-->L832-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In615967484 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In615967484 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In615967484 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In615967484 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out615967484|)) (and (= ~x$r_buff1_thd0~0_In615967484 |ULTIMATE.start_main_#t~ite46_Out615967484|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In615967484, ~x$w_buff1_used~0=~x$w_buff1_used~0_In615967484, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In615967484, ~x$w_buff0_used~0=~x$w_buff0_used~0_In615967484} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In615967484, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out615967484|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In615967484, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In615967484, ~x$w_buff0_used~0=~x$w_buff0_used~0_In615967484} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 03:42:48,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z~0_60 2) (= v_~main$tmp_guard1~0_25 0) (= 1 v_~__unbuffered_p2_EAX~0_35) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 0) (= v_~x$r_buff1_thd0~0_277 |v_ULTIMATE.start_main_#t~ite46_60|) (= 0 v_~__unbuffered_p0_EAX~0_54) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_25 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_60|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_59|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_277, 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, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:42:48,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:42:48 BasicIcfg [2019-12-27 03:42:48,510 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:42:48,514 INFO L168 Benchmark]: Toolchain (without parser) took 169335.85 ms. Allocated memory was 143.7 MB in the beginning and 3.9 GB in the end (delta: 3.8 GB). Free memory was 99.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-27 03:42:48,517 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 03:42:48,518 INFO L168 Benchmark]: CACSL2BoogieTranslator took 770.27 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 99.3 MB in the beginning and 152.8 MB in the end (delta: -53.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:42:48,518 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.51 ms. Allocated memory is still 201.3 MB. Free memory was 152.8 MB in the beginning and 150.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 03:42:48,519 INFO L168 Benchmark]: Boogie Preprocessor took 66.28 ms. Allocated memory is still 201.3 MB. Free memory was 150.7 MB in the beginning and 147.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:42:48,519 INFO L168 Benchmark]: RCFGBuilder took 754.19 ms. Allocated memory is still 201.3 MB. Free memory was 147.9 MB in the beginning and 101.2 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. [2019-12-27 03:42:48,520 INFO L168 Benchmark]: TraceAbstraction took 167676.44 ms. Allocated memory was 201.3 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 101.2 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-27 03:42:48,525 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.50 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 770.27 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 99.3 MB in the beginning and 152.8 MB in the end (delta: -53.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.51 ms. Allocated memory is still 201.3 MB. Free memory was 152.8 MB in the beginning and 150.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.28 ms. Allocated memory is still 201.3 MB. Free memory was 150.7 MB in the beginning and 147.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 754.19 ms. Allocated memory is still 201.3 MB. Free memory was 147.9 MB in the beginning and 101.2 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 167676.44 ms. Allocated memory was 201.3 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 101.2 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 163 ProgramPointsBefore, 83 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 26 ChoiceCompositions, 6709 VarBasedMoverChecksPositive, 292 VarBasedMoverChecksNegative, 116 SemBasedMoverChecksPositive, 259 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 66094 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2073, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2074, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2075, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 z = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 167.3s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 49.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4006 SDtfs, 4902 SDslu, 9646 SDs, 0 SdLazy, 8949 SolverSat, 255 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 38 SyntacticMatches, 15 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161868occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 95.7s AutomataMinimizationTime, 27 MinimizatonAttempts, 171451 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 837 NumberOfCodeBlocks, 837 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 754 ConstructedInterpolants, 0 QuantifiedInterpolants, 99100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...