/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe024_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:33:06,830 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:33:06,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:33:06,851 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:33:06,852 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:33:06,853 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:33:06,855 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:33:06,865 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:33:06,868 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:33:06,871 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:33:06,873 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:33:06,875 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:33:06,875 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:33:06,877 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:33:06,879 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:33:06,881 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:33:06,882 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:33:06,883 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:33:06,884 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:33:06,889 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:33:06,893 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:33:06,898 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:33:06,899 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:33:06,902 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:33:06,904 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:33:06,904 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:33:06,905 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:33:06,907 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:33:06,908 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:33:06,909 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:33:06,909 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:33:06,910 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:33:06,911 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:33:06,912 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:33:06,913 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:33:06,914 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:33:06,914 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:33:06,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:33:06,915 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:33:06,916 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:33:06,917 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:33:06,918 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-MCR.epf [2019-12-27 18:33:06,945 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:33:06,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:33:06,947 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:33:06,947 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:33:06,947 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:33:06,947 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:33:06,948 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:33:06,948 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:33:06,948 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:33:06,948 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:33:06,948 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:33:06,948 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:33:06,949 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:33:06,949 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:33:06,949 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:33:06,949 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:33:06,949 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:33:06,950 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:33:06,950 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:33:06,950 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:33:06,950 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:33:06,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:33:06,951 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:33:06,951 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:33:06,951 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:33:06,951 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:33:06,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:33:06,952 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:33:06,952 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:33:06,952 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:33:06,952 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:33:07,260 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:33:07,273 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:33:07,277 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:33:07,278 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:33:07,279 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:33:07,280 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_power.opt.i [2019-12-27 18:33:07,339 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d32aed0aa/0cec96f740064c2b851886b810d7c661/FLAG777dc09a7 [2019-12-27 18:33:07,875 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:33:07,875 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_power.opt.i [2019-12-27 18:33:07,905 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d32aed0aa/0cec96f740064c2b851886b810d7c661/FLAG777dc09a7 [2019-12-27 18:33:08,176 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d32aed0aa/0cec96f740064c2b851886b810d7c661 [2019-12-27 18:33:08,184 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:33:08,186 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:33:08,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:33:08,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:33:08,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:33:08,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:33:08" (1/1) ... [2019-12-27 18:33:08,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cc7de13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:33:08, skipping insertion in model container [2019-12-27 18:33:08,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:33:08" (1/1) ... [2019-12-27 18:33:08,203 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:33:08,257 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:33:08,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:33:08,842 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:33:08,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:33:08,991 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:33:08,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:33:08 WrapperNode [2019-12-27 18:33:08,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:33:08,993 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:33:08,993 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:33:08,993 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:33:09,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:33:08" (1/1) ... [2019-12-27 18:33:09,021 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:33:08" (1/1) ... [2019-12-27 18:33:09,069 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:33:09,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:33:09,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:33:09,071 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:33:09,081 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:33:08" (1/1) ... [2019-12-27 18:33:09,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:33:08" (1/1) ... [2019-12-27 18:33:09,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:33:08" (1/1) ... [2019-12-27 18:33:09,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:33:08" (1/1) ... [2019-12-27 18:33:09,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:33:08" (1/1) ... [2019-12-27 18:33:09,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:33:08" (1/1) ... [2019-12-27 18:33:09,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:33:08" (1/1) ... [2019-12-27 18:33:09,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:33:09,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:33:09,122 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:33:09,122 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:33:09,123 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:33:08" (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 18:33:09,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:33:09,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:33:09,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:33:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:33:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:33:09,190 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:33:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:33:09,191 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:33:09,191 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 18:33:09,191 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 18:33:09,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:33:09,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:33:09,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:33:09,194 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 18:33:09,969 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:33:09,969 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:33:09,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:33:09 BoogieIcfgContainer [2019-12-27 18:33:09,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:33:09,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:33:09,972 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:33:09,976 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:33:09,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:33:08" (1/3) ... [2019-12-27 18:33:09,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ce24e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:33:09, skipping insertion in model container [2019-12-27 18:33:09,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:33:08" (2/3) ... [2019-12-27 18:33:09,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ce24e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:33:09, skipping insertion in model container [2019-12-27 18:33:09,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:33:09" (3/3) ... [2019-12-27 18:33:09,979 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_power.opt.i [2019-12-27 18:33:09,988 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:33:09,988 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:33:09,995 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:33:09,996 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:33:10,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,042 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,043 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,067 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,067 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,067 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,067 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,068 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,075 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,075 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,102 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,102 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,102 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,108 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,109 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,113 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,114 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:33:10,132 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:33:10,153 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:33:10,154 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:33:10,154 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:33:10,154 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:33:10,154 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:33:10,154 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:33:10,154 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:33:10,155 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:33:10,171 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 18:33:10,174 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 18:33:10,270 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 18:33:10,270 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:33:10,289 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:33:10,316 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 18:33:10,371 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 18:33:10,371 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:33:10,383 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:33:10,409 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 18:33:10,410 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:33:11,367 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2019-12-27 18:33:16,005 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 18:33:16,135 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 18:33:16,162 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66430 [2019-12-27 18:33:16,162 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 18:33:16,166 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 89 transitions [2019-12-27 18:33:27,497 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-27 18:33:27,499 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-27 18:33:27,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 18:33:27,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:33:27,506 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 18:33:27,507 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 18:33:27,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:33:27,513 INFO L82 PathProgramCache]: Analyzing trace with hash 797474656, now seen corresponding path program 1 times [2019-12-27 18:33:27,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:33:27,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080177972] [2019-12-27 18:33:27,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:33:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:33:27,819 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 18:33:27,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080177972] [2019-12-27 18:33:27,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:33:27,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:33:27,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1322049746] [2019-12-27 18:33:27,824 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:33:27,829 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:33:27,841 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 18:33:27,841 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:33:27,845 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:33:27,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:33:27,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:33:27,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:33:27,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:33:27,862 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-27 18:33:29,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:33:29,214 INFO L93 Difference]: Finished difference Result 87834 states and 374974 transitions. [2019-12-27 18:33:29,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:33:29,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 18:33:29,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:33:29,848 INFO L225 Difference]: With dead ends: 87834 [2019-12-27 18:33:29,848 INFO L226 Difference]: Without dead ends: 82738 [2019-12-27 18:33:29,850 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 18:33:35,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82738 states. [2019-12-27 18:33:37,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82738 to 82738. [2019-12-27 18:33:37,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82738 states. [2019-12-27 18:33:40,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82738 states to 82738 states and 352742 transitions. [2019-12-27 18:33:40,394 INFO L78 Accepts]: Start accepts. Automaton has 82738 states and 352742 transitions. Word has length 5 [2019-12-27 18:33:40,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:33:40,394 INFO L462 AbstractCegarLoop]: Abstraction has 82738 states and 352742 transitions. [2019-12-27 18:33:40,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:33:40,394 INFO L276 IsEmpty]: Start isEmpty. Operand 82738 states and 352742 transitions. [2019-12-27 18:33:40,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:33:40,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:33:40,403 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:33:40,403 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 18:33:40,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:33:40,404 INFO L82 PathProgramCache]: Analyzing trace with hash 334215788, now seen corresponding path program 1 times [2019-12-27 18:33:40,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:33:40,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626672606] [2019-12-27 18:33:40,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:33:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:33:40,552 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 18:33:40,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626672606] [2019-12-27 18:33:40,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:33:40,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:33:40,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [91450376] [2019-12-27 18:33:40,554 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:33:40,556 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:33:40,561 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:33:40,561 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:33:40,562 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:33:40,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:33:40,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:33:40,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:33:40,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:33:40,564 INFO L87 Difference]: Start difference. First operand 82738 states and 352742 transitions. Second operand 4 states. [2019-12-27 18:33:41,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:33:41,635 INFO L93 Difference]: Finished difference Result 127286 states and 521114 transitions. [2019-12-27 18:33:41,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:33:41,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:33:41,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:33:46,130 INFO L225 Difference]: With dead ends: 127286 [2019-12-27 18:33:46,131 INFO L226 Difference]: Without dead ends: 127202 [2019-12-27 18:33:46,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 18:33:49,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127202 states. [2019-12-27 18:33:52,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127202 to 115962. [2019-12-27 18:33:52,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115962 states. [2019-12-27 18:33:53,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115962 states to 115962 states and 480151 transitions. [2019-12-27 18:33:53,516 INFO L78 Accepts]: Start accepts. Automaton has 115962 states and 480151 transitions. Word has length 13 [2019-12-27 18:33:53,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:33:53,517 INFO L462 AbstractCegarLoop]: Abstraction has 115962 states and 480151 transitions. [2019-12-27 18:33:53,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:33:53,518 INFO L276 IsEmpty]: Start isEmpty. Operand 115962 states and 480151 transitions. [2019-12-27 18:33:53,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:33:53,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:33:53,522 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:33:53,522 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 18:33:53,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:33:53,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985610, now seen corresponding path program 1 times [2019-12-27 18:33:53,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:33:53,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440334004] [2019-12-27 18:33:53,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:33:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:33:53,582 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 18:33:53,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440334004] [2019-12-27 18:33:53,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:33:53,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:33:53,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [463559839] [2019-12-27 18:33:53,583 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:33:53,585 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:33:53,586 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:33:53,587 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:33:53,587 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:33:53,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:33:53,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:33:53,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:33:53,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:33:53,588 INFO L87 Difference]: Start difference. First operand 115962 states and 480151 transitions. Second operand 3 states. [2019-12-27 18:33:53,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:33:53,737 INFO L93 Difference]: Finished difference Result 28492 states and 95363 transitions. [2019-12-27 18:33:53,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:33:53,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 18:33:53,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:33:53,846 INFO L225 Difference]: With dead ends: 28492 [2019-12-27 18:33:53,846 INFO L226 Difference]: Without dead ends: 28492 [2019-12-27 18:33:53,846 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 18:33:54,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28492 states. [2019-12-27 18:33:54,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28492 to 28492. [2019-12-27 18:33:54,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28492 states. [2019-12-27 18:33:54,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28492 states to 28492 states and 95363 transitions. [2019-12-27 18:33:54,458 INFO L78 Accepts]: Start accepts. Automaton has 28492 states and 95363 transitions. Word has length 13 [2019-12-27 18:33:54,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:33:54,459 INFO L462 AbstractCegarLoop]: Abstraction has 28492 states and 95363 transitions. [2019-12-27 18:33:54,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:33:54,459 INFO L276 IsEmpty]: Start isEmpty. Operand 28492 states and 95363 transitions. [2019-12-27 18:33:54,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:33:54,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:33:54,461 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:33:54,462 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 18:33:54,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:33:54,462 INFO L82 PathProgramCache]: Analyzing trace with hash 319138254, now seen corresponding path program 1 times [2019-12-27 18:33:54,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:33:54,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837252828] [2019-12-27 18:33:54,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:33:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:33:54,579 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 18:33:54,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837252828] [2019-12-27 18:33:54,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:33:54,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:33:54,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [578661060] [2019-12-27 18:33:54,580 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:33:54,582 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:33:54,587 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:33:54,587 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:33:54,588 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:33:54,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:33:54,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:33:54,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:33:54,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:33:54,589 INFO L87 Difference]: Start difference. First operand 28492 states and 95363 transitions. Second operand 5 states. [2019-12-27 18:33:55,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:33:55,468 INFO L93 Difference]: Finished difference Result 41156 states and 135447 transitions. [2019-12-27 18:33:55,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:33:55,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:33:55,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:33:55,600 INFO L225 Difference]: With dead ends: 41156 [2019-12-27 18:33:55,601 INFO L226 Difference]: Without dead ends: 41141 [2019-12-27 18:33:55,601 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 18:33:55,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41141 states. [2019-12-27 18:33:56,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41141 to 31619. [2019-12-27 18:33:56,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31619 states. [2019-12-27 18:33:56,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31619 states to 31619 states and 105299 transitions. [2019-12-27 18:33:56,265 INFO L78 Accepts]: Start accepts. Automaton has 31619 states and 105299 transitions. Word has length 14 [2019-12-27 18:33:56,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:33:56,265 INFO L462 AbstractCegarLoop]: Abstraction has 31619 states and 105299 transitions. [2019-12-27 18:33:56,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:33:56,265 INFO L276 IsEmpty]: Start isEmpty. Operand 31619 states and 105299 transitions. [2019-12-27 18:33:56,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:33:56,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:33:56,277 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 18:33:56,277 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 18:33:56,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:33:56,277 INFO L82 PathProgramCache]: Analyzing trace with hash 436639450, now seen corresponding path program 1 times [2019-12-27 18:33:56,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:33:56,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061384731] [2019-12-27 18:33:56,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:33:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:33:56,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 18:33:56,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061384731] [2019-12-27 18:33:56,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:33:56,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:33:56,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [698276830] [2019-12-27 18:33:56,423 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:33:56,428 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:33:56,441 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 110 transitions. [2019-12-27 18:33:56,442 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:33:56,442 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:33:56,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:33:56,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:33:56,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:33:56,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:33:56,444 INFO L87 Difference]: Start difference. First operand 31619 states and 105299 transitions. Second operand 6 states. [2019-12-27 18:33:57,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:33:57,325 INFO L93 Difference]: Finished difference Result 48363 states and 157775 transitions. [2019-12-27 18:33:57,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:33:57,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 18:33:57,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:33:57,424 INFO L225 Difference]: With dead ends: 48363 [2019-12-27 18:33:57,424 INFO L226 Difference]: Without dead ends: 48336 [2019-12-27 18:33:57,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:33:57,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48336 states. [2019-12-27 18:33:58,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48336 to 33272. [2019-12-27 18:33:58,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33272 states. [2019-12-27 18:33:58,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33272 states to 33272 states and 109841 transitions. [2019-12-27 18:33:58,455 INFO L78 Accepts]: Start accepts. Automaton has 33272 states and 109841 transitions. Word has length 22 [2019-12-27 18:33:58,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:33:58,455 INFO L462 AbstractCegarLoop]: Abstraction has 33272 states and 109841 transitions. [2019-12-27 18:33:58,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:33:58,455 INFO L276 IsEmpty]: Start isEmpty. Operand 33272 states and 109841 transitions. [2019-12-27 18:33:58,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:33:58,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:33:58,472 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 18:33:58,472 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 18:33:58,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:33:58,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050687, now seen corresponding path program 1 times [2019-12-27 18:33:58,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:33:58,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565563728] [2019-12-27 18:33:58,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:33:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:33:58,525 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 18:33:58,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565563728] [2019-12-27 18:33:58,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:33:58,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:33:58,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1822347801] [2019-12-27 18:33:58,526 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:33:58,532 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:33:58,537 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:33:58,537 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:33:58,538 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:33:58,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:33:58,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:33:58,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:33:58,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:33:58,540 INFO L87 Difference]: Start difference. First operand 33272 states and 109841 transitions. Second operand 4 states. [2019-12-27 18:33:58,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:33:58,601 INFO L93 Difference]: Finished difference Result 12861 states and 39176 transitions. [2019-12-27 18:33:58,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:33:58,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 18:33:58,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:33:58,625 INFO L225 Difference]: With dead ends: 12861 [2019-12-27 18:33:58,625 INFO L226 Difference]: Without dead ends: 12861 [2019-12-27 18:33:58,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:33:58,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2019-12-27 18:33:58,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 12721. [2019-12-27 18:33:58,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12721 states. [2019-12-27 18:33:58,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12721 states to 12721 states and 38766 transitions. [2019-12-27 18:33:58,823 INFO L78 Accepts]: Start accepts. Automaton has 12721 states and 38766 transitions. Word has length 25 [2019-12-27 18:33:58,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:33:58,823 INFO L462 AbstractCegarLoop]: Abstraction has 12721 states and 38766 transitions. [2019-12-27 18:33:58,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:33:58,823 INFO L276 IsEmpty]: Start isEmpty. Operand 12721 states and 38766 transitions. [2019-12-27 18:33:58,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 18:33:58,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:33:58,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:33:58,841 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 18:33:58,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:33:58,842 INFO L82 PathProgramCache]: Analyzing trace with hash 207279171, now seen corresponding path program 1 times [2019-12-27 18:33:58,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:33:58,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400210276] [2019-12-27 18:33:58,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:33:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:33:58,917 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 18:33:58,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400210276] [2019-12-27 18:33:58,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:33:58,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:33:58,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1196816405] [2019-12-27 18:33:58,919 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:33:58,928 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:33:58,987 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 187 transitions. [2019-12-27 18:33:58,988 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:33:58,989 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:33:58,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:33:58,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:33:58,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:33:58,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:33:58,990 INFO L87 Difference]: Start difference. First operand 12721 states and 38766 transitions. Second operand 5 states. [2019-12-27 18:33:59,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:33:59,062 INFO L93 Difference]: Finished difference Result 11425 states and 35436 transitions. [2019-12-27 18:33:59,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:33:59,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 18:33:59,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:33:59,081 INFO L225 Difference]: With dead ends: 11425 [2019-12-27 18:33:59,081 INFO L226 Difference]: Without dead ends: 11425 [2019-12-27 18:33:59,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:33:59,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11425 states. [2019-12-27 18:33:59,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11425 to 10977. [2019-12-27 18:33:59,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10977 states. [2019-12-27 18:33:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10977 states to 10977 states and 34172 transitions. [2019-12-27 18:33:59,255 INFO L78 Accepts]: Start accepts. Automaton has 10977 states and 34172 transitions. Word has length 39 [2019-12-27 18:33:59,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:33:59,256 INFO L462 AbstractCegarLoop]: Abstraction has 10977 states and 34172 transitions. [2019-12-27 18:33:59,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:33:59,256 INFO L276 IsEmpty]: Start isEmpty. Operand 10977 states and 34172 transitions. [2019-12-27 18:33:59,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:33:59,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:33:59,273 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:33:59,273 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 18:33:59,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:33:59,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1179829373, now seen corresponding path program 1 times [2019-12-27 18:33:59,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:33:59,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122284954] [2019-12-27 18:33:59,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:33:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:33:59,363 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 18:33:59,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122284954] [2019-12-27 18:33:59,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:33:59,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:33:59,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1966748450] [2019-12-27 18:33:59,364 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:33:59,379 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:33:59,511 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 239 states and 471 transitions. [2019-12-27 18:33:59,511 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:33:59,585 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 18:33:59,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:33:59,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:33:59,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:33:59,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:33:59,586 INFO L87 Difference]: Start difference. First operand 10977 states and 34172 transitions. Second operand 7 states. [2019-12-27 18:34:00,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:34:00,265 INFO L93 Difference]: Finished difference Result 25197 states and 77861 transitions. [2019-12-27 18:34:00,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 18:34:00,266 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 18:34:00,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:34:00,294 INFO L225 Difference]: With dead ends: 25197 [2019-12-27 18:34:00,295 INFO L226 Difference]: Without dead ends: 13995 [2019-12-27 18:34:00,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:34:00,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13995 states. [2019-12-27 18:34:00,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13995 to 9365. [2019-12-27 18:34:00,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9365 states. [2019-12-27 18:34:00,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9365 states to 9365 states and 29013 transitions. [2019-12-27 18:34:00,475 INFO L78 Accepts]: Start accepts. Automaton has 9365 states and 29013 transitions. Word has length 53 [2019-12-27 18:34:00,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:34:00,475 INFO L462 AbstractCegarLoop]: Abstraction has 9365 states and 29013 transitions. [2019-12-27 18:34:00,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:34:00,476 INFO L276 IsEmpty]: Start isEmpty. Operand 9365 states and 29013 transitions. [2019-12-27 18:34:00,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:34:00,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:34:00,489 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:34:00,489 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 18:34:00,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:34:00,490 INFO L82 PathProgramCache]: Analyzing trace with hash 383407097, now seen corresponding path program 2 times [2019-12-27 18:34:00,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:34:00,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012756470] [2019-12-27 18:34:00,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:34:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:34:00,591 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 18:34:00,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012756470] [2019-12-27 18:34:00,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:34:00,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:34:00,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1868197149] [2019-12-27 18:34:00,593 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:34:00,609 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:34:00,764 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 393 transitions. [2019-12-27 18:34:00,764 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:34:00,886 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 18:34:00,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 18:34:00,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:34:00,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 18:34:00,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:34:00,888 INFO L87 Difference]: Start difference. First operand 9365 states and 29013 transitions. Second operand 8 states. [2019-12-27 18:34:01,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:34:01,305 INFO L93 Difference]: Finished difference Result 23182 states and 71788 transitions. [2019-12-27 18:34:01,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:34:01,306 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-27 18:34:01,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:34:01,330 INFO L225 Difference]: With dead ends: 23182 [2019-12-27 18:34:01,330 INFO L226 Difference]: Without dead ends: 18276 [2019-12-27 18:34:01,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 9 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:34:01,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18276 states. [2019-12-27 18:34:01,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18276 to 11162. [2019-12-27 18:34:01,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11162 states. [2019-12-27 18:34:01,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11162 states to 11162 states and 34879 transitions. [2019-12-27 18:34:01,564 INFO L78 Accepts]: Start accepts. Automaton has 11162 states and 34879 transitions. Word has length 53 [2019-12-27 18:34:01,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:34:01,564 INFO L462 AbstractCegarLoop]: Abstraction has 11162 states and 34879 transitions. [2019-12-27 18:34:01,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 18:34:01,564 INFO L276 IsEmpty]: Start isEmpty. Operand 11162 states and 34879 transitions. [2019-12-27 18:34:01,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:34:01,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:34:01,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:34:01,580 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 18:34:01,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:34:01,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1401815865, now seen corresponding path program 3 times [2019-12-27 18:34:01,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:34:01,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645881826] [2019-12-27 18:34:01,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:34:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:34:01,711 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 18:34:01,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645881826] [2019-12-27 18:34:01,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:34:01,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:34:01,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1133779230] [2019-12-27 18:34:01,713 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:34:01,729 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:34:01,916 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 235 states and 453 transitions. [2019-12-27 18:34:01,917 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:34:02,175 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-12-27 18:34:02,337 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 18:34:02,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:34:02,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:34:02,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:34:02,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:34:02,339 INFO L87 Difference]: Start difference. First operand 11162 states and 34879 transitions. Second operand 11 states. [2019-12-27 18:34:04,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:34:04,475 INFO L93 Difference]: Finished difference Result 32552 states and 100072 transitions. [2019-12-27 18:34:04,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 18:34:04,476 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2019-12-27 18:34:04,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:34:04,510 INFO L225 Difference]: With dead ends: 32552 [2019-12-27 18:34:04,510 INFO L226 Difference]: Without dead ends: 24064 [2019-12-27 18:34:04,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2019-12-27 18:34:04,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24064 states. [2019-12-27 18:34:04,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24064 to 13020. [2019-12-27 18:34:04,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13020 states. [2019-12-27 18:34:04,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13020 states to 13020 states and 40574 transitions. [2019-12-27 18:34:04,850 INFO L78 Accepts]: Start accepts. Automaton has 13020 states and 40574 transitions. Word has length 53 [2019-12-27 18:34:04,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:34:04,850 INFO L462 AbstractCegarLoop]: Abstraction has 13020 states and 40574 transitions. [2019-12-27 18:34:04,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:34:04,850 INFO L276 IsEmpty]: Start isEmpty. Operand 13020 states and 40574 transitions. [2019-12-27 18:34:04,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:34:04,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:34:04,869 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:34:04,869 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 18:34:04,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:34:04,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1901485579, now seen corresponding path program 4 times [2019-12-27 18:34:04,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:34:04,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492651072] [2019-12-27 18:34:04,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:34:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:34:04,958 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 18:34:04,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492651072] [2019-12-27 18:34:04,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:34:04,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:34:04,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1448838177] [2019-12-27 18:34:04,959 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:34:04,974 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:34:05,149 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 390 transitions. [2019-12-27 18:34:05,149 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:34:05,536 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 18:34:05,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:34:05,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:34:05,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:34:05,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:34:05,538 INFO L87 Difference]: Start difference. First operand 13020 states and 40574 transitions. Second operand 10 states. [2019-12-27 18:34:07,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:34:07,955 INFO L93 Difference]: Finished difference Result 54777 states and 170133 transitions. [2019-12-27 18:34:07,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 18:34:07,956 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-12-27 18:34:07,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:34:08,028 INFO L225 Difference]: With dead ends: 54777 [2019-12-27 18:34:08,029 INFO L226 Difference]: Without dead ends: 43609 [2019-12-27 18:34:08,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 8 SyntacticMatches, 10 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=212, Invalid=718, Unknown=0, NotChecked=0, Total=930 [2019-12-27 18:34:08,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43609 states. [2019-12-27 18:34:08,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43609 to 15177. [2019-12-27 18:34:08,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15177 states. [2019-12-27 18:34:08,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15177 states to 15177 states and 47717 transitions. [2019-12-27 18:34:08,472 INFO L78 Accepts]: Start accepts. Automaton has 15177 states and 47717 transitions. Word has length 53 [2019-12-27 18:34:08,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:34:08,472 INFO L462 AbstractCegarLoop]: Abstraction has 15177 states and 47717 transitions. [2019-12-27 18:34:08,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:34:08,473 INFO L276 IsEmpty]: Start isEmpty. Operand 15177 states and 47717 transitions. [2019-12-27 18:34:08,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:34:08,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:34:08,489 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:34:08,490 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 18:34:08,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:34:08,490 INFO L82 PathProgramCache]: Analyzing trace with hash -9451933, now seen corresponding path program 1 times [2019-12-27 18:34:08,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:34:08,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032623805] [2019-12-27 18:34:08,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:34:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:34:08,547 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 18:34:08,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032623805] [2019-12-27 18:34:08,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:34:08,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:34:08,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1792328330] [2019-12-27 18:34:08,548 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:34:08,564 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:34:08,692 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 390 transitions. [2019-12-27 18:34:08,692 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:34:08,704 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:34:08,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:34:08,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:34:08,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:34:08,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:34:08,705 INFO L87 Difference]: Start difference. First operand 15177 states and 47717 transitions. Second operand 3 states. [2019-12-27 18:34:08,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:34:08,788 INFO L93 Difference]: Finished difference Result 20827 states and 65534 transitions. [2019-12-27 18:34:08,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:34:08,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 18:34:08,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:34:08,816 INFO L225 Difference]: With dead ends: 20827 [2019-12-27 18:34:08,816 INFO L226 Difference]: Without dead ends: 20827 [2019-12-27 18:34:08,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 2 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 18:34:08,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20827 states. [2019-12-27 18:34:09,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20827 to 18999. [2019-12-27 18:34:09,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18999 states. [2019-12-27 18:34:09,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18999 states to 18999 states and 60329 transitions. [2019-12-27 18:34:09,124 INFO L78 Accepts]: Start accepts. Automaton has 18999 states and 60329 transitions. Word has length 53 [2019-12-27 18:34:09,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:34:09,124 INFO L462 AbstractCegarLoop]: Abstraction has 18999 states and 60329 transitions. [2019-12-27 18:34:09,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:34:09,124 INFO L276 IsEmpty]: Start isEmpty. Operand 18999 states and 60329 transitions. [2019-12-27 18:34:09,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:34:09,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:34:09,145 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:34:09,145 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 18:34:09,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:34:09,146 INFO L82 PathProgramCache]: Analyzing trace with hash 2081547793, now seen corresponding path program 5 times [2019-12-27 18:34:09,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:34:09,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128083012] [2019-12-27 18:34:09,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:34:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:34:09,231 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 18:34:09,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128083012] [2019-12-27 18:34:09,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:34:09,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:34:09,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [196586896] [2019-12-27 18:34:09,232 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:34:09,248 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:34:09,371 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 338 transitions. [2019-12-27 18:34:09,371 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:34:09,492 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 18:34:09,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:34:09,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:34:09,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:34:09,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:34:09,494 INFO L87 Difference]: Start difference. First operand 18999 states and 60329 transitions. Second operand 11 states. [2019-12-27 18:34:13,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:34:13,639 INFO L93 Difference]: Finished difference Result 63665 states and 197641 transitions. [2019-12-27 18:34:13,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 18:34:13,640 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2019-12-27 18:34:13,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:34:13,739 INFO L225 Difference]: With dead ends: 63665 [2019-12-27 18:34:13,739 INFO L226 Difference]: Without dead ends: 63581 [2019-12-27 18:34:13,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=566, Invalid=1786, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 18:34:13,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63581 states. [2019-12-27 18:34:14,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63581 to 22369. [2019-12-27 18:34:14,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22369 states. [2019-12-27 18:34:14,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22369 states to 22369 states and 70393 transitions. [2019-12-27 18:34:14,433 INFO L78 Accepts]: Start accepts. Automaton has 22369 states and 70393 transitions. Word has length 53 [2019-12-27 18:34:14,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:34:14,433 INFO L462 AbstractCegarLoop]: Abstraction has 22369 states and 70393 transitions. [2019-12-27 18:34:14,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:34:14,433 INFO L276 IsEmpty]: Start isEmpty. Operand 22369 states and 70393 transitions. [2019-12-27 18:34:14,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:34:14,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:34:14,469 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:34:14,469 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 18:34:14,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:34:14,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1629843107, now seen corresponding path program 6 times [2019-12-27 18:34:14,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:34:14,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173869079] [2019-12-27 18:34:14,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:34:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:34:14,569 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 18:34:14,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173869079] [2019-12-27 18:34:14,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:34:14,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:34:14,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1498555178] [2019-12-27 18:34:14,570 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:34:14,585 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:34:15,040 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 222 states and 389 transitions. [2019-12-27 18:34:15,040 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:34:15,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:34:15,239 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 18:34:15,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:34:15,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:34:15,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:34:15,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:34:15,240 INFO L87 Difference]: Start difference. First operand 22369 states and 70393 transitions. Second operand 11 states. [2019-12-27 18:34:17,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:34:17,229 INFO L93 Difference]: Finished difference Result 39365 states and 120485 transitions. [2019-12-27 18:34:17,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 18:34:17,229 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2019-12-27 18:34:17,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:34:17,293 INFO L225 Difference]: With dead ends: 39365 [2019-12-27 18:34:17,293 INFO L226 Difference]: Without dead ends: 39243 [2019-12-27 18:34:17,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2019-12-27 18:34:17,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39243 states. [2019-12-27 18:34:17,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39243 to 28182. [2019-12-27 18:34:17,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28182 states. [2019-12-27 18:34:17,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28182 states to 28182 states and 87592 transitions. [2019-12-27 18:34:17,809 INFO L78 Accepts]: Start accepts. Automaton has 28182 states and 87592 transitions. Word has length 53 [2019-12-27 18:34:17,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:34:17,809 INFO L462 AbstractCegarLoop]: Abstraction has 28182 states and 87592 transitions. [2019-12-27 18:34:17,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:34:17,809 INFO L276 IsEmpty]: Start isEmpty. Operand 28182 states and 87592 transitions. [2019-12-27 18:34:17,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:34:17,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:34:17,840 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:34:17,840 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 18:34:17,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:34:17,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1109995221, now seen corresponding path program 7 times [2019-12-27 18:34:17,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:34:17,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640017187] [2019-12-27 18:34:17,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:34:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:34:17,975 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 18:34:17,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640017187] [2019-12-27 18:34:17,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:34:17,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 18:34:17,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1619268967] [2019-12-27 18:34:17,977 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:34:17,991 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:34:18,112 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 313 transitions. [2019-12-27 18:34:18,112 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:34:18,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:34:18,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:34:18,315 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 18:34:18,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:34:18,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:34:18,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:34:18,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:34:18,316 INFO L87 Difference]: Start difference. First operand 28182 states and 87592 transitions. Second operand 13 states. [2019-12-27 18:34:21,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:34:21,853 INFO L93 Difference]: Finished difference Result 61696 states and 187701 transitions. [2019-12-27 18:34:21,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 18:34:21,854 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-12-27 18:34:21,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:34:21,947 INFO L225 Difference]: With dead ends: 61696 [2019-12-27 18:34:21,948 INFO L226 Difference]: Without dead ends: 61696 [2019-12-27 18:34:21,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 31 SyntacticMatches, 8 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=471, Invalid=1785, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 18:34:22,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61696 states. [2019-12-27 18:34:22,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61696 to 26700. [2019-12-27 18:34:22,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26700 states. [2019-12-27 18:34:22,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26700 states to 26700 states and 83274 transitions. [2019-12-27 18:34:22,632 INFO L78 Accepts]: Start accepts. Automaton has 26700 states and 83274 transitions. Word has length 53 [2019-12-27 18:34:22,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:34:22,632 INFO L462 AbstractCegarLoop]: Abstraction has 26700 states and 83274 transitions. [2019-12-27 18:34:22,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:34:22,632 INFO L276 IsEmpty]: Start isEmpty. Operand 26700 states and 83274 transitions. [2019-12-27 18:34:22,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:34:22,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:34:22,663 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:34:22,663 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 18:34:22,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:34:22,664 INFO L82 PathProgramCache]: Analyzing trace with hash 2099294685, now seen corresponding path program 8 times [2019-12-27 18:34:22,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:34:22,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400098652] [2019-12-27 18:34:22,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:34:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:34:22,723 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 18:34:22,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400098652] [2019-12-27 18:34:22,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:34:22,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:34:22,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [313335912] [2019-12-27 18:34:22,724 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:34:22,739 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:34:22,892 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 188 states and 316 transitions. [2019-12-27 18:34:22,892 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:34:22,900 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:34:22,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:34:22,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:34:22,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:34:22,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:34:22,901 INFO L87 Difference]: Start difference. First operand 26700 states and 83274 transitions. Second operand 4 states. [2019-12-27 18:34:23,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:34:23,133 INFO L93 Difference]: Finished difference Result 26950 states and 81696 transitions. [2019-12-27 18:34:23,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:34:23,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-27 18:34:23,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:34:23,171 INFO L225 Difference]: With dead ends: 26950 [2019-12-27 18:34:23,171 INFO L226 Difference]: Without dead ends: 26950 [2019-12-27 18:34:23,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 18:34:23,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26950 states. [2019-12-27 18:34:23,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26950 to 19975. [2019-12-27 18:34:23,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19975 states. [2019-12-27 18:34:23,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19975 states to 19975 states and 61003 transitions. [2019-12-27 18:34:23,766 INFO L78 Accepts]: Start accepts. Automaton has 19975 states and 61003 transitions. Word has length 53 [2019-12-27 18:34:23,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:34:23,767 INFO L462 AbstractCegarLoop]: Abstraction has 19975 states and 61003 transitions. [2019-12-27 18:34:23,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:34:23,767 INFO L276 IsEmpty]: Start isEmpty. Operand 19975 states and 61003 transitions. [2019-12-27 18:34:23,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:34:23,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:34:23,787 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:34:23,787 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 18:34:23,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:34:23,788 INFO L82 PathProgramCache]: Analyzing trace with hash -2130494140, now seen corresponding path program 1 times [2019-12-27 18:34:23,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:34:23,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598328516] [2019-12-27 18:34:23,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:34:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:34:23,908 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 18:34:23,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598328516] [2019-12-27 18:34:23,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:34:23,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:34:23,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [860960907] [2019-12-27 18:34:23,909 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:34:23,921 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:34:24,122 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 201 states and 382 transitions. [2019-12-27 18:34:24,122 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:34:24,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:34:24,328 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 18:34:24,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:34:24,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:34:24,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:34:24,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:34:24,331 INFO L87 Difference]: Start difference. First operand 19975 states and 61003 transitions. Second operand 13 states. [2019-12-27 18:34:27,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:34:27,427 INFO L93 Difference]: Finished difference Result 32918 states and 98862 transitions. [2019-12-27 18:34:27,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 18:34:27,428 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 18:34:27,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:34:27,474 INFO L225 Difference]: With dead ends: 32918 [2019-12-27 18:34:27,474 INFO L226 Difference]: Without dead ends: 32782 [2019-12-27 18:34:27,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 13 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=221, Invalid=771, Unknown=0, NotChecked=0, Total=992 [2019-12-27 18:34:27,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32782 states. [2019-12-27 18:34:27,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32782 to 21812. [2019-12-27 18:34:27,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21812 states. [2019-12-27 18:34:27,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21812 states to 21812 states and 66187 transitions. [2019-12-27 18:34:27,885 INFO L78 Accepts]: Start accepts. Automaton has 21812 states and 66187 transitions. Word has length 54 [2019-12-27 18:34:27,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:34:27,886 INFO L462 AbstractCegarLoop]: Abstraction has 21812 states and 66187 transitions. [2019-12-27 18:34:27,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:34:27,886 INFO L276 IsEmpty]: Start isEmpty. Operand 21812 states and 66187 transitions. [2019-12-27 18:34:27,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:34:27,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:34:27,918 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:34:27,918 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 18:34:27,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:34:27,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1027069858, now seen corresponding path program 2 times [2019-12-27 18:34:27,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:34:27,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141683812] [2019-12-27 18:34:27,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:34:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:34:28,413 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 18:34:28,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141683812] [2019-12-27 18:34:28,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:34:28,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 18:34:28,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1378696007] [2019-12-27 18:34:28,418 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:34:28,433 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:34:28,796 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 346 transitions. [2019-12-27 18:34:28,796 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:34:29,385 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 18:34:29,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 18:34:29,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:34:29,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 18:34:29,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-12-27 18:34:29,386 INFO L87 Difference]: Start difference. First operand 21812 states and 66187 transitions. Second operand 23 states. [2019-12-27 18:34:36,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:34:36,296 INFO L93 Difference]: Finished difference Result 55651 states and 166804 transitions. [2019-12-27 18:34:36,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-27 18:34:36,296 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2019-12-27 18:34:36,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:34:36,368 INFO L225 Difference]: With dead ends: 55651 [2019-12-27 18:34:36,368 INFO L226 Difference]: Without dead ends: 49157 [2019-12-27 18:34:36,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 12 SyntacticMatches, 15 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1297 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=730, Invalid=4240, Unknown=0, NotChecked=0, Total=4970 [2019-12-27 18:34:36,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49157 states. [2019-12-27 18:34:36,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49157 to 22392. [2019-12-27 18:34:36,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22392 states. [2019-12-27 18:34:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22392 states to 22392 states and 67612 transitions. [2019-12-27 18:34:37,224 INFO L78 Accepts]: Start accepts. Automaton has 22392 states and 67612 transitions. Word has length 54 [2019-12-27 18:34:37,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:34:37,224 INFO L462 AbstractCegarLoop]: Abstraction has 22392 states and 67612 transitions. [2019-12-27 18:34:37,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 18:34:37,224 INFO L276 IsEmpty]: Start isEmpty. Operand 22392 states and 67612 transitions. [2019-12-27 18:34:37,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:34:37,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:34:37,249 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:34:37,249 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 18:34:37,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:34:37,250 INFO L82 PathProgramCache]: Analyzing trace with hash 414061482, now seen corresponding path program 3 times [2019-12-27 18:34:37,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:34:37,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378516242] [2019-12-27 18:34:37,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:34:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:34:37,694 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 18:34:37,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378516242] [2019-12-27 18:34:37,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:34:37,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 18:34:37,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1520748725] [2019-12-27 18:34:37,695 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:34:37,707 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:34:37,856 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 177 states and 326 transitions. [2019-12-27 18:34:37,857 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:34:38,416 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 29 times. [2019-12-27 18:34:38,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 18:34:38,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:34:38,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 18:34:38,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-12-27 18:34:38,418 INFO L87 Difference]: Start difference. First operand 22392 states and 67612 transitions. Second operand 23 states. [2019-12-27 18:34:45,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:34:45,427 INFO L93 Difference]: Finished difference Result 51943 states and 155452 transitions. [2019-12-27 18:34:45,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-12-27 18:34:45,427 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2019-12-27 18:34:45,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:34:45,500 INFO L225 Difference]: With dead ends: 51943 [2019-12-27 18:34:45,500 INFO L226 Difference]: Without dead ends: 49775 [2019-12-27 18:34:45,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 12 SyntacticMatches, 14 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=809, Invalid=4447, Unknown=0, NotChecked=0, Total=5256 [2019-12-27 18:34:45,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49775 states. [2019-12-27 18:34:46,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49775 to 22488. [2019-12-27 18:34:46,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22488 states. [2019-12-27 18:34:46,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22488 states to 22488 states and 67848 transitions. [2019-12-27 18:34:46,269 INFO L78 Accepts]: Start accepts. Automaton has 22488 states and 67848 transitions. Word has length 54 [2019-12-27 18:34:46,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:34:46,269 INFO L462 AbstractCegarLoop]: Abstraction has 22488 states and 67848 transitions. [2019-12-27 18:34:46,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 18:34:46,269 INFO L276 IsEmpty]: Start isEmpty. Operand 22488 states and 67848 transitions. [2019-12-27 18:34:46,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:34:46,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:34:46,299 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:34:46,299 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 18:34:46,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:34:46,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1398179606, now seen corresponding path program 4 times [2019-12-27 18:34:46,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:34:46,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272407252] [2019-12-27 18:34:46,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:34:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:34:46,692 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 18:34:46,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272407252] [2019-12-27 18:34:46,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:34:46,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 18:34:46,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [191273403] [2019-12-27 18:34:46,693 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:34:46,704 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:34:46,898 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 214 states and 414 transitions. [2019-12-27 18:34:46,899 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:34:47,480 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 18:34:47,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 18:34:47,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:34:47,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 18:34:47,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-12-27 18:34:47,481 INFO L87 Difference]: Start difference. First operand 22488 states and 67848 transitions. Second operand 22 states. [2019-12-27 18:34:53,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:34:53,270 INFO L93 Difference]: Finished difference Result 38028 states and 113597 transitions. [2019-12-27 18:34:53,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 18:34:53,271 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 54 [2019-12-27 18:34:53,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:34:53,328 INFO L225 Difference]: With dead ends: 38028 [2019-12-27 18:34:53,328 INFO L226 Difference]: Without dead ends: 37614 [2019-12-27 18:34:53,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 11 SyntacticMatches, 14 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 913 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=574, Invalid=3086, Unknown=0, NotChecked=0, Total=3660 [2019-12-27 18:34:53,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37614 states. [2019-12-27 18:34:54,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37614 to 22344. [2019-12-27 18:34:54,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22344 states. [2019-12-27 18:34:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22344 states to 22344 states and 67476 transitions. [2019-12-27 18:34:54,048 INFO L78 Accepts]: Start accepts. Automaton has 22344 states and 67476 transitions. Word has length 54 [2019-12-27 18:34:54,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:34:54,048 INFO L462 AbstractCegarLoop]: Abstraction has 22344 states and 67476 transitions. [2019-12-27 18:34:54,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 18:34:54,048 INFO L276 IsEmpty]: Start isEmpty. Operand 22344 states and 67476 transitions. [2019-12-27 18:34:54,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:34:54,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:34:54,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, 1, 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 18:34:54,073 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 18:34:54,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:34:54,073 INFO L82 PathProgramCache]: Analyzing trace with hash 792697694, now seen corresponding path program 5 times [2019-12-27 18:34:54,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:34:54,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578974030] [2019-12-27 18:34:54,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:34:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:34:54,514 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 18:34:54,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578974030] [2019-12-27 18:34:54,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:34:54,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 18:34:54,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1610155664] [2019-12-27 18:34:54,517 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:34:54,534 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:34:54,784 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 228 states and 449 transitions. [2019-12-27 18:34:54,784 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:34:56,260 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 36 times. [2019-12-27 18:34:56,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-27 18:34:56,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:34:56,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-27 18:34:56,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2019-12-27 18:34:56,262 INFO L87 Difference]: Start difference. First operand 22344 states and 67476 transitions. Second operand 27 states. [2019-12-27 18:34:56,813 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-12-27 18:35:18,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:35:18,251 INFO L93 Difference]: Finished difference Result 76765 states and 227372 transitions. [2019-12-27 18:35:18,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2019-12-27 18:35:18,251 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 54 [2019-12-27 18:35:18,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:35:18,348 INFO L225 Difference]: With dead ends: 76765 [2019-12-27 18:35:18,348 INFO L226 Difference]: Without dead ends: 71948 [2019-12-27 18:35:18,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 12 SyntacticMatches, 14 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11443 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=4035, Invalid=27117, Unknown=0, NotChecked=0, Total=31152 [2019-12-27 18:35:18,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71948 states. [2019-12-27 18:35:19,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71948 to 31616. [2019-12-27 18:35:19,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31616 states. [2019-12-27 18:35:19,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31616 states to 31616 states and 95150 transitions. [2019-12-27 18:35:19,059 INFO L78 Accepts]: Start accepts. Automaton has 31616 states and 95150 transitions. Word has length 54 [2019-12-27 18:35:19,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:35:19,060 INFO L462 AbstractCegarLoop]: Abstraction has 31616 states and 95150 transitions. [2019-12-27 18:35:19,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-27 18:35:19,060 INFO L276 IsEmpty]: Start isEmpty. Operand 31616 states and 95150 transitions. [2019-12-27 18:35:19,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:35:19,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:35:19,092 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:35:19,092 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 18:35:19,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:35:19,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1760218510, now seen corresponding path program 6 times [2019-12-27 18:35:19,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:35:19,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678454428] [2019-12-27 18:35:19,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:35:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:35:19,576 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 18:35:19,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678454428] [2019-12-27 18:35:19,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:35:19,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 18:35:19,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [236608679] [2019-12-27 18:35:19,577 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:35:19,585 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:35:19,721 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 244 states and 497 transitions. [2019-12-27 18:35:19,721 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:35:20,831 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 48 times. [2019-12-27 18:35:20,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 18:35:20,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:35:20,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 18:35:20,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2019-12-27 18:35:20,832 INFO L87 Difference]: Start difference. First operand 31616 states and 95150 transitions. Second operand 30 states. [2019-12-27 18:35:21,647 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-12-27 18:35:46,261 WARN L192 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2019-12-27 18:35:48,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:35:48,644 INFO L93 Difference]: Finished difference Result 92220 states and 271729 transitions. [2019-12-27 18:35:48,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 236 states. [2019-12-27 18:35:48,645 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2019-12-27 18:35:48,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:35:48,774 INFO L225 Difference]: With dead ends: 92220 [2019-12-27 18:35:48,774 INFO L226 Difference]: Without dead ends: 91388 [2019-12-27 18:35:48,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 18 SyntacticMatches, 21 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25395 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=6843, Invalid=56913, Unknown=0, NotChecked=0, Total=63756 [2019-12-27 18:35:49,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91388 states. [2019-12-27 18:35:49,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91388 to 31664. [2019-12-27 18:35:49,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31664 states. [2019-12-27 18:35:49,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31664 states to 31664 states and 95286 transitions. [2019-12-27 18:35:49,657 INFO L78 Accepts]: Start accepts. Automaton has 31664 states and 95286 transitions. Word has length 54 [2019-12-27 18:35:49,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:35:49,658 INFO L462 AbstractCegarLoop]: Abstraction has 31664 states and 95286 transitions. [2019-12-27 18:35:49,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 18:35:49,658 INFO L276 IsEmpty]: Start isEmpty. Operand 31664 states and 95286 transitions. [2019-12-27 18:35:49,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:35:49,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:35:49,692 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:35:49,693 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 18:35:49,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:35:49,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1391330862, now seen corresponding path program 7 times [2019-12-27 18:35:49,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:35:49,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703167914] [2019-12-27 18:35:49,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:35:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:35:49,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:35:49,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703167914] [2019-12-27 18:35:49,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:35:49,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 18:35:49,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [100971325] [2019-12-27 18:35:49,799 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:35:49,809 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:35:49,939 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 258 transitions. [2019-12-27 18:35:49,939 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:35:50,095 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 18:35:50,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 18:35:50,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:35:50,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 18:35:50,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:35:50,096 INFO L87 Difference]: Start difference. First operand 31664 states and 95286 transitions. Second operand 12 states. [2019-12-27 18:35:51,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:35:51,635 INFO L93 Difference]: Finished difference Result 52493 states and 157388 transitions. [2019-12-27 18:35:51,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 18:35:51,636 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-27 18:35:51,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:35:51,694 INFO L225 Difference]: With dead ends: 52493 [2019-12-27 18:35:51,694 INFO L226 Difference]: Without dead ends: 38549 [2019-12-27 18:35:51,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2019-12-27 18:35:51,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38549 states. [2019-12-27 18:35:52,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38549 to 28943. [2019-12-27 18:35:52,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28943 states. [2019-12-27 18:35:52,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28943 states to 28943 states and 86752 transitions. [2019-12-27 18:35:52,410 INFO L78 Accepts]: Start accepts. Automaton has 28943 states and 86752 transitions. Word has length 54 [2019-12-27 18:35:52,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:35:52,410 INFO L462 AbstractCegarLoop]: Abstraction has 28943 states and 86752 transitions. [2019-12-27 18:35:52,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 18:35:52,410 INFO L276 IsEmpty]: Start isEmpty. Operand 28943 states and 86752 transitions. [2019-12-27 18:35:52,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:35:52,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:35:52,442 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:35:52,442 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 18:35:52,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:35:52,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1687814112, now seen corresponding path program 8 times [2019-12-27 18:35:52,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:35:52,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004202126] [2019-12-27 18:35:52,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:35:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:35:52,617 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 18:35:52,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004202126] [2019-12-27 18:35:52,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:35:52,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 18:35:52,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1916101469] [2019-12-27 18:35:52,618 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:35:52,628 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:35:52,806 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 212 states and 418 transitions. [2019-12-27 18:35:52,806 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:35:52,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:35:52,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:35:53,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:35:53,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:35:53,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 18:35:53,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:35:53,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:35:53,480 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 29 times. [2019-12-27 18:35:53,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 18:35:53,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:35:53,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 18:35:53,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2019-12-27 18:35:53,482 INFO L87 Difference]: Start difference. First operand 28943 states and 86752 transitions. Second operand 25 states. [2019-12-27 18:36:06,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:36:06,267 INFO L93 Difference]: Finished difference Result 89104 states and 261894 transitions. [2019-12-27 18:36:06,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-12-27 18:36:06,268 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 54 [2019-12-27 18:36:06,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:36:06,395 INFO L225 Difference]: With dead ends: 89104 [2019-12-27 18:36:06,395 INFO L226 Difference]: Without dead ends: 89104 [2019-12-27 18:36:06,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3473 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1507, Invalid=9623, Unknown=0, NotChecked=0, Total=11130 [2019-12-27 18:36:06,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89104 states. [2019-12-27 18:36:07,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89104 to 32775. [2019-12-27 18:36:07,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32775 states. [2019-12-27 18:36:07,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32775 states to 32775 states and 97774 transitions. [2019-12-27 18:36:07,322 INFO L78 Accepts]: Start accepts. Automaton has 32775 states and 97774 transitions. Word has length 54 [2019-12-27 18:36:07,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:36:07,322 INFO L462 AbstractCegarLoop]: Abstraction has 32775 states and 97774 transitions. [2019-12-27 18:36:07,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 18:36:07,322 INFO L276 IsEmpty]: Start isEmpty. Operand 32775 states and 97774 transitions. [2019-12-27 18:36:07,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:36:07,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:36:07,359 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:36:07,359 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 18:36:07,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:36:07,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1451766760, now seen corresponding path program 9 times [2019-12-27 18:36:07,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:36:07,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310071645] [2019-12-27 18:36:07,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:36:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:36:07,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 18:36:07,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310071645] [2019-12-27 18:36:07,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:36:07,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 18:36:07,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [895132852] [2019-12-27 18:36:07,579 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:36:07,597 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:36:07,723 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 131 states and 217 transitions. [2019-12-27 18:36:07,724 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:36:07,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 18:36:07,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:36:07,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:36:08,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:36:08,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:36:08,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 18:36:08,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:36:08,308 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 18:36:08,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 18:36:08,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:36:08,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 18:36:08,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2019-12-27 18:36:08,310 INFO L87 Difference]: Start difference. First operand 32775 states and 97774 transitions. Second operand 22 states. [2019-12-27 18:36:13,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:36:13,044 INFO L93 Difference]: Finished difference Result 58476 states and 171218 transitions. [2019-12-27 18:36:13,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 18:36:13,044 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 54 [2019-12-27 18:36:13,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:36:13,144 INFO L225 Difference]: With dead ends: 58476 [2019-12-27 18:36:13,145 INFO L226 Difference]: Without dead ends: 58476 [2019-12-27 18:36:13,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=305, Invalid=1675, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 18:36:13,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58476 states. [2019-12-27 18:36:13,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58476 to 32853. [2019-12-27 18:36:13,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32853 states. [2019-12-27 18:36:13,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32853 states to 32853 states and 98099 transitions. [2019-12-27 18:36:13,808 INFO L78 Accepts]: Start accepts. Automaton has 32853 states and 98099 transitions. Word has length 54 [2019-12-27 18:36:13,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:36:13,809 INFO L462 AbstractCegarLoop]: Abstraction has 32853 states and 98099 transitions. [2019-12-27 18:36:13,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 18:36:13,809 INFO L276 IsEmpty]: Start isEmpty. Operand 32853 states and 98099 transitions. [2019-12-27 18:36:13,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:36:13,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:36:13,845 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:36:13,846 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 18:36:13,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:36:13,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1496564564, now seen corresponding path program 10 times [2019-12-27 18:36:13,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:36:13,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842484277] [2019-12-27 18:36:13,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:36:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:36:14,053 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 18:36:14,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842484277] [2019-12-27 18:36:14,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:36:14,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 18:36:14,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [264944819] [2019-12-27 18:36:14,054 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:36:14,061 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:36:14,148 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 264 transitions. [2019-12-27 18:36:14,148 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:36:14,458 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 18:36:14,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 18:36:14,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:36:14,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 18:36:14,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-12-27 18:36:14,459 INFO L87 Difference]: Start difference. First operand 32853 states and 98099 transitions. Second operand 20 states. [2019-12-27 18:36:23,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:36:23,398 INFO L93 Difference]: Finished difference Result 121086 states and 356226 transitions. [2019-12-27 18:36:23,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-12-27 18:36:23,399 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2019-12-27 18:36:23,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:36:23,572 INFO L225 Difference]: With dead ends: 121086 [2019-12-27 18:36:23,572 INFO L226 Difference]: Without dead ends: 112880 [2019-12-27 18:36:23,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 16 SyntacticMatches, 7 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8969 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3155, Invalid=20101, Unknown=0, NotChecked=0, Total=23256 [2019-12-27 18:36:23,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112880 states. [2019-12-27 18:36:24,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112880 to 36083. [2019-12-27 18:36:24,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36083 states. [2019-12-27 18:36:25,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36083 states to 36083 states and 107762 transitions. [2019-12-27 18:36:25,165 INFO L78 Accepts]: Start accepts. Automaton has 36083 states and 107762 transitions. Word has length 54 [2019-12-27 18:36:25,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:36:25,165 INFO L462 AbstractCegarLoop]: Abstraction has 36083 states and 107762 transitions. [2019-12-27 18:36:25,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 18:36:25,166 INFO L276 IsEmpty]: Start isEmpty. Operand 36083 states and 107762 transitions. [2019-12-27 18:36:25,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:36:25,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:36:25,204 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:36:25,204 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 18:36:25,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:36:25,205 INFO L82 PathProgramCache]: Analyzing trace with hash -139497916, now seen corresponding path program 11 times [2019-12-27 18:36:25,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:36:25,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065124145] [2019-12-27 18:36:25,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:36:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:36:25,251 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 18:36:25,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065124145] [2019-12-27 18:36:25,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:36:25,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:36:25,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1969281618] [2019-12-27 18:36:25,252 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:36:25,262 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:36:25,420 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 179 states and 317 transitions. [2019-12-27 18:36:25,420 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:36:25,421 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:36:25,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:36:25,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:36:25,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:36:25,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:36:25,422 INFO L87 Difference]: Start difference. First operand 36083 states and 107762 transitions. Second operand 3 states. [2019-12-27 18:36:25,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:36:25,537 INFO L93 Difference]: Finished difference Result 36081 states and 107757 transitions. [2019-12-27 18:36:25,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:36:25,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 18:36:25,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:36:25,588 INFO L225 Difference]: With dead ends: 36081 [2019-12-27 18:36:25,588 INFO L226 Difference]: Without dead ends: 36081 [2019-12-27 18:36:25,588 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 18:36:25,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36081 states. [2019-12-27 18:36:26,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36081 to 32844. [2019-12-27 18:36:26,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32844 states. [2019-12-27 18:36:26,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32844 states to 32844 states and 99102 transitions. [2019-12-27 18:36:26,078 INFO L78 Accepts]: Start accepts. Automaton has 32844 states and 99102 transitions. Word has length 54 [2019-12-27 18:36:26,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:36:26,078 INFO L462 AbstractCegarLoop]: Abstraction has 32844 states and 99102 transitions. [2019-12-27 18:36:26,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:36:26,078 INFO L276 IsEmpty]: Start isEmpty. Operand 32844 states and 99102 transitions. [2019-12-27 18:36:26,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 18:36:26,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:36:26,112 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 18:36:26,112 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 18:36:26,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:36:26,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1678920401, now seen corresponding path program 1 times [2019-12-27 18:36:26,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:36:26,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382433619] [2019-12-27 18:36:26,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:36:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:36:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:36:26,262 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:36:26,263 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:36:26,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_531) (= 0 |v_ULTIMATE.start_main_~#t2348~0.offset_18|) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= 0 v_~x$r_buff1_thd3~0_123) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2348~0.base_24|)) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2348~0.base_24| 4)) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2348~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2348~0.base_24|) |v_ULTIMATE.start_main_~#t2348~0.offset_18| 0)) |v_#memory_int_23|) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~x~0_214) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2348~0.base_24| 1)) (= v_~__unbuffered_cnt~0_139 0) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= v_~x$r_buff1_thd0~0_132 0) (= 0 v_~x$w_buff0_used~0_899) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2348~0.base_24|) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ULTIMATE.start_main_~#t2348~0.base=|v_ULTIMATE.start_main_~#t2348~0.base_24|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ULTIMATE.start_main_~#t2349~0.base=|v_ULTIMATE.start_main_~#t2349~0.base_26|, ULTIMATE.start_main_~#t2349~0.offset=|v_ULTIMATE.start_main_~#t2349~0.offset_19|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ~y~0=v_~y~0_70, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ULTIMATE.start_main_~#t2350~0.offset=|v_ULTIMATE.start_main_~#t2350~0.offset_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_~#t2350~0.base=|v_ULTIMATE.start_main_~#t2350~0.base_26|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, ULTIMATE.start_main_~#t2348~0.offset=|v_ULTIMATE.start_main_~#t2348~0.offset_18|, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2348~0.base, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t2349~0.base, ULTIMATE.start_main_~#t2349~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2350~0.offset, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2350~0.base, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2348~0.offset, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 18:36:26,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (= |v_ULTIMATE.start_main_~#t2349~0.offset_11| 0) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2349~0.base_13| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2349~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t2349~0.base_13| 0)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2349~0.base_13| 4) |v_#length_15|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2349~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2349~0.base_13|) |v_ULTIMATE.start_main_~#t2349~0.offset_11| 1)) |v_#memory_int_15|) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2349~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2349~0.base=|v_ULTIMATE.start_main_~#t2349~0.base_13|, ULTIMATE.start_main_~#t2349~0.offset=|v_ULTIMATE.start_main_~#t2349~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2349~0.base, ULTIMATE.start_main_~#t2349~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 18:36:26,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2350~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2350~0.base_13|) |v_ULTIMATE.start_main_~#t2350~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2350~0.base_13|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2350~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t2350~0.offset_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2350~0.base_13| 4)) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2350~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t2350~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2350~0.offset=|v_ULTIMATE.start_main_~#t2350~0.offset_11|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2350~0.base=|v_ULTIMATE.start_main_~#t2350~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_~#t2350~0.offset, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2350~0.base] because there is no mapped edge [2019-12-27 18:36:26,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= P1Thread1of1ForFork0_~arg.base_Out-780944295 |P1Thread1of1ForFork0_#in~arg.base_In-780944295|) (= 1 ~x$w_buff0_used~0_Out-780944295) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-780944295| 1) (= |P1Thread1of1ForFork0_#in~arg.offset_In-780944295| P1Thread1of1ForFork0_~arg.offset_Out-780944295) (= ~x$w_buff1_used~0_Out-780944295 ~x$w_buff0_used~0_In-780944295) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-780944295| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-780944295) (= ~x$w_buff1~0_Out-780944295 ~x$w_buff0~0_In-780944295) (= ~x$w_buff0~0_Out-780944295 1) (= (mod ~x$w_buff1_used~0_Out-780944295 256) 0)) InVars {~x$w_buff0~0=~x$w_buff0~0_In-780944295, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-780944295|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-780944295|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-780944295} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out-780944295, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-780944295, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out-780944295, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out-780944295, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-780944295|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-780944295|, ~x$w_buff1~0=~x$w_buff1~0_Out-780944295, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-780944295|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-780944295, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-780944295} 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 18:36:26,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In200770161 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In200770161 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In200770161 |P2Thread1of1ForFork1_#t~ite32_Out200770161|)) (and (= ~x$w_buff1~0_In200770161 |P2Thread1of1ForFork1_#t~ite32_Out200770161|) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In200770161, ~x$w_buff1_used~0=~x$w_buff1_used~0_In200770161, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In200770161, ~x~0=~x~0_In200770161} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out200770161|, ~x$w_buff1~0=~x$w_buff1~0_In200770161, ~x$w_buff1_used~0=~x$w_buff1_used~0_In200770161, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In200770161, ~x~0=~x~0_In200770161} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 18:36:26,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |v_P2Thread1of1ForFork1_#t~ite32_22|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_22|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_21|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_29|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 18:36:26,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In751229604 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In751229604 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In751229604 |P2Thread1of1ForFork1_#t~ite34_Out751229604|)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out751229604|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In751229604, ~x$w_buff0_used~0=~x$w_buff0_used~0_In751229604} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out751229604|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In751229604, ~x$w_buff0_used~0=~x$w_buff0_used~0_In751229604} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 18:36:26,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-527044027 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-527044027 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-527044027| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-527044027| ~x$w_buff0_used~0_In-527044027)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-527044027, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-527044027} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-527044027, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-527044027|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-527044027} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 18:36:26,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In681306 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In681306 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In681306 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In681306 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out681306| ~x$w_buff1_used~0_In681306)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork0_#t~ite29_Out681306| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In681306, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In681306, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In681306, ~x$w_buff0_used~0=~x$w_buff0_used~0_In681306} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In681306, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In681306, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In681306, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out681306|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In681306} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 18:36:26,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1783163202 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1783163202 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In1783163202 ~x$r_buff0_thd2~0_Out1783163202)) (and (= 0 ~x$r_buff0_thd2~0_Out1783163202) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1783163202, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1783163202} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1783163202|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1783163202, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1783163202} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 18:36:26,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In1488398203 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In1488398203 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1488398203 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1488398203 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out1488398203| ~x$r_buff1_thd2~0_In1488398203) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1488398203|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1488398203, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1488398203, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1488398203, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1488398203} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1488398203|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1488398203, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1488398203, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1488398203, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1488398203} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 18:36:26,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_38|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_37|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, 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 18:36:26,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1495977682 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite12_Out-1495977682| |P0Thread1of1ForFork2_#t~ite11_Out-1495977682|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1495977682 256)))) (or (= (mod ~x$w_buff0_used~0_In-1495977682 256) 0) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-1495977682 256) 0)) (and (= 0 (mod ~x$w_buff1_used~0_In-1495977682 256)) .cse1))) (= ~x$w_buff1~0_In-1495977682 |P0Thread1of1ForFork2_#t~ite11_Out-1495977682|)) (and (= ~x$w_buff1~0_In-1495977682 |P0Thread1of1ForFork2_#t~ite12_Out-1495977682|) (= |P0Thread1of1ForFork2_#t~ite11_In-1495977682| |P0Thread1of1ForFork2_#t~ite11_Out-1495977682|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1495977682, ~x$w_buff1~0=~x$w_buff1~0_In-1495977682, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1495977682, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1495977682, ~weak$$choice2~0=~weak$$choice2~0_In-1495977682, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-1495977682|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1495977682} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1495977682, ~x$w_buff1~0=~x$w_buff1~0_In-1495977682, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1495977682, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1495977682, ~weak$$choice2~0=~weak$$choice2~0_In-1495977682, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-1495977682|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-1495977682|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1495977682} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 18:36:26,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1767320567 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite14_Out-1767320567| ~x$w_buff0_used~0_In-1767320567) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-1767320567 256) 0))) (or (and .cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-1767320567 256))) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-1767320567 256))) (= 0 (mod ~x$w_buff0_used~0_In-1767320567 256)))) (= |P0Thread1of1ForFork2_#t~ite14_Out-1767320567| |P0Thread1of1ForFork2_#t~ite15_Out-1767320567|) .cse1) (and (= |P0Thread1of1ForFork2_#t~ite14_In-1767320567| |P0Thread1of1ForFork2_#t~ite14_Out-1767320567|) (= ~x$w_buff0_used~0_In-1767320567 |P0Thread1of1ForFork2_#t~ite15_Out-1767320567|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1767320567, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1767320567, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1767320567, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-1767320567|, ~weak$$choice2~0=~weak$$choice2~0_In-1767320567, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1767320567} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1767320567, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1767320567, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-1767320567|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1767320567, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-1767320567|, ~weak$$choice2~0=~weak$$choice2~0_In-1767320567, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1767320567} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 18:36:26,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In677531019 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite17_In677531019| |P0Thread1of1ForFork2_#t~ite17_Out677531019|) (= ~x$w_buff1_used~0_In677531019 |P0Thread1of1ForFork2_#t~ite18_Out677531019|) (not .cse0)) (and .cse0 (= |P0Thread1of1ForFork2_#t~ite18_Out677531019| |P0Thread1of1ForFork2_#t~ite17_Out677531019|) (= ~x$w_buff1_used~0_In677531019 |P0Thread1of1ForFork2_#t~ite17_Out677531019|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In677531019 256)))) (or (= (mod ~x$w_buff0_used~0_In677531019 256) 0) (and (= 0 (mod ~x$r_buff1_thd1~0_In677531019 256)) .cse1) (and .cse1 (= (mod ~x$w_buff1_used~0_In677531019 256) 0))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In677531019, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In677531019|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In677531019, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In677531019, ~weak$$choice2~0=~weak$$choice2~0_In677531019, ~x$w_buff0_used~0=~x$w_buff0_used~0_In677531019} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In677531019, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out677531019|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out677531019|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In677531019, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In677531019, ~weak$$choice2~0=~weak$$choice2~0_In677531019, ~x$w_buff0_used~0=~x$w_buff0_used~0_In677531019} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 18:36:26,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite23_39| |v_P0Thread1of1ForFork2_#t~ite23_40|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_35|) (not (= 0 (mod v_~weak$$choice2~0_142 256))) (= |v_P0Thread1of1ForFork2_#t~ite22_36| |v_P0Thread1of1ForFork2_#t~ite22_35|)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_40|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_36|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_31|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_27|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_35|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_39|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_35|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_15|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 18:36:26,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 18:36:26,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In934820162 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In934820162 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In934820162 256))) (.cse2 (= (mod ~x$r_buff0_thd3~0_In934820162 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out934820162|)) (and (= ~x$w_buff1_used~0_In934820162 |P2Thread1of1ForFork1_#t~ite35_Out934820162|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In934820162, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In934820162, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In934820162, ~x$w_buff0_used~0=~x$w_buff0_used~0_In934820162} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out934820162|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In934820162, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In934820162, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In934820162, ~x$w_buff0_used~0=~x$w_buff0_used~0_In934820162} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 18:36:26,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In439999874 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In439999874 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite36_Out439999874|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In439999874 |P2Thread1of1ForFork1_#t~ite36_Out439999874|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In439999874, ~x$w_buff0_used~0=~x$w_buff0_used~0_In439999874} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out439999874|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In439999874, ~x$w_buff0_used~0=~x$w_buff0_used~0_In439999874} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 18:36:26,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In1640368986 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1640368986 256))) (.cse2 (= (mod ~x$r_buff0_thd3~0_In1640368986 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1640368986 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out1640368986| ~x$r_buff1_thd3~0_In1640368986)) (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out1640368986|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1640368986, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1640368986, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1640368986, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1640368986} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1640368986|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1640368986, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1640368986, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1640368986, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1640368986} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 18:36:26,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_40|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_39|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, 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 18:36:26,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (= 3 v_~__unbuffered_cnt~0_39) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 18:36:26,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1942603826 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1942603826 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out1942603826| ~x~0_In1942603826) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In1942603826 |ULTIMATE.start_main_#t~ite41_Out1942603826|) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1942603826, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1942603826, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1942603826, ~x~0=~x~0_In1942603826} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1942603826|, ~x$w_buff1~0=~x$w_buff1~0_In1942603826, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1942603826, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1942603826, ~x~0=~x~0_In1942603826} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 18:36:26,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 18:36:26,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1282967743 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1282967743 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite43_Out1282967743| 0)) (and (= |ULTIMATE.start_main_#t~ite43_Out1282967743| ~x$w_buff0_used~0_In1282967743) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1282967743, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1282967743} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1282967743, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1282967743|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1282967743} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 18:36:26,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-236225299 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-236225299 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-236225299 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-236225299 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-236225299 |ULTIMATE.start_main_#t~ite44_Out-236225299|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite44_Out-236225299| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-236225299, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-236225299, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-236225299, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-236225299} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-236225299, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-236225299, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-236225299, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-236225299|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-236225299} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 18:36:26,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1763363276 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1763363276 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1763363276|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-1763363276 |ULTIMATE.start_main_#t~ite45_Out-1763363276|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1763363276, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1763363276} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1763363276, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1763363276|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1763363276} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 18:36:26,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-999425425 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-999425425 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-999425425 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-999425425 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-999425425| ~x$r_buff1_thd0~0_In-999425425) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite46_Out-999425425| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-999425425, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-999425425, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-999425425, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-999425425} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-999425425, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-999425425|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-999425425, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-999425425, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-999425425} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 18:36:26,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} 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 18:36:26,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:36:26 BasicIcfg [2019-12-27 18:36:26,380 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:36:26,382 INFO L168 Benchmark]: Toolchain (without parser) took 198196.46 ms. Allocated memory was 137.4 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 100.2 MB in the beginning and 1.1 GB in the end (delta: -980.1 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 18:36:26,382 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 18:36:26,383 INFO L168 Benchmark]: CACSL2BoogieTranslator took 804.65 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 99.8 MB in the beginning and 155.7 MB in the end (delta: -55.9 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2019-12-27 18:36:26,383 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.71 ms. Allocated memory is still 201.9 MB. Free memory was 155.7 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:36:26,384 INFO L168 Benchmark]: Boogie Preprocessor took 51.95 ms. Allocated memory is still 201.9 MB. Free memory was 153.0 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 18:36:26,384 INFO L168 Benchmark]: RCFGBuilder took 849.16 ms. Allocated memory is still 201.9 MB. Free memory was 150.9 MB in the beginning and 103.9 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 7.1 GB. [2019-12-27 18:36:26,385 INFO L168 Benchmark]: TraceAbstraction took 196408.39 ms. Allocated memory was 201.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 103.9 MB in the beginning and 1.1 GB in the end (delta: -976.5 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 18:36:26,387 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.19 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 804.65 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 99.8 MB in the beginning and 155.7 MB in the end (delta: -55.9 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.71 ms. Allocated memory is still 201.9 MB. Free memory was 155.7 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.95 ms. Allocated memory is still 201.9 MB. Free memory was 153.0 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 849.16 ms. Allocated memory is still 201.9 MB. Free memory was 150.9 MB in the beginning and 103.9 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 196408.39 ms. Allocated memory was 201.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 103.9 MB in the beginning and 1.1 GB in the end (delta: -976.5 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 164 ProgramPointsBefore, 83 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 29 ChoiceCompositions, 6837 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 0 MoverChecksTotal, 66430 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2348, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t2349, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] FCALL, FORK 0 pthread_create(&t2350, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 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, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=1] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L741] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=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=1] [L742] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L745] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=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=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 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 [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, 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=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 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 [L833] 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, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 196.1s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 127.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7949 SDtfs, 19569 SDslu, 47953 SDs, 0 SdLazy, 64850 SolverSat, 1569 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 64.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1616 GetRequests, 257 SyntacticMatches, 161 SemanticMatches, 1198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55347 ImplicationChecksByTransitivity, 45.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115962occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 33.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 535646 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1257 NumberOfCodeBlocks, 1257 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1175 ConstructedInterpolants, 0 QuantifiedInterpolants, 291241 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...