/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix051_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:54:56,712 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:54:56,715 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:54:56,733 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:54:56,733 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:54:56,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:54:56,738 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:54:56,751 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:54:56,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:54:56,755 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:54:56,757 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:54:56,759 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:54:56,759 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:54:56,763 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:54:56,764 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:54:56,766 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:54:56,768 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:54:56,770 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:54:56,772 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:54:56,777 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:54:56,781 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:54:56,782 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:54:56,783 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:54:56,784 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:54:56,786 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:54:56,786 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:54:56,786 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:54:56,788 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:54:56,790 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:54:56,791 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:54:56,792 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:54:56,792 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:54:56,793 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:54:56,794 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:54:56,796 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:54:56,796 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:54:56,797 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:54:56,797 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:54:56,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:54:56,801 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:54:56,802 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:54:56,803 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:54:56,824 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:54:56,824 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:54:56,828 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:54:56,828 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:54:56,829 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:54:56,829 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:54:56,829 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:54:56,829 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:54:56,830 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:54:56,830 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:54:56,831 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:54:56,831 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:54:56,831 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:54:56,832 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:54:56,832 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:54:56,832 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:54:56,832 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:54:56,833 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:54:56,833 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:54:56,833 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:54:56,833 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:54:56,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:54:56,834 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:54:56,835 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:54:56,835 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:54:56,835 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:54:56,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:54:56,835 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:54:56,836 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:54:56,836 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:54:57,096 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:54:57,108 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:54:57,112 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:54:57,114 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:54:57,114 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:54:57,115 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_pso.opt.i [2019-12-26 22:54:57,177 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9347a46b4/8d99d5dcf941489388d2260774f5a7bc/FLAG9f2552261 [2019-12-26 22:54:57,740 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:54:57,741 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_pso.opt.i [2019-12-26 22:54:57,755 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9347a46b4/8d99d5dcf941489388d2260774f5a7bc/FLAG9f2552261 [2019-12-26 22:54:58,055 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9347a46b4/8d99d5dcf941489388d2260774f5a7bc [2019-12-26 22:54:58,064 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:54:58,066 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:54:58,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:54:58,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:54:58,071 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:54:58,072 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:54:58" (1/1) ... [2019-12-26 22:54:58,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691f4c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:54:58, skipping insertion in model container [2019-12-26 22:54:58,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:54:58" (1/1) ... [2019-12-26 22:54:58,083 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:54:58,149 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:54:58,681 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:54:58,693 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:54:58,749 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:54:58,838 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:54:58,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:54:58 WrapperNode [2019-12-26 22:54:58,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:54:58,840 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:54:58,840 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:54:58,840 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:54:58,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:54:58" (1/1) ... [2019-12-26 22:54:58,888 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:54:58" (1/1) ... [2019-12-26 22:54:58,927 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:54:58,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:54:58,928 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:54:58,928 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:54:58,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:54:58" (1/1) ... [2019-12-26 22:54:58,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:54:58" (1/1) ... [2019-12-26 22:54:58,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:54:58" (1/1) ... [2019-12-26 22:54:58,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:54:58" (1/1) ... [2019-12-26 22:54:58,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:54:58" (1/1) ... [2019-12-26 22:54:58,972 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:54:58" (1/1) ... [2019-12-26 22:54:58,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:54:58" (1/1) ... [2019-12-26 22:54:58,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:54:58,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:54:58,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:54:58,990 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:54:58,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:54:58" (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-26 22:54:59,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:54:59,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:54:59,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:54:59,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:54:59,045 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:54:59,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:54:59,046 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:54:59,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:54:59,046 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:54:59,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:54:59,046 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-26 22:54:59,047 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-26 22:54:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:54:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:54:59,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:54:59,049 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:54:59,773 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:54:59,773 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:54:59,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:54:59 BoogieIcfgContainer [2019-12-26 22:54:59,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:54:59,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:54:59,776 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:54:59,781 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:54:59,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:54:58" (1/3) ... [2019-12-26 22:54:59,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c96291a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:54:59, skipping insertion in model container [2019-12-26 22:54:59,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:54:58" (2/3) ... [2019-12-26 22:54:59,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c96291a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:54:59, skipping insertion in model container [2019-12-26 22:54:59,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:54:59" (3/3) ... [2019-12-26 22:54:59,786 INFO L109 eAbstractionObserver]: Analyzing ICFG mix051_pso.opt.i [2019-12-26 22:54:59,797 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:54:59,798 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:54:59,815 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:54:59,816 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:54:59,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,875 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,876 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,877 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,878 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,885 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,886 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,945 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,945 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,945 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,946 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,946 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,946 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,946 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,946 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,947 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,947 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,947 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,947 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,948 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,948 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,948 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,948 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,948 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,949 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,949 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,949 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,949 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,949 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,950 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,950 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,950 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,950 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,950 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,950 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,951 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,951 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,951 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,951 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,951 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,952 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,957 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,958 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,964 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,966 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,966 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,966 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,967 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,967 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,967 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,967 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,967 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,967 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,968 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,968 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,974 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,975 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,979 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,979 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:54:59,994 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-26 22:55:00,017 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:55:00,017 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:55:00,017 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:55:00,017 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:55:00,017 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:55:00,018 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:55:00,018 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:55:00,018 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:55:00,034 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 190 transitions [2019-12-26 22:55:00,036 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 168 places, 190 transitions [2019-12-26 22:55:00,141 INFO L132 PetriNetUnfolder]: 35/186 cut-off events. [2019-12-26 22:55:00,141 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:55:00,159 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 186 events. 35/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-26 22:55:00,178 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 168 places, 190 transitions [2019-12-26 22:55:00,270 INFO L132 PetriNetUnfolder]: 35/186 cut-off events. [2019-12-26 22:55:00,270 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:55:00,279 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 186 events. 35/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-26 22:55:00,296 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-26 22:55:00,297 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:55:05,480 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-26 22:55:05,631 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-26 22:55:05,690 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46836 [2019-12-26 22:55:05,690 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-26 22:55:05,695 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 84 transitions [2019-12-26 22:55:07,239 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 24606 states. [2019-12-26 22:55:07,240 INFO L276 IsEmpty]: Start isEmpty. Operand 24606 states. [2019-12-26 22:55:07,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-26 22:55:07,246 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:55:07,247 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:55:07,247 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:55:07,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:55:07,253 INFO L82 PathProgramCache]: Analyzing trace with hash -112021246, now seen corresponding path program 1 times [2019-12-26 22:55:07,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:55:07,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598315302] [2019-12-26 22:55:07,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:55:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:55:07,557 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-26 22:55:07,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598315302] [2019-12-26 22:55:07,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:55:07,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:55:07,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267636653] [2019-12-26 22:55:07,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:55:07,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:55:07,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:55:07,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:55:07,595 INFO L87 Difference]: Start difference. First operand 24606 states. Second operand 3 states. [2019-12-26 22:55:08,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:55:08,211 INFO L93 Difference]: Finished difference Result 23966 states and 104480 transitions. [2019-12-26 22:55:08,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:55:08,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-26 22:55:08,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:55:08,462 INFO L225 Difference]: With dead ends: 23966 [2019-12-26 22:55:08,462 INFO L226 Difference]: Without dead ends: 22574 [2019-12-26 22:55:08,464 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-26 22:55:09,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22574 states. [2019-12-26 22:55:10,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22574 to 22574. [2019-12-26 22:55:10,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22574 states. [2019-12-26 22:55:10,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22574 states to 22574 states and 98268 transitions. [2019-12-26 22:55:10,672 INFO L78 Accepts]: Start accepts. Automaton has 22574 states and 98268 transitions. Word has length 9 [2019-12-26 22:55:10,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:55:10,673 INFO L462 AbstractCegarLoop]: Abstraction has 22574 states and 98268 transitions. [2019-12-26 22:55:10,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:55:10,673 INFO L276 IsEmpty]: Start isEmpty. Operand 22574 states and 98268 transitions. [2019-12-26 22:55:10,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 22:55:10,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:55:10,684 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:55:10,685 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:55:10,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:55:10,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1478915767, now seen corresponding path program 1 times [2019-12-26 22:55:10,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:55:10,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174717426] [2019-12-26 22:55:10,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:55:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:55:10,826 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-26 22:55:10,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174717426] [2019-12-26 22:55:10,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:55:10,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:55:10,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458235353] [2019-12-26 22:55:10,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:55:10,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:55:10,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:55:10,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:55:10,832 INFO L87 Difference]: Start difference. First operand 22574 states and 98268 transitions. Second operand 4 states. [2019-12-26 22:55:12,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:55:12,594 INFO L93 Difference]: Finished difference Result 34006 states and 143332 transitions. [2019-12-26 22:55:12,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:55:12,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-26 22:55:12,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:55:12,781 INFO L225 Difference]: With dead ends: 34006 [2019-12-26 22:55:12,782 INFO L226 Difference]: Without dead ends: 33954 [2019-12-26 22:55:12,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:55:13,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33954 states. [2019-12-26 22:55:13,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33954 to 30266. [2019-12-26 22:55:13,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30266 states. [2019-12-26 22:55:13,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30266 states to 30266 states and 129516 transitions. [2019-12-26 22:55:13,931 INFO L78 Accepts]: Start accepts. Automaton has 30266 states and 129516 transitions. Word has length 15 [2019-12-26 22:55:13,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:55:13,931 INFO L462 AbstractCegarLoop]: Abstraction has 30266 states and 129516 transitions. [2019-12-26 22:55:13,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:55:13,931 INFO L276 IsEmpty]: Start isEmpty. Operand 30266 states and 129516 transitions. [2019-12-26 22:55:13,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-26 22:55:13,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:55:13,940 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:55:13,940 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:55:13,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:55:13,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1507356133, now seen corresponding path program 1 times [2019-12-26 22:55:13,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:55:13,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006929665] [2019-12-26 22:55:13,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:55:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:55:14,016 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-26 22:55:14,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006929665] [2019-12-26 22:55:14,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:55:14,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:55:14,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305422597] [2019-12-26 22:55:14,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:55:14,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:55:14,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:55:14,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:55:14,021 INFO L87 Difference]: Start difference. First operand 30266 states and 129516 transitions. Second operand 3 states. [2019-12-26 22:55:14,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:55:14,527 INFO L93 Difference]: Finished difference Result 39490 states and 165892 transitions. [2019-12-26 22:55:14,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:55:14,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-26 22:55:14,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:55:14,669 INFO L225 Difference]: With dead ends: 39490 [2019-12-26 22:55:14,669 INFO L226 Difference]: Without dead ends: 39490 [2019-12-26 22:55:14,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:55:14,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39490 states. [2019-12-26 22:55:16,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39490 to 32622. [2019-12-26 22:55:16,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32622 states. [2019-12-26 22:55:16,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32622 states to 32622 states and 139128 transitions. [2019-12-26 22:55:16,430 INFO L78 Accepts]: Start accepts. Automaton has 32622 states and 139128 transitions. Word has length 18 [2019-12-26 22:55:16,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:55:16,430 INFO L462 AbstractCegarLoop]: Abstraction has 32622 states and 139128 transitions. [2019-12-26 22:55:16,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:55:16,431 INFO L276 IsEmpty]: Start isEmpty. Operand 32622 states and 139128 transitions. [2019-12-26 22:55:16,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-26 22:55:16,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:55:16,440 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:55:16,440 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:55:16,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:55:16,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1390873323, now seen corresponding path program 1 times [2019-12-26 22:55:16,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:55:16,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964526979] [2019-12-26 22:55:16,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:55:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:55:16,510 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-26 22:55:16,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964526979] [2019-12-26 22:55:16,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:55:16,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:55:16,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104185860] [2019-12-26 22:55:16,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:55:16,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:55:16,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:55:16,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:55:16,513 INFO L87 Difference]: Start difference. First operand 32622 states and 139128 transitions. Second operand 4 states. [2019-12-26 22:55:16,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:55:16,830 INFO L93 Difference]: Finished difference Result 39306 states and 164888 transitions. [2019-12-26 22:55:16,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:55:16,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-26 22:55:16,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:55:16,955 INFO L225 Difference]: With dead ends: 39306 [2019-12-26 22:55:16,955 INFO L226 Difference]: Without dead ends: 39270 [2019-12-26 22:55:16,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:55:17,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39270 states. [2019-12-26 22:55:18,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39270 to 34278. [2019-12-26 22:55:18,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34278 states. [2019-12-26 22:55:18,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34278 states to 34278 states and 145700 transitions. [2019-12-26 22:55:18,639 INFO L78 Accepts]: Start accepts. Automaton has 34278 states and 145700 transitions. Word has length 18 [2019-12-26 22:55:18,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:55:18,640 INFO L462 AbstractCegarLoop]: Abstraction has 34278 states and 145700 transitions. [2019-12-26 22:55:18,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:55:18,640 INFO L276 IsEmpty]: Start isEmpty. Operand 34278 states and 145700 transitions. [2019-12-26 22:55:18,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-26 22:55:18,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:55:18,647 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:55:18,647 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:55:18,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:55:18,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1775846621, now seen corresponding path program 1 times [2019-12-26 22:55:18,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:55:18,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759642797] [2019-12-26 22:55:18,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:55:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:55:18,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:55:18,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759642797] [2019-12-26 22:55:18,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:55:18,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:55:18,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377670148] [2019-12-26 22:55:18,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:55:18,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:55:18,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:55:18,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:55:18,725 INFO L87 Difference]: Start difference. First operand 34278 states and 145700 transitions. Second operand 4 states. [2019-12-26 22:55:19,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:55:19,433 INFO L93 Difference]: Finished difference Result 43030 states and 180576 transitions. [2019-12-26 22:55:19,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:55:19,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-26 22:55:19,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:55:19,553 INFO L225 Difference]: With dead ends: 43030 [2019-12-26 22:55:19,553 INFO L226 Difference]: Without dead ends: 42978 [2019-12-26 22:55:19,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:55:19,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42978 states. [2019-12-26 22:55:20,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42978 to 35550. [2019-12-26 22:55:20,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35550 states. [2019-12-26 22:55:20,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35550 states to 35550 states and 151224 transitions. [2019-12-26 22:55:20,764 INFO L78 Accepts]: Start accepts. Automaton has 35550 states and 151224 transitions. Word has length 18 [2019-12-26 22:55:20,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:55:20,764 INFO L462 AbstractCegarLoop]: Abstraction has 35550 states and 151224 transitions. [2019-12-26 22:55:20,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:55:20,765 INFO L276 IsEmpty]: Start isEmpty. Operand 35550 states and 151224 transitions. [2019-12-26 22:55:20,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-26 22:55:20,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:55:20,776 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] [2019-12-26 22:55:20,777 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:55:20,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:55:20,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1801202898, now seen corresponding path program 1 times [2019-12-26 22:55:20,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:55:20,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322663501] [2019-12-26 22:55:20,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:55:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:55:20,876 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-26 22:55:20,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322663501] [2019-12-26 22:55:20,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:55:20,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:55:20,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477894513] [2019-12-26 22:55:20,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:55:20,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:55:20,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:55:20,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:55:20,878 INFO L87 Difference]: Start difference. First operand 35550 states and 151224 transitions. Second operand 3 states. [2019-12-26 22:55:21,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:55:21,068 INFO L93 Difference]: Finished difference Result 34861 states and 147588 transitions. [2019-12-26 22:55:21,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:55:21,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-26 22:55:21,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:55:21,156 INFO L225 Difference]: With dead ends: 34861 [2019-12-26 22:55:21,156 INFO L226 Difference]: Without dead ends: 34861 [2019-12-26 22:55:21,156 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-26 22:55:23,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34861 states. [2019-12-26 22:55:23,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34861 to 34861. [2019-12-26 22:55:23,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34861 states. [2019-12-26 22:55:23,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34861 states to 34861 states and 147588 transitions. [2019-12-26 22:55:23,573 INFO L78 Accepts]: Start accepts. Automaton has 34861 states and 147588 transitions. Word has length 20 [2019-12-26 22:55:23,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:55:23,574 INFO L462 AbstractCegarLoop]: Abstraction has 34861 states and 147588 transitions. [2019-12-26 22:55:23,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:55:23,574 INFO L276 IsEmpty]: Start isEmpty. Operand 34861 states and 147588 transitions. [2019-12-26 22:55:23,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-26 22:55:23,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:55:23,584 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] [2019-12-26 22:55:23,584 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:55:23,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:55:23,585 INFO L82 PathProgramCache]: Analyzing trace with hash -348621301, now seen corresponding path program 1 times [2019-12-26 22:55:23,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:55:23,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275219553] [2019-12-26 22:55:23,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:55:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:55:23,903 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-26 22:55:23,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275219553] [2019-12-26 22:55:23,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:55:23,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:55:23,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869060685] [2019-12-26 22:55:23,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:55:23,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:55:23,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:55:23,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:55:23,905 INFO L87 Difference]: Start difference. First operand 34861 states and 147588 transitions. Second operand 3 states. [2019-12-26 22:55:24,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:55:24,138 INFO L93 Difference]: Finished difference Result 43058 states and 172870 transitions. [2019-12-26 22:55:24,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:55:24,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-26 22:55:24,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:55:24,225 INFO L225 Difference]: With dead ends: 43058 [2019-12-26 22:55:24,225 INFO L226 Difference]: Without dead ends: 35385 [2019-12-26 22:55:24,225 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-26 22:55:24,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35385 states. [2019-12-26 22:55:26,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35385 to 34652. [2019-12-26 22:55:26,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34652 states. [2019-12-26 22:55:26,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34652 states to 34652 states and 138117 transitions. [2019-12-26 22:55:26,878 INFO L78 Accepts]: Start accepts. Automaton has 34652 states and 138117 transitions. Word has length 21 [2019-12-26 22:55:26,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:55:26,879 INFO L462 AbstractCegarLoop]: Abstraction has 34652 states and 138117 transitions. [2019-12-26 22:55:26,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:55:26,879 INFO L276 IsEmpty]: Start isEmpty. Operand 34652 states and 138117 transitions. [2019-12-26 22:55:26,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-26 22:55:26,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:55:26,890 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] [2019-12-26 22:55:26,890 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:55:26,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:55:26,890 INFO L82 PathProgramCache]: Analyzing trace with hash 281464718, now seen corresponding path program 1 times [2019-12-26 22:55:26,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:55:26,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776326011] [2019-12-26 22:55:26,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:55:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:55:26,983 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-26 22:55:26,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776326011] [2019-12-26 22:55:26,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:55:26,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:55:26,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152262553] [2019-12-26 22:55:26,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:55:26,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:55:26,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:55:26,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:55:26,986 INFO L87 Difference]: Start difference. First operand 34652 states and 138117 transitions. Second operand 5 states. [2019-12-26 22:55:27,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:55:27,145 INFO L93 Difference]: Finished difference Result 15467 states and 50655 transitions. [2019-12-26 22:55:27,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:55:27,145 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-26 22:55:27,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:55:27,169 INFO L225 Difference]: With dead ends: 15467 [2019-12-26 22:55:27,169 INFO L226 Difference]: Without dead ends: 13028 [2019-12-26 22:55:27,170 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-26 22:55:27,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13028 states. [2019-12-26 22:55:27,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13028 to 13028. [2019-12-26 22:55:27,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13028 states. [2019-12-26 22:55:27,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13028 states to 13028 states and 41754 transitions. [2019-12-26 22:55:27,373 INFO L78 Accepts]: Start accepts. Automaton has 13028 states and 41754 transitions. Word has length 21 [2019-12-26 22:55:27,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:55:27,373 INFO L462 AbstractCegarLoop]: Abstraction has 13028 states and 41754 transitions. [2019-12-26 22:55:27,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:55:27,374 INFO L276 IsEmpty]: Start isEmpty. Operand 13028 states and 41754 transitions. [2019-12-26 22:55:27,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 22:55:27,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:55:27,378 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-26 22:55:27,379 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:55:27,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:55:27,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1933146031, now seen corresponding path program 1 times [2019-12-26 22:55:27,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:55:27,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610828407] [2019-12-26 22:55:27,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:55:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:55:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:55:27,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610828407] [2019-12-26 22:55:27,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:55:27,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:55:27,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727538904] [2019-12-26 22:55:27,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:55:27,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:55:27,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:55:27,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:55:27,456 INFO L87 Difference]: Start difference. First operand 13028 states and 41754 transitions. Second operand 6 states. [2019-12-26 22:55:27,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:55:27,558 INFO L93 Difference]: Finished difference Result 4493 states and 12952 transitions. [2019-12-26 22:55:27,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:55:27,558 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-26 22:55:27,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:55:27,565 INFO L225 Difference]: With dead ends: 4493 [2019-12-26 22:55:27,565 INFO L226 Difference]: Without dead ends: 3671 [2019-12-26 22:55:27,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:55:27,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3671 states. [2019-12-26 22:55:27,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3671 to 3631. [2019-12-26 22:55:27,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3631 states. [2019-12-26 22:55:27,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3631 states to 3631 states and 10398 transitions. [2019-12-26 22:55:27,616 INFO L78 Accepts]: Start accepts. Automaton has 3631 states and 10398 transitions. Word has length 22 [2019-12-26 22:55:27,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:55:27,616 INFO L462 AbstractCegarLoop]: Abstraction has 3631 states and 10398 transitions. [2019-12-26 22:55:27,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:55:27,617 INFO L276 IsEmpty]: Start isEmpty. Operand 3631 states and 10398 transitions. [2019-12-26 22:55:27,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-26 22:55:27,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:55:27,621 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:55:27,621 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:55:27,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:55:27,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1547062574, now seen corresponding path program 1 times [2019-12-26 22:55:27,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:55:27,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677687210] [2019-12-26 22:55:27,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:55:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:55:27,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:55:27,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677687210] [2019-12-26 22:55:27,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:55:27,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:55:27,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346386637] [2019-12-26 22:55:27,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:55:27,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:55:27,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:55:27,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:55:27,701 INFO L87 Difference]: Start difference. First operand 3631 states and 10398 transitions. Second operand 5 states. [2019-12-26 22:55:27,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:55:27,912 INFO L93 Difference]: Finished difference Result 4581 states and 12744 transitions. [2019-12-26 22:55:27,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:55:27,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-26 22:55:27,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:55:27,920 INFO L225 Difference]: With dead ends: 4581 [2019-12-26 22:55:27,920 INFO L226 Difference]: Without dead ends: 4518 [2019-12-26 22:55:27,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:55:27,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4518 states. [2019-12-26 22:55:27,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4518 to 3815. [2019-12-26 22:55:27,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3815 states. [2019-12-26 22:55:27,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3815 states to 3815 states and 10890 transitions. [2019-12-26 22:55:27,990 INFO L78 Accepts]: Start accepts. Automaton has 3815 states and 10890 transitions. Word has length 31 [2019-12-26 22:55:27,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:55:27,990 INFO L462 AbstractCegarLoop]: Abstraction has 3815 states and 10890 transitions. [2019-12-26 22:55:27,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:55:27,990 INFO L276 IsEmpty]: Start isEmpty. Operand 3815 states and 10890 transitions. [2019-12-26 22:55:27,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-26 22:55:27,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:55:27,998 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:55:27,998 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:55:27,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:55:27,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1138439690, now seen corresponding path program 1 times [2019-12-26 22:55:27,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:55:27,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554863156] [2019-12-26 22:55:27,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:55:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:55:28,042 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-26 22:55:28,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554863156] [2019-12-26 22:55:28,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:55:28,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:55:28,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991008997] [2019-12-26 22:55:28,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:55:28,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:55:28,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:55:28,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:55:28,044 INFO L87 Difference]: Start difference. First operand 3815 states and 10890 transitions. Second operand 3 states. [2019-12-26 22:55:28,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:55:28,092 INFO L93 Difference]: Finished difference Result 4631 states and 12615 transitions. [2019-12-26 22:55:28,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:55:28,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-26 22:55:28,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:55:28,100 INFO L225 Difference]: With dead ends: 4631 [2019-12-26 22:55:28,100 INFO L226 Difference]: Without dead ends: 4631 [2019-12-26 22:55:28,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:55:28,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4631 states. [2019-12-26 22:55:28,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4631 to 3773. [2019-12-26 22:55:28,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3773 states. [2019-12-26 22:55:28,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3773 states to 3773 states and 10352 transitions. [2019-12-26 22:55:28,327 INFO L78 Accepts]: Start accepts. Automaton has 3773 states and 10352 transitions. Word has length 31 [2019-12-26 22:55:28,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:55:28,328 INFO L462 AbstractCegarLoop]: Abstraction has 3773 states and 10352 transitions. [2019-12-26 22:55:28,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:55:28,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3773 states and 10352 transitions. [2019-12-26 22:55:28,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-26 22:55:28,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:55:28,336 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] [2019-12-26 22:55:28,336 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:55:28,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:55:28,336 INFO L82 PathProgramCache]: Analyzing trace with hash -402711057, now seen corresponding path program 1 times [2019-12-26 22:55:28,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:55:28,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912655512] [2019-12-26 22:55:28,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:55:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:55:28,419 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-26 22:55:28,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912655512] [2019-12-26 22:55:28,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:55:28,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:55:28,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424783795] [2019-12-26 22:55:28,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:55:28,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:55:28,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:55:28,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:55:28,422 INFO L87 Difference]: Start difference. First operand 3773 states and 10352 transitions. Second operand 4 states. [2019-12-26 22:55:28,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:55:28,457 INFO L93 Difference]: Finished difference Result 5634 states and 15079 transitions. [2019-12-26 22:55:28,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:55:28,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-12-26 22:55:28,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:55:28,465 INFO L225 Difference]: With dead ends: 5634 [2019-12-26 22:55:28,465 INFO L226 Difference]: Without dead ends: 3795 [2019-12-26 22:55:28,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:55:28,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3795 states. [2019-12-26 22:55:28,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3795 to 3761. [2019-12-26 22:55:28,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3761 states. [2019-12-26 22:55:28,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3761 states to 3761 states and 10166 transitions. [2019-12-26 22:55:28,530 INFO L78 Accepts]: Start accepts. Automaton has 3761 states and 10166 transitions. Word has length 32 [2019-12-26 22:55:28,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:55:28,531 INFO L462 AbstractCegarLoop]: Abstraction has 3761 states and 10166 transitions. [2019-12-26 22:55:28,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:55:28,531 INFO L276 IsEmpty]: Start isEmpty. Operand 3761 states and 10166 transitions. [2019-12-26 22:55:28,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-26 22:55:28,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:55:28,538 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] [2019-12-26 22:55:28,538 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:55:28,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:55:28,539 INFO L82 PathProgramCache]: Analyzing trace with hash 924309407, now seen corresponding path program 2 times [2019-12-26 22:55:28,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:55:28,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44625406] [2019-12-26 22:55:28,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:55:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:55:28,626 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-26 22:55:28,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44625406] [2019-12-26 22:55:28,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:55:28,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:55:28,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196285279] [2019-12-26 22:55:28,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:55:28,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:55:28,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:55:28,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:55:28,629 INFO L87 Difference]: Start difference. First operand 3761 states and 10166 transitions. Second operand 5 states. [2019-12-26 22:55:29,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:55:29,090 INFO L93 Difference]: Finished difference Result 5566 states and 14943 transitions. [2019-12-26 22:55:29,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:55:29,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-26 22:55:29,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:55:29,098 INFO L225 Difference]: With dead ends: 5566 [2019-12-26 22:55:29,099 INFO L226 Difference]: Without dead ends: 5566 [2019-12-26 22:55:29,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:55:29,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5566 states. [2019-12-26 22:55:29,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5566 to 4775. [2019-12-26 22:55:29,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4775 states. [2019-12-26 22:55:29,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4775 states to 4775 states and 13018 transitions. [2019-12-26 22:55:29,162 INFO L78 Accepts]: Start accepts. Automaton has 4775 states and 13018 transitions. Word has length 32 [2019-12-26 22:55:29,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:55:29,162 INFO L462 AbstractCegarLoop]: Abstraction has 4775 states and 13018 transitions. [2019-12-26 22:55:29,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:55:29,163 INFO L276 IsEmpty]: Start isEmpty. Operand 4775 states and 13018 transitions. [2019-12-26 22:55:29,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 22:55:29,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:55:29,169 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:55:29,169 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:55:29,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:55:29,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1471954053, now seen corresponding path program 1 times [2019-12-26 22:55:29,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:55:29,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573863676] [2019-12-26 22:55:29,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:55:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:55:29,227 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-26 22:55:29,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573863676] [2019-12-26 22:55:29,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:55:29,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:55:29,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298560901] [2019-12-26 22:55:29,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:55:29,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:55:29,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:55:29,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:55:29,229 INFO L87 Difference]: Start difference. First operand 4775 states and 13018 transitions. Second operand 5 states. [2019-12-26 22:55:29,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:55:29,441 INFO L93 Difference]: Finished difference Result 5558 states and 14896 transitions. [2019-12-26 22:55:29,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:55:29,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-26 22:55:29,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:55:29,449 INFO L225 Difference]: With dead ends: 5558 [2019-12-26 22:55:29,449 INFO L226 Difference]: Without dead ends: 5475 [2019-12-26 22:55:29,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:55:29,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5475 states. [2019-12-26 22:55:29,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5475 to 4607. [2019-12-26 22:55:29,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4607 states. [2019-12-26 22:55:29,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4607 states to 4607 states and 12605 transitions. [2019-12-26 22:55:29,506 INFO L78 Accepts]: Start accepts. Automaton has 4607 states and 12605 transitions. Word has length 33 [2019-12-26 22:55:29,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:55:29,507 INFO L462 AbstractCegarLoop]: Abstraction has 4607 states and 12605 transitions. [2019-12-26 22:55:29,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:55:29,507 INFO L276 IsEmpty]: Start isEmpty. Operand 4607 states and 12605 transitions. [2019-12-26 22:55:29,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 22:55:29,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:55:29,513 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:55:29,513 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:55:29,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:55:29,514 INFO L82 PathProgramCache]: Analyzing trace with hash 905925005, now seen corresponding path program 1 times [2019-12-26 22:55:29,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:55:29,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816710212] [2019-12-26 22:55:29,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:55:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:55:29,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:55:29,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816710212] [2019-12-26 22:55:29,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:55:29,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:55:29,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672444276] [2019-12-26 22:55:29,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:55:29,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:55:29,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:55:29,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:55:29,599 INFO L87 Difference]: Start difference. First operand 4607 states and 12605 transitions. Second operand 7 states. [2019-12-26 22:55:29,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:55:29,752 INFO L93 Difference]: Finished difference Result 3755 states and 10518 transitions. [2019-12-26 22:55:29,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:55:29,753 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-26 22:55:29,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:55:29,760 INFO L225 Difference]: With dead ends: 3755 [2019-12-26 22:55:29,760 INFO L226 Difference]: Without dead ends: 2551 [2019-12-26 22:55:29,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:55:29,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2551 states. [2019-12-26 22:55:29,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2551 to 2185. [2019-12-26 22:55:29,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2185 states. [2019-12-26 22:55:29,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2185 states to 2185 states and 5946 transitions. [2019-12-26 22:55:29,813 INFO L78 Accepts]: Start accepts. Automaton has 2185 states and 5946 transitions. Word has length 33 [2019-12-26 22:55:29,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:55:29,814 INFO L462 AbstractCegarLoop]: Abstraction has 2185 states and 5946 transitions. [2019-12-26 22:55:29,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:55:29,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 5946 transitions. [2019-12-26 22:55:29,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-26 22:55:29,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:55:29,821 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] [2019-12-26 22:55:29,821 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:55:29,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:55:29,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1054276201, now seen corresponding path program 1 times [2019-12-26 22:55:29,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:55:29,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664065375] [2019-12-26 22:55:29,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:55:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:55:29,886 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-26 22:55:29,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664065375] [2019-12-26 22:55:29,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:55:29,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:55:29,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164257882] [2019-12-26 22:55:29,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:55:29,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:55:29,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:55:29,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:55:29,888 INFO L87 Difference]: Start difference. First operand 2185 states and 5946 transitions. Second operand 4 states. [2019-12-26 22:55:29,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:55:29,928 INFO L93 Difference]: Finished difference Result 2809 states and 7264 transitions. [2019-12-26 22:55:29,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:55:29,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-12-26 22:55:29,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:55:29,930 INFO L225 Difference]: With dead ends: 2809 [2019-12-26 22:55:29,931 INFO L226 Difference]: Without dead ends: 696 [2019-12-26 22:55:29,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:55:29,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2019-12-26 22:55:29,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 696. [2019-12-26 22:55:29,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-12-26 22:55:29,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1448 transitions. [2019-12-26 22:55:29,945 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1448 transitions. Word has length 46 [2019-12-26 22:55:29,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:55:29,945 INFO L462 AbstractCegarLoop]: Abstraction has 696 states and 1448 transitions. [2019-12-26 22:55:29,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:55:29,945 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1448 transitions. [2019-12-26 22:55:29,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-26 22:55:29,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:55:29,948 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] [2019-12-26 22:55:29,948 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:55:29,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:55:29,949 INFO L82 PathProgramCache]: Analyzing trace with hash 401636329, now seen corresponding path program 2 times [2019-12-26 22:55:29,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:55:29,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052166370] [2019-12-26 22:55:29,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:55:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:55:30,067 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-26 22:55:30,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052166370] [2019-12-26 22:55:30,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:55:30,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:55:30,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41176153] [2019-12-26 22:55:30,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:55:30,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:55:30,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:55:30,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:55:30,069 INFO L87 Difference]: Start difference. First operand 696 states and 1448 transitions. Second operand 7 states. [2019-12-26 22:55:30,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:55:30,257 INFO L93 Difference]: Finished difference Result 1132 states and 2298 transitions. [2019-12-26 22:55:30,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 22:55:30,258 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2019-12-26 22:55:30,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:55:30,259 INFO L225 Difference]: With dead ends: 1132 [2019-12-26 22:55:30,259 INFO L226 Difference]: Without dead ends: 737 [2019-12-26 22:55:30,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:55:30,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-12-26 22:55:30,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 693. [2019-12-26 22:55:30,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2019-12-26 22:55:30,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1419 transitions. [2019-12-26 22:55:30,268 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1419 transitions. Word has length 46 [2019-12-26 22:55:30,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:55:30,268 INFO L462 AbstractCegarLoop]: Abstraction has 693 states and 1419 transitions. [2019-12-26 22:55:30,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:55:30,268 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1419 transitions. [2019-12-26 22:55:30,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-26 22:55:30,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:55:30,270 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] [2019-12-26 22:55:30,270 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:55:30,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:55:30,271 INFO L82 PathProgramCache]: Analyzing trace with hash -683037313, now seen corresponding path program 3 times [2019-12-26 22:55:30,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:55:30,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685984306] [2019-12-26 22:55:30,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:55:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:55:30,368 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-26 22:55:30,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685984306] [2019-12-26 22:55:30,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:55:30,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:55:30,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366856178] [2019-12-26 22:55:30,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:55:30,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:55:30,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:55:30,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:55:30,373 INFO L87 Difference]: Start difference. First operand 693 states and 1419 transitions. Second operand 3 states. [2019-12-26 22:55:30,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:55:30,389 INFO L93 Difference]: Finished difference Result 691 states and 1414 transitions. [2019-12-26 22:55:30,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:55:30,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-12-26 22:55:30,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:55:30,391 INFO L225 Difference]: With dead ends: 691 [2019-12-26 22:55:30,391 INFO L226 Difference]: Without dead ends: 691 [2019-12-26 22:55:30,391 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-26 22:55:30,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-12-26 22:55:30,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 576. [2019-12-26 22:55:30,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-26 22:55:30,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1194 transitions. [2019-12-26 22:55:30,401 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1194 transitions. Word has length 46 [2019-12-26 22:55:30,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:55:30,401 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 1194 transitions. [2019-12-26 22:55:30,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:55:30,401 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1194 transitions. [2019-12-26 22:55:30,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-26 22:55:30,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:55:30,403 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] [2019-12-26 22:55:30,403 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:55:30,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:55:30,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1677183059, now seen corresponding path program 1 times [2019-12-26 22:55:30,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:55:30,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34635970] [2019-12-26 22:55:30,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:55:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:55:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:55:30,570 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:55:30,570 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:55:30,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= 0 v_~z$r_buff0_thd4~0_184) (= 0 v_~__unbuffered_p2_EAX~0_43) (= v_~z$mem_tmp~0_33 0) (= 0 v_~z$r_buff0_thd3~0_318) (= 0 v_~z$r_buff1_thd4~0_160) (= v_~weak$$choice2~0_130 0) (= v_~z$read_delayed~0_8 0) (= v_~main$tmp_guard0~0_27 0) (= v_~z$read_delayed_var~0.base_8 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1365~0.base_36|)) (= 0 v_~z$r_buff1_thd1~0_92) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p1_EAX~0_54) (= (store |v_#length_28| |v_ULTIMATE.start_main_~#t1365~0.base_36| 4) |v_#length_27|) (= v_~z$r_buff1_thd0~0_160 0) (= 0 v_~z$r_buff1_thd2~0_92) (= 0 v_~weak$$choice0~0_21) (= (store .cse0 |v_ULTIMATE.start_main_~#t1365~0.base_36| 1) |v_#valid_83|) (= 0 v_~z$r_buff1_thd3~0_237) (= v_~__unbuffered_p3_EAX~0_110 0) (= 0 v_~z$flush_delayed~0_68) (= v_~z$w_buff1_used~0_386 0) (= v_~x~0_77 0) (= v_~z~0_154 0) (= v_~y~0_44 0) (= |v_#NULL.offset_5| 0) (= v_~a~0_69 0) (= v_~__unbuffered_cnt~0_186 0) (= 0 |v_ULTIMATE.start_main_~#t1365~0.offset_23|) (= v_~z$r_buff0_thd1~0_47 0) (= v_~z$w_buff0~0_354 0) (= v_~z$w_buff1~0_215 0) (= v_~z$w_buff0_used~0_630 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1365~0.base_36|) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1365~0.base_36| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1365~0.base_36|) |v_ULTIMATE.start_main_~#t1365~0.offset_23| 0))) (= v_~z$r_buff0_thd2~0_47 0) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$r_buff0_thd0~0_122 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_20|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ULTIMATE.start_main_~#t1367~0.offset=|v_ULTIMATE.start_main_~#t1367~0.offset_24|, ULTIMATE.start_main_~#t1366~0.base=|v_ULTIMATE.start_main_~#t1366~0.base_37|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_92, #NULL.offset=|v_#NULL.offset_5|, ~a~0=v_~a~0_69, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_122, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_184, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_110, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_43, ~z$mem_tmp~0=v_~z$mem_tmp~0_33, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_35|, ULTIMATE.start_main_~#t1365~0.offset=|v_ULTIMATE.start_main_~#t1365~0.offset_23|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_386, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_54|, ~z$flush_delayed~0=v_~z$flush_delayed~0_68, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_33|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_92, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_318, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_186, ~x~0=v_~x~0_77, ULTIMATE.start_main_~#t1365~0.base=|v_ULTIMATE.start_main_~#t1365~0.base_36|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_160, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_8|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_14|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_215, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_160, ULTIMATE.start_main_~#t1366~0.offset=|v_ULTIMATE.start_main_~#t1366~0.offset_24|, ~y~0=v_~y~0_44, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_630, ~z$w_buff0~0=v_~z$w_buff0~0_354, ULTIMATE.start_main_~#t1368~0.base=|v_ULTIMATE.start_main_~#t1368~0.base_17|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_43|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_33|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t1367~0.base=|v_ULTIMATE.start_main_~#t1367~0.base_37|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_72|, ULTIMATE.start_main_~#t1368~0.offset=|v_ULTIMATE.start_main_~#t1368~0.offset_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_154, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_47} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1367~0.offset, ULTIMATE.start_main_~#t1366~0.base, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1365~0.offset, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1365~0.base, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1366~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_~#t1368~0.base, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t1367~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1368~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:55:30,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L833-1-->L835: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1366~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1366~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1366~0.base_11|) |v_ULTIMATE.start_main_~#t1366~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t1366~0.base_11| 1)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1366~0.base_11| 4) |v_#length_21|) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t1366~0.base_11|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1366~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1366~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_6|, ULTIMATE.start_main_~#t1366~0.base=|v_ULTIMATE.start_main_~#t1366~0.base_11|, ULTIMATE.start_main_~#t1366~0.offset=|v_ULTIMATE.start_main_~#t1366~0.offset_10|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1366~0.base, ULTIMATE.start_main_~#t1366~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 22:55:30,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L835-1-->L837: Formula: (and (= |v_ULTIMATE.start_main_~#t1367~0.offset_10| 0) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t1367~0.base_11| 1) |v_#valid_41|) (not (= |v_ULTIMATE.start_main_~#t1367~0.base_11| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1367~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1367~0.base_11|) |v_ULTIMATE.start_main_~#t1367~0.offset_10| 2)) |v_#memory_int_11|) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t1367~0.base_11|) 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1367~0.base_11|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1367~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1367~0.offset=|v_ULTIMATE.start_main_~#t1367~0.offset_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1367~0.base=|v_ULTIMATE.start_main_~#t1367~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1367~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1367~0.base] because there is no mapped edge [2019-12-26 22:55:30,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L837-1-->L839: Formula: (and (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1368~0.base_13|) 0) (= |v_ULTIMATE.start_main_~#t1368~0.offset_11| 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1368~0.base_13|) (= (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1368~0.base_13| 1) |v_#valid_50|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1368~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1368~0.base_13|) |v_ULTIMATE.start_main_~#t1368~0.offset_11| 3)) |v_#memory_int_15|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1368~0.base_13| 4) |v_#length_23|) (not (= |v_ULTIMATE.start_main_~#t1368~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, ULTIMATE.start_main_~#t1368~0.base=|v_ULTIMATE.start_main_~#t1368~0.base_13|, ULTIMATE.start_main_~#t1368~0.offset=|v_ULTIMATE.start_main_~#t1368~0.offset_11|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1368~0.base, ULTIMATE.start_main_~#t1368~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 22:55:30,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L4-->L810: Formula: (and (= v_~z$r_buff0_thd0~0_40 v_~z$r_buff1_thd0~0_25) (= v_~z$r_buff1_thd2~0_6 v_~z$r_buff0_thd2~0_7) (= v_~z$r_buff1_thd1~0_6 v_~z$r_buff0_thd1~0_7) (not (= 0 v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_22)) (= v_~a~0_15 v_~__unbuffered_p3_EAX~0_9) (= v_~z$r_buff0_thd4~0_25 1) (= v_~z$r_buff0_thd4~0_26 v_~z$r_buff1_thd4~0_17) (= v_~z$r_buff0_thd3~0_59 v_~z$r_buff1_thd3~0_33)) InVars {~a~0=v_~a~0_15, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_40, P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_22, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_22, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_17, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_6, ~a~0=v_~a~0_15, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_40, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_25, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_6, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_9, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_25, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-26 22:55:30,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] P0ENTRY-->P0EXIT: Formula: (and (= v_~a~0_44 1) (= v_P0Thread1of1ForFork2_~arg.base_23 |v_P0Thread1of1ForFork2_#in~arg.base_23|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_23| v_P0Thread1of1ForFork2_~arg.offset_23) (= 0 |v_P0Thread1of1ForFork2_#res.offset_13|) (= v_~__unbuffered_cnt~0_151 (+ v_~__unbuffered_cnt~0_152 1)) (= v_~x~0_51 1) (= |v_P0Thread1of1ForFork2_#res.base_13| 0)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_152, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_23|} OutVars{~a~0=v_~a~0_44, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_23|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_23, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_23|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_13|, ~x~0=v_~x~0_51, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_23} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-26 22:55:30,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork3_#res.base_7|) (= |v_P1Thread1of1ForFork3_#in~arg.offset_17| v_P1Thread1of1ForFork3_~arg.offset_17) (= |v_P1Thread1of1ForFork3_#in~arg.base_17| v_P1Thread1of1ForFork3_~arg.base_17) (= v_~y~0_22 v_~__unbuffered_p1_EAX~0_21) (= (+ v_~__unbuffered_cnt~0_86 1) v_~__unbuffered_cnt~0_85) (= 0 |v_P1Thread1of1ForFork3_#res.offset_7|) (= v_~x~0_33 2)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_17|, ~y~0=v_~y~0_22} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_7|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_17, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_17|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_17|, ~y~0=v_~y~0_22, ~x~0=v_~x~0_33} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-26 22:55:30,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1207229583 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1207229583 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork1_#t~ite28_Out1207229583|)) (and (= ~z$w_buff0_used~0_In1207229583 |P3Thread1of1ForFork1_#t~ite28_Out1207229583|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1207229583, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1207229583} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1207229583, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out1207229583|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1207229583} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-26 22:55:30,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1388777663 256))) (.cse3 (= (mod ~z$r_buff1_thd4~0_In-1388777663 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-1388777663 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1388777663 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork1_#t~ite29_Out-1388777663|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1388777663 |P3Thread1of1ForFork1_#t~ite29_Out-1388777663|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1388777663, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1388777663, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1388777663, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1388777663} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1388777663, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out-1388777663|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1388777663, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1388777663, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1388777663} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-26 22:55:30,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L813-->L814: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-975458407 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-975458407 256) 0))) (or (and (= 0 ~z$r_buff0_thd4~0_Out-975458407) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_In-975458407 ~z$r_buff0_thd4~0_Out-975458407)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-975458407, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-975458407} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-975458407, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-975458407, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out-975458407|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-26 22:55:30,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In1920108306 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1920108306 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In1920108306 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1920108306 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork1_#t~ite31_Out1920108306| ~z$r_buff1_thd4~0_In1920108306)) (and (= |P3Thread1of1ForFork1_#t~ite31_Out1920108306| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1920108306, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1920108306, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1920108306, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1920108306} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1920108306, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1920108306, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1920108306, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1920108306, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out1920108306|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-26 22:55:30,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L814-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork1_#res.offset_5| 0) (= |v_P3Thread1of1ForFork1_#t~ite31_62| v_~z$r_buff1_thd4~0_109) (= v_~__unbuffered_cnt~0_133 (+ v_~__unbuffered_cnt~0_134 1)) (= |v_P3Thread1of1ForFork1_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_62|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_109, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_133, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_5|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_61|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-26 22:55:30,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L778-->L779-8: Formula: (and (= |v_P2Thread1of1ForFork0_#t~ite22_31| |v_P2Thread1of1ForFork0_#t~ite22_30|) (= |v_P2Thread1of1ForFork0_#t~ite23_33| |v_P2Thread1of1ForFork0_#t~ite23_32|) (= v_~z$r_buff0_thd3~0_290 v_~z$r_buff0_thd3~0_289) (not (= (mod v_~weak$$choice2~0_121 256) 0)) (= v_~z$r_buff1_thd3~0_210 |v_P2Thread1of1ForFork0_#t~ite24_46|)) InVars {P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_31|, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_33|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_210, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_290, ~weak$$choice2~0=v_~weak$$choice2~0_121} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_15|, P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_30|, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_32|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_210, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_46|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_289, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_31|, ~weak$$choice2~0=v_~weak$$choice2~0_121, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_29|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite22, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-26 22:55:30,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L781-->L789: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_18 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_11|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-26 22:55:30,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L843-->L845-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_106 256)) (= (mod v_~z$r_buff0_thd0~0_21 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 22:55:30,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L845-2-->L845-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1544090619 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1544090619 256) 0))) (or (and (= ~z~0_In-1544090619 |ULTIMATE.start_main_#t~ite36_Out-1544090619|) (or .cse0 .cse1)) (and (not .cse1) (= ~z$w_buff1~0_In-1544090619 |ULTIMATE.start_main_#t~ite36_Out-1544090619|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1544090619, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1544090619, ~z$w_buff1~0=~z$w_buff1~0_In-1544090619, ~z~0=~z~0_In-1544090619} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1544090619, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1544090619, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1544090619|, ~z$w_buff1~0=~z$w_buff1~0_In-1544090619, ~z~0=~z~0_In-1544090619} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-26 22:55:30,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_13 |v_ULTIMATE.start_main_#t~ite36_7|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_7|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_7|, ~z~0=v_~z~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-26 22:55:30,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1441557505 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1441557505 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out1441557505| ~z$w_buff0_used~0_In1441557505)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out1441557505| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1441557505, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1441557505} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1441557505, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1441557505, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1441557505|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-26 22:55:30,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L847-->L847-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In-1658480050 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1658480050 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1658480050 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1658480050 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite39_Out-1658480050| ~z$w_buff1_used~0_In-1658480050)) (and (= |ULTIMATE.start_main_#t~ite39_Out-1658480050| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1658480050, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1658480050, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1658480050, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1658480050} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1658480050, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1658480050|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1658480050, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1658480050, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1658480050} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-26 22:55:30,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1111625104 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1111625104 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out1111625104| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out1111625104| ~z$r_buff0_thd0~0_In1111625104) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1111625104, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1111625104} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1111625104, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1111625104|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1111625104} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-26 22:55:30,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L849-->L849-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-2014520948 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-2014520948 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2014520948 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-2014520948 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite41_Out-2014520948| 0)) (and (= ~z$r_buff1_thd0~0_In-2014520948 |ULTIMATE.start_main_#t~ite41_Out-2014520948|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2014520948, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2014520948, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2014520948, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2014520948} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-2014520948|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2014520948, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2014520948, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2014520948, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2014520948} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-26 22:55:30,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p2_EAX~0_27) (= v_~x~0_63 2) (= v_~main$tmp_guard1~0_21 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~z$r_buff1_thd0~0_120 |v_ULTIMATE.start_main_#t~ite41_44|) (= 0 v_~__unbuffered_p3_EAX~0_80) (= 0 v_~__unbuffered_p1_EAX~0_40) (= (mod v_~main$tmp_guard1~0_21 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_44|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_80, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x~0=v_~x~0_63} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_43|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_120, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_80, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x~0=v_~x~0_63, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:55:30,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:55:30 BasicIcfg [2019-12-26 22:55:30,743 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:55:30,745 INFO L168 Benchmark]: Toolchain (without parser) took 32678.97 ms. Allocated memory was 146.8 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 102.6 MB in the beginning and 637.2 MB in the end (delta: -534.5 MB). Peak memory consumption was 953.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:55:30,751 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 22:55:30,752 INFO L168 Benchmark]: CACSL2BoogieTranslator took 772.70 ms. Allocated memory was 146.8 MB in the beginning and 205.5 MB in the end (delta: 58.7 MB). Free memory was 102.4 MB in the beginning and 157.1 MB in the end (delta: -54.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-26 22:55:30,756 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.11 ms. Allocated memory is still 205.5 MB. Free memory was 157.1 MB in the beginning and 154.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:55:30,756 INFO L168 Benchmark]: Boogie Preprocessor took 55.45 ms. Allocated memory is still 205.5 MB. Free memory was 154.5 MB in the beginning and 152.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 22:55:30,757 INFO L168 Benchmark]: RCFGBuilder took 785.65 ms. Allocated memory is still 205.5 MB. Free memory was 152.5 MB in the beginning and 106.3 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. [2019-12-26 22:55:30,757 INFO L168 Benchmark]: TraceAbstraction took 30966.44 ms. Allocated memory was 205.5 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 106.3 MB in the beginning and 637.2 MB in the end (delta: -530.8 MB). Peak memory consumption was 898.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:55:30,765 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.48 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 772.70 ms. Allocated memory was 146.8 MB in the beginning and 205.5 MB in the end (delta: 58.7 MB). Free memory was 102.4 MB in the beginning and 157.1 MB in the end (delta: -54.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 87.11 ms. Allocated memory is still 205.5 MB. Free memory was 157.1 MB in the beginning and 154.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.45 ms. Allocated memory is still 205.5 MB. Free memory was 154.5 MB in the beginning and 152.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 785.65 ms. Allocated memory is still 205.5 MB. Free memory was 152.5 MB in the beginning and 106.3 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30966.44 ms. Allocated memory was 205.5 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 106.3 MB in the beginning and 637.2 MB in the end (delta: -530.8 MB). Peak memory consumption was 898.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 168 ProgramPointsBefore, 77 ProgramPointsAfterwards, 190 TransitionsBefore, 84 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 20 ChoiceCompositions, 5577 VarBasedMoverChecksPositive, 190 VarBasedMoverChecksNegative, 67 SemBasedMoverChecksPositive, 168 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 46836 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1365, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1366, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1367, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1368, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] 4 z$w_buff1 = z$w_buff0 [L795] 4 z$w_buff0 = 1 [L796] 4 z$w_buff1_used = z$w_buff0_used [L797] 4 z$w_buff0_used = (_Bool)1 [L810] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 3 y = 1 [L769] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 3 z$flush_delayed = weak$$choice2 [L772] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L773] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L774] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L775] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L776] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L777] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L779] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 30.5s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2064 SDtfs, 2515 SDslu, 3164 SDs, 0 SdLazy, 1219 SolverSat, 146 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35550occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 27528 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 539 NumberOfCodeBlocks, 539 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 474 ConstructedInterpolants, 0 QuantifiedInterpolants, 58834 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...