/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix043_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:03:28,760 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:03:28,763 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:03:28,784 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:03:28,785 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:03:28,787 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:03:28,789 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:03:28,802 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:03:28,804 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:03:28,806 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:03:28,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:03:28,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:03:28,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:03:28,814 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:03:28,816 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:03:28,817 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:03:28,819 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:03:28,822 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:03:28,823 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:03:28,829 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:03:28,833 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:03:28,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:03:28,837 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:03:28,838 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:03:28,840 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:03:28,840 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:03:28,840 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:03:28,842 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:03:28,844 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:03:28,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:03:28,845 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:03:28,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:03:28,847 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:03:28,848 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:03:28,850 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:03:28,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:03:28,851 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:03:28,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:03:28,852 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:03:28,855 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:03:28,857 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:03:28,858 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:03:28,880 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:03:28,881 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:03:28,883 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:03:28,883 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:03:28,883 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:03:28,884 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:03:28,884 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:03:28,884 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:03:28,884 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:03:28,884 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:03:28,886 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:03:28,886 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:03:28,886 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:03:28,887 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:03:28,887 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:03:28,887 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:03:28,887 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:03:28,887 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:03:28,888 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:03:28,888 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:03:28,888 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:03:28,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:03:28,888 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:03:28,889 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:03:28,889 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:03:28,889 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:03:28,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:03:28,889 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:03:28,889 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:03:28,890 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:03:28,891 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:03:29,167 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:03:29,189 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:03:29,195 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:03:29,196 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:03:29,197 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:03:29,198 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043_power.opt.i [2019-12-27 17:03:29,275 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/916c39cfe/85d74d709da641838f0fd56f958e2f38/FLAG9eb69694b [2019-12-27 17:03:29,851 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:03:29,853 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_power.opt.i [2019-12-27 17:03:29,877 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/916c39cfe/85d74d709da641838f0fd56f958e2f38/FLAG9eb69694b [2019-12-27 17:03:30,179 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/916c39cfe/85d74d709da641838f0fd56f958e2f38 [2019-12-27 17:03:30,189 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:03:30,191 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:03:30,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:03:30,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:03:30,196 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:03:30,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:03:30" (1/1) ... [2019-12-27 17:03:30,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a53435a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:30, skipping insertion in model container [2019-12-27 17:03:30,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:03:30" (1/1) ... [2019-12-27 17:03:30,208 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:03:30,262 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:03:30,832 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:03:30,854 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:03:30,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:03:31,003 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:03:31,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:31 WrapperNode [2019-12-27 17:03:31,004 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:03:31,005 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:03:31,005 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:03:31,005 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:03:31,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:31" (1/1) ... [2019-12-27 17:03:31,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:31" (1/1) ... [2019-12-27 17:03:31,079 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:03:31,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:03:31,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:03:31,079 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:03:31,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:31" (1/1) ... [2019-12-27 17:03:31,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:31" (1/1) ... [2019-12-27 17:03:31,096 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:31" (1/1) ... [2019-12-27 17:03:31,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:31" (1/1) ... [2019-12-27 17:03:31,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:31" (1/1) ... [2019-12-27 17:03:31,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:31" (1/1) ... [2019-12-27 17:03:31,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:31" (1/1) ... [2019-12-27 17:03:31,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:03:31,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:03:31,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:03:31,121 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:03:31,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:03:31,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:03:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:03:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:03:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:03:31,199 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:03:31,199 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:03:31,199 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:03:31,199 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:03:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 17:03:31,200 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 17:03:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 17:03:31,200 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 17:03:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:03:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:03:31,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:03:31,203 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 17:03:31,990 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:03:31,990 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:03:31,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:03:31 BoogieIcfgContainer [2019-12-27 17:03:31,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:03:31,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:03:31,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:03:31,996 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:03:31,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:03:30" (1/3) ... [2019-12-27 17:03:31,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d3d659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:03:31, skipping insertion in model container [2019-12-27 17:03:31,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:31" (2/3) ... [2019-12-27 17:03:31,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d3d659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:03:31, skipping insertion in model container [2019-12-27 17:03:31,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:03:31" (3/3) ... [2019-12-27 17:03:32,001 INFO L109 eAbstractionObserver]: Analyzing ICFG mix043_power.opt.i [2019-12-27 17:03:32,009 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:03:32,009 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:03:32,016 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:03:32,018 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:03:32,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,056 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,056 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,058 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,058 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,075 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,075 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,082 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,082 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,082 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,082 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,083 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,083 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,083 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,083 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,084 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,084 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,084 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,084 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,084 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,086 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,086 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,086 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,086 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,086 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,087 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,087 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,087 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,087 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,087 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,088 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,088 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,088 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,088 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,088 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,089 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,089 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,093 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,093 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,097 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,099 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,105 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,105 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,108 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,108 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,108 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,108 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,108 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,109 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,109 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,109 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,109 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,110 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,110 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,110 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:32,128 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 17:03:32,150 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:03:32,150 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:03:32,151 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:03:32,151 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:03:32,151 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:03:32,151 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:03:32,151 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:03:32,151 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:03:32,175 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 210 transitions [2019-12-27 17:03:32,177 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-27 17:03:32,303 INFO L132 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-27 17:03:32,304 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:03:32,318 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 17:03:32,339 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-27 17:03:32,390 INFO L132 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-27 17:03:32,390 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:03:32,396 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 17:03:32,412 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 17:03:32,413 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:03:35,735 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-12-27 17:03:37,942 WARN L192 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-27 17:03:38,088 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-27 17:03:38,108 INFO L206 etLargeBlockEncoding]: Checked pairs total: 56592 [2019-12-27 17:03:38,108 INFO L214 etLargeBlockEncoding]: Total number of compositions: 126 [2019-12-27 17:03:38,112 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-27 17:03:40,304 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 33838 states. [2019-12-27 17:03:40,306 INFO L276 IsEmpty]: Start isEmpty. Operand 33838 states. [2019-12-27 17:03:40,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 17:03:40,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:40,312 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:03:40,312 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:40,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:40,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1752766824, now seen corresponding path program 1 times [2019-12-27 17:03:40,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:40,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748979076] [2019-12-27 17:03:40,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:40,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:40,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748979076] [2019-12-27 17:03:40,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:40,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:03:40,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1314040924] [2019-12-27 17:03:40,700 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:40,706 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:40,725 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 17:03:40,726 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:40,730 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:03:40,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:03:40,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:40,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:03:40,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:03:40,748 INFO L87 Difference]: Start difference. First operand 33838 states. Second operand 3 states. [2019-12-27 17:03:42,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:42,392 INFO L93 Difference]: Finished difference Result 33638 states and 143712 transitions. [2019-12-27 17:03:42,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:03:42,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 17:03:42,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:42,739 INFO L225 Difference]: With dead ends: 33638 [2019-12-27 17:03:42,739 INFO L226 Difference]: Without dead ends: 32966 [2019-12-27 17:03:42,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:03:43,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32966 states. [2019-12-27 17:03:44,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32966 to 32966. [2019-12-27 17:03:44,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32966 states. [2019-12-27 17:03:45,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32966 states to 32966 states and 140968 transitions. [2019-12-27 17:03:45,890 INFO L78 Accepts]: Start accepts. Automaton has 32966 states and 140968 transitions. Word has length 9 [2019-12-27 17:03:45,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:45,891 INFO L462 AbstractCegarLoop]: Abstraction has 32966 states and 140968 transitions. [2019-12-27 17:03:45,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:03:45,891 INFO L276 IsEmpty]: Start isEmpty. Operand 32966 states and 140968 transitions. [2019-12-27 17:03:45,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 17:03:45,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:45,904 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:03:45,904 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:45,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:45,905 INFO L82 PathProgramCache]: Analyzing trace with hash -666575947, now seen corresponding path program 1 times [2019-12-27 17:03:45,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:45,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879745644] [2019-12-27 17:03:45,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:46,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:46,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879745644] [2019-12-27 17:03:46,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:46,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:03:46,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1660793708] [2019-12-27 17:03:46,049 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:46,050 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:46,057 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 17:03:46,057 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:46,058 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:03:46,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:03:46,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:46,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:03:46,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:03:46,060 INFO L87 Difference]: Start difference. First operand 32966 states and 140968 transitions. Second operand 4 states. [2019-12-27 17:03:46,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:46,930 INFO L93 Difference]: Finished difference Result 44494 states and 185824 transitions. [2019-12-27 17:03:46,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:03:46,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 17:03:46,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:47,161 INFO L225 Difference]: With dead ends: 44494 [2019-12-27 17:03:47,161 INFO L226 Difference]: Without dead ends: 44494 [2019-12-27 17:03:47,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:03:47,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44494 states. [2019-12-27 17:03:48,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44494 to 43986. [2019-12-27 17:03:48,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43986 states. [2019-12-27 17:03:49,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43986 states to 43986 states and 183912 transitions. [2019-12-27 17:03:49,137 INFO L78 Accepts]: Start accepts. Automaton has 43986 states and 183912 transitions. Word has length 15 [2019-12-27 17:03:49,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:49,137 INFO L462 AbstractCegarLoop]: Abstraction has 43986 states and 183912 transitions. [2019-12-27 17:03:49,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:03:49,137 INFO L276 IsEmpty]: Start isEmpty. Operand 43986 states and 183912 transitions. [2019-12-27 17:03:49,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 17:03:49,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:49,140 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:03:49,140 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:49,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:49,141 INFO L82 PathProgramCache]: Analyzing trace with hash 703479247, now seen corresponding path program 1 times [2019-12-27 17:03:49,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:49,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907161767] [2019-12-27 17:03:49,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:49,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:49,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907161767] [2019-12-27 17:03:49,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:49,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:03:49,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1574409354] [2019-12-27 17:03:49,231 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:49,233 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:49,236 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 39 transitions. [2019-12-27 17:03:49,236 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:49,285 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:03:49,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:03:49,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:49,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:03:49,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:03:49,286 INFO L87 Difference]: Start difference. First operand 43986 states and 183912 transitions. Second operand 5 states. [2019-12-27 17:03:51,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:51,646 INFO L93 Difference]: Finished difference Result 62082 states and 254960 transitions. [2019-12-27 17:03:51,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:03:51,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-27 17:03:51,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:51,873 INFO L225 Difference]: With dead ends: 62082 [2019-12-27 17:03:51,873 INFO L226 Difference]: Without dead ends: 62054 [2019-12-27 17:03:51,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:03:52,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62054 states. [2019-12-27 17:03:53,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62054 to 51774. [2019-12-27 17:03:53,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51774 states. [2019-12-27 17:03:53,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51774 states to 51774 states and 215576 transitions. [2019-12-27 17:03:53,978 INFO L78 Accepts]: Start accepts. Automaton has 51774 states and 215576 transitions. Word has length 15 [2019-12-27 17:03:53,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:53,979 INFO L462 AbstractCegarLoop]: Abstraction has 51774 states and 215576 transitions. [2019-12-27 17:03:53,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:03:53,979 INFO L276 IsEmpty]: Start isEmpty. Operand 51774 states and 215576 transitions. [2019-12-27 17:03:53,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 17:03:53,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:53,995 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-27 17:03:53,995 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:53,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:53,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1831569488, now seen corresponding path program 1 times [2019-12-27 17:03:53,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:53,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708845180] [2019-12-27 17:03:53,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:54,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:54,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708845180] [2019-12-27 17:03:54,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:54,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:03:54,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1463980410] [2019-12-27 17:03:54,071 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:54,074 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:54,077 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 29 transitions. [2019-12-27 17:03:54,078 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:54,078 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:03:54,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:03:54,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:54,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:03:54,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:03:54,079 INFO L87 Difference]: Start difference. First operand 51774 states and 215576 transitions. Second operand 5 states. [2019-12-27 17:03:56,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:56,984 INFO L93 Difference]: Finished difference Result 68854 states and 281988 transitions. [2019-12-27 17:03:56,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 17:03:56,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 17:03:56,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:57,156 INFO L225 Difference]: With dead ends: 68854 [2019-12-27 17:03:57,157 INFO L226 Difference]: Without dead ends: 68826 [2019-12-27 17:03:57,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:03:57,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68826 states. [2019-12-27 17:03:58,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68826 to 51450. [2019-12-27 17:03:58,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51450 states. [2019-12-27 17:03:58,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51450 states to 51450 states and 213896 transitions. [2019-12-27 17:03:58,586 INFO L78 Accepts]: Start accepts. Automaton has 51450 states and 213896 transitions. Word has length 21 [2019-12-27 17:03:58,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:58,586 INFO L462 AbstractCegarLoop]: Abstraction has 51450 states and 213896 transitions. [2019-12-27 17:03:58,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:03:58,586 INFO L276 IsEmpty]: Start isEmpty. Operand 51450 states and 213896 transitions. [2019-12-27 17:03:58,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 17:03:58,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:58,643 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:03:58,643 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:58,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:58,644 INFO L82 PathProgramCache]: Analyzing trace with hash 2027885083, now seen corresponding path program 1 times [2019-12-27 17:03:58,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:58,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807694367] [2019-12-27 17:03:58,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:58,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:58,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807694367] [2019-12-27 17:03:58,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:58,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:03:58,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1532223593] [2019-12-27 17:03:58,694 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:58,700 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:58,706 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 29 transitions. [2019-12-27 17:03:58,707 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:58,707 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:03:58,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:03:58,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:58,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:03:58,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:03:58,708 INFO L87 Difference]: Start difference. First operand 51450 states and 213896 transitions. Second operand 3 states. [2019-12-27 17:03:59,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:59,564 INFO L93 Difference]: Finished difference Result 64130 states and 263832 transitions. [2019-12-27 17:03:59,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:03:59,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-27 17:03:59,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:59,727 INFO L225 Difference]: With dead ends: 64130 [2019-12-27 17:03:59,727 INFO L226 Difference]: Without dead ends: 64130 [2019-12-27 17:03:59,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:04:00,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64130 states. [2019-12-27 17:04:03,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64130 to 56646. [2019-12-27 17:04:03,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56646 states. [2019-12-27 17:04:03,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56646 states to 56646 states and 234808 transitions. [2019-12-27 17:04:03,372 INFO L78 Accepts]: Start accepts. Automaton has 56646 states and 234808 transitions. Word has length 29 [2019-12-27 17:04:03,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:03,373 INFO L462 AbstractCegarLoop]: Abstraction has 56646 states and 234808 transitions. [2019-12-27 17:04:03,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:04:03,373 INFO L276 IsEmpty]: Start isEmpty. Operand 56646 states and 234808 transitions. [2019-12-27 17:04:03,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 17:04:03,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:03,408 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:04:03,408 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:03,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:03,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1811393886, now seen corresponding path program 1 times [2019-12-27 17:04:03,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:03,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234738560] [2019-12-27 17:04:03,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:03,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:03,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234738560] [2019-12-27 17:04:03,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:03,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:04:03,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1453874432] [2019-12-27 17:04:03,510 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:03,515 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:03,521 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 29 transitions. [2019-12-27 17:04:03,522 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:03,522 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:04:03,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:04:03,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:03,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:04:03,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:04:03,523 INFO L87 Difference]: Start difference. First operand 56646 states and 234808 transitions. Second operand 6 states. [2019-12-27 17:04:04,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:04,695 INFO L93 Difference]: Finished difference Result 81602 states and 332376 transitions. [2019-12-27 17:04:04,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 17:04:04,699 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-27 17:04:04,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:04,912 INFO L225 Difference]: With dead ends: 81602 [2019-12-27 17:04:04,912 INFO L226 Difference]: Without dead ends: 81538 [2019-12-27 17:04:04,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:04:05,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81538 states. [2019-12-27 17:04:08,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81538 to 65578. [2019-12-27 17:04:08,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65578 states. [2019-12-27 17:04:09,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65578 states to 65578 states and 270440 transitions. [2019-12-27 17:04:09,120 INFO L78 Accepts]: Start accepts. Automaton has 65578 states and 270440 transitions. Word has length 29 [2019-12-27 17:04:09,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:09,121 INFO L462 AbstractCegarLoop]: Abstraction has 65578 states and 270440 transitions. [2019-12-27 17:04:09,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:04:09,121 INFO L276 IsEmpty]: Start isEmpty. Operand 65578 states and 270440 transitions. [2019-12-27 17:04:09,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 17:04:09,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:09,192 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] [2019-12-27 17:04:09,192 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:09,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:09,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1048930675, now seen corresponding path program 1 times [2019-12-27 17:04:09,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:09,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529652878] [2019-12-27 17:04:09,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:09,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:09,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529652878] [2019-12-27 17:04:09,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:09,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:04:09,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [168771075] [2019-12-27 17:04:09,295 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:09,302 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:09,310 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 37 transitions. [2019-12-27 17:04:09,310 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:09,311 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:04:09,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:04:09,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:09,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:04:09,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:04:09,312 INFO L87 Difference]: Start difference. First operand 65578 states and 270440 transitions. Second operand 3 states. [2019-12-27 17:04:10,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:10,122 INFO L93 Difference]: Finished difference Result 65578 states and 269720 transitions. [2019-12-27 17:04:10,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:04:10,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-27 17:04:10,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:10,285 INFO L225 Difference]: With dead ends: 65578 [2019-12-27 17:04:10,286 INFO L226 Difference]: Without dead ends: 65578 [2019-12-27 17:04:10,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:04:10,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65578 states. [2019-12-27 17:04:11,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65578 to 65578. [2019-12-27 17:04:11,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65578 states. [2019-12-27 17:04:12,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65578 states to 65578 states and 269720 transitions. [2019-12-27 17:04:12,163 INFO L78 Accepts]: Start accepts. Automaton has 65578 states and 269720 transitions. Word has length 35 [2019-12-27 17:04:12,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:12,163 INFO L462 AbstractCegarLoop]: Abstraction has 65578 states and 269720 transitions. [2019-12-27 17:04:12,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:04:12,164 INFO L276 IsEmpty]: Start isEmpty. Operand 65578 states and 269720 transitions. [2019-12-27 17:04:12,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 17:04:12,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:12,221 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] [2019-12-27 17:04:12,221 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:12,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:12,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1735231015, now seen corresponding path program 1 times [2019-12-27 17:04:12,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:12,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876920370] [2019-12-27 17:04:12,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:12,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:12,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876920370] [2019-12-27 17:04:12,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:12,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:04:12,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [706921430] [2019-12-27 17:04:12,407 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:12,413 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:12,427 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 43 transitions. [2019-12-27 17:04:12,427 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:12,428 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:04:12,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:04:12,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:12,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:04:12,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:04:12,429 INFO L87 Difference]: Start difference. First operand 65578 states and 269720 transitions. Second operand 9 states. [2019-12-27 17:04:16,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:16,443 INFO L93 Difference]: Finished difference Result 89414 states and 361616 transitions. [2019-12-27 17:04:16,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 17:04:16,443 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-12-27 17:04:16,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:16,673 INFO L225 Difference]: With dead ends: 89414 [2019-12-27 17:04:16,674 INFO L226 Difference]: Without dead ends: 89310 [2019-12-27 17:04:16,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2019-12-27 17:04:17,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89310 states. [2019-12-27 17:04:18,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89310 to 58886. [2019-12-27 17:04:18,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58886 states. [2019-12-27 17:04:18,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58886 states to 58886 states and 243296 transitions. [2019-12-27 17:04:18,394 INFO L78 Accepts]: Start accepts. Automaton has 58886 states and 243296 transitions. Word has length 35 [2019-12-27 17:04:18,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:18,394 INFO L462 AbstractCegarLoop]: Abstraction has 58886 states and 243296 transitions. [2019-12-27 17:04:18,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:04:18,394 INFO L276 IsEmpty]: Start isEmpty. Operand 58886 states and 243296 transitions. [2019-12-27 17:04:18,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 17:04:18,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:18,464 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] [2019-12-27 17:04:18,464 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:18,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:18,465 INFO L82 PathProgramCache]: Analyzing trace with hash 903389864, now seen corresponding path program 1 times [2019-12-27 17:04:18,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:18,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375582289] [2019-12-27 17:04:18,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:18,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:18,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375582289] [2019-12-27 17:04:18,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:18,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:04:18,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [354803264] [2019-12-27 17:04:18,532 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:18,539 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:18,546 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 35 transitions. [2019-12-27 17:04:18,547 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:18,547 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:04:18,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:04:18,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:18,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:04:18,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:04:18,548 INFO L87 Difference]: Start difference. First operand 58886 states and 243296 transitions. Second operand 4 states. [2019-12-27 17:04:18,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:18,754 INFO L93 Difference]: Finished difference Result 47360 states and 179978 transitions. [2019-12-27 17:04:18,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:04:18,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-27 17:04:18,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:18,852 INFO L225 Difference]: With dead ends: 47360 [2019-12-27 17:04:18,852 INFO L226 Difference]: Without dead ends: 46252 [2019-12-27 17:04:18,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:04:19,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46252 states. [2019-12-27 17:04:20,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46252 to 46252. [2019-12-27 17:04:20,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46252 states. [2019-12-27 17:04:20,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46252 states to 46252 states and 176502 transitions. [2019-12-27 17:04:20,396 INFO L78 Accepts]: Start accepts. Automaton has 46252 states and 176502 transitions. Word has length 35 [2019-12-27 17:04:20,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:20,396 INFO L462 AbstractCegarLoop]: Abstraction has 46252 states and 176502 transitions. [2019-12-27 17:04:20,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:04:20,396 INFO L276 IsEmpty]: Start isEmpty. Operand 46252 states and 176502 transitions. [2019-12-27 17:04:20,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 17:04:20,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:20,436 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] [2019-12-27 17:04:20,437 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:20,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:20,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1617947594, now seen corresponding path program 1 times [2019-12-27 17:04:20,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:20,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076545743] [2019-12-27 17:04:20,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:20,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:20,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076545743] [2019-12-27 17:04:20,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:20,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:04:20,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [496395803] [2019-12-27 17:04:20,589 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:20,596 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:20,606 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 43 states and 48 transitions. [2019-12-27 17:04:20,607 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:20,607 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:04:20,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:04:20,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:20,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:04:20,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:04:20,609 INFO L87 Difference]: Start difference. First operand 46252 states and 176502 transitions. Second operand 6 states. [2019-12-27 17:04:21,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:21,094 INFO L93 Difference]: Finished difference Result 58248 states and 224178 transitions. [2019-12-27 17:04:21,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:04:21,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-12-27 17:04:21,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:21,209 INFO L225 Difference]: With dead ends: 58248 [2019-12-27 17:04:21,209 INFO L226 Difference]: Without dead ends: 55647 [2019-12-27 17:04:21,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:04:21,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55647 states. [2019-12-27 17:04:22,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55647 to 51679. [2019-12-27 17:04:22,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51679 states. [2019-12-27 17:04:22,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51679 states to 51679 states and 198408 transitions. [2019-12-27 17:04:22,632 INFO L78 Accepts]: Start accepts. Automaton has 51679 states and 198408 transitions. Word has length 36 [2019-12-27 17:04:22,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:22,632 INFO L462 AbstractCegarLoop]: Abstraction has 51679 states and 198408 transitions. [2019-12-27 17:04:22,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:04:22,632 INFO L276 IsEmpty]: Start isEmpty. Operand 51679 states and 198408 transitions. [2019-12-27 17:04:22,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 17:04:22,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:22,681 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] [2019-12-27 17:04:22,682 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:22,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:22,682 INFO L82 PathProgramCache]: Analyzing trace with hash 859028932, now seen corresponding path program 1 times [2019-12-27 17:04:22,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:22,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962575663] [2019-12-27 17:04:22,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:22,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:22,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962575663] [2019-12-27 17:04:22,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:22,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:04:22,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2081804255] [2019-12-27 17:04:22,833 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:22,841 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:22,856 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 58 transitions. [2019-12-27 17:04:22,857 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:22,859 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:04:22,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:04:22,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:22,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:04:22,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:04:22,860 INFO L87 Difference]: Start difference. First operand 51679 states and 198408 transitions. Second operand 7 states. [2019-12-27 17:04:23,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:23,962 INFO L93 Difference]: Finished difference Result 82547 states and 311405 transitions. [2019-12-27 17:04:23,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 17:04:23,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-12-27 17:04:23,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:24,069 INFO L225 Difference]: With dead ends: 82547 [2019-12-27 17:04:24,069 INFO L226 Difference]: Without dead ends: 49109 [2019-12-27 17:04:24,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:04:24,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49109 states. [2019-12-27 17:04:24,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49109 to 45174. [2019-12-27 17:04:24,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45174 states. [2019-12-27 17:04:24,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45174 states to 45174 states and 171775 transitions. [2019-12-27 17:04:24,963 INFO L78 Accepts]: Start accepts. Automaton has 45174 states and 171775 transitions. Word has length 38 [2019-12-27 17:04:24,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:24,963 INFO L462 AbstractCegarLoop]: Abstraction has 45174 states and 171775 transitions. [2019-12-27 17:04:24,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:04:24,964 INFO L276 IsEmpty]: Start isEmpty. Operand 45174 states and 171775 transitions. [2019-12-27 17:04:25,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 17:04:25,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:25,003 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] [2019-12-27 17:04:25,003 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:25,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:25,003 INFO L82 PathProgramCache]: Analyzing trace with hash -308573782, now seen corresponding path program 2 times [2019-12-27 17:04:25,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:25,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364530997] [2019-12-27 17:04:25,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:25,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:25,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364530997] [2019-12-27 17:04:25,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:25,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:04:25,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [539849587] [2019-12-27 17:04:25,243 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:25,252 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:25,267 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 38 transitions. [2019-12-27 17:04:25,267 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:25,268 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:04:25,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:04:25,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:25,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:04:25,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:04:25,269 INFO L87 Difference]: Start difference. First operand 45174 states and 171775 transitions. Second operand 9 states. [2019-12-27 17:04:26,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:26,476 INFO L93 Difference]: Finished difference Result 81429 states and 309436 transitions. [2019-12-27 17:04:26,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 17:04:26,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-12-27 17:04:26,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:26,630 INFO L225 Difference]: With dead ends: 81429 [2019-12-27 17:04:26,631 INFO L226 Difference]: Without dead ends: 69567 [2019-12-27 17:04:26,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-12-27 17:04:26,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69567 states. [2019-12-27 17:04:27,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69567 to 56358. [2019-12-27 17:04:27,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56358 states. [2019-12-27 17:04:27,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56358 states to 56358 states and 213344 transitions. [2019-12-27 17:04:27,784 INFO L78 Accepts]: Start accepts. Automaton has 56358 states and 213344 transitions. Word has length 38 [2019-12-27 17:04:27,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:27,784 INFO L462 AbstractCegarLoop]: Abstraction has 56358 states and 213344 transitions. [2019-12-27 17:04:27,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:04:27,785 INFO L276 IsEmpty]: Start isEmpty. Operand 56358 states and 213344 transitions. [2019-12-27 17:04:27,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 17:04:27,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:27,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:04:27,841 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:27,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:27,842 INFO L82 PathProgramCache]: Analyzing trace with hash -779914948, now seen corresponding path program 1 times [2019-12-27 17:04:27,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:27,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155948231] [2019-12-27 17:04:27,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:28,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:28,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155948231] [2019-12-27 17:04:28,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:28,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:04:28,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [302952980] [2019-12-27 17:04:28,089 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:28,098 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:28,111 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 47 states and 53 transitions. [2019-12-27 17:04:28,112 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:28,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:04:28,354 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 17:04:28,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 17:04:28,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:28,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 17:04:28,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-12-27 17:04:28,355 INFO L87 Difference]: Start difference. First operand 56358 states and 213344 transitions. Second operand 17 states. [2019-12-27 17:04:28,767 WARN L192 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-12-27 17:04:29,021 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-27 17:04:34,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:34,291 INFO L93 Difference]: Finished difference Result 136425 states and 518669 transitions. [2019-12-27 17:04:34,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 17:04:34,292 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2019-12-27 17:04:34,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:34,571 INFO L225 Difference]: With dead ends: 136425 [2019-12-27 17:04:34,571 INFO L226 Difference]: Without dead ends: 117612 [2019-12-27 17:04:34,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=325, Invalid=1481, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 17:04:35,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117612 states. [2019-12-27 17:04:36,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117612 to 57634. [2019-12-27 17:04:36,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57634 states. [2019-12-27 17:04:36,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57634 states to 57634 states and 217276 transitions. [2019-12-27 17:04:36,633 INFO L78 Accepts]: Start accepts. Automaton has 57634 states and 217276 transitions. Word has length 39 [2019-12-27 17:04:36,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:36,633 INFO L462 AbstractCegarLoop]: Abstraction has 57634 states and 217276 transitions. [2019-12-27 17:04:36,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 17:04:36,634 INFO L276 IsEmpty]: Start isEmpty. Operand 57634 states and 217276 transitions. [2019-12-27 17:04:36,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 17:04:36,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:36,693 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:04:36,693 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:36,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:36,693 INFO L82 PathProgramCache]: Analyzing trace with hash 134445563, now seen corresponding path program 1 times [2019-12-27 17:04:36,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:36,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582232151] [2019-12-27 17:04:36,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:36,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:36,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582232151] [2019-12-27 17:04:36,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:36,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:04:36,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1530393865] [2019-12-27 17:04:36,762 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:36,770 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:36,781 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 39 transitions. [2019-12-27 17:04:36,782 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:36,782 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:04:36,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:04:36,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:36,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:04:36,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:04:36,783 INFO L87 Difference]: Start difference. First operand 57634 states and 217276 transitions. Second operand 5 states. [2019-12-27 17:04:36,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:36,890 INFO L93 Difference]: Finished difference Result 20066 states and 64012 transitions. [2019-12-27 17:04:36,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:04:36,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 17:04:36,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:36,918 INFO L225 Difference]: With dead ends: 20066 [2019-12-27 17:04:36,918 INFO L226 Difference]: Without dead ends: 19212 [2019-12-27 17:04:36,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:04:36,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19212 states. [2019-12-27 17:04:37,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19212 to 19212. [2019-12-27 17:04:37,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19212 states. [2019-12-27 17:04:37,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19212 states to 19212 states and 61283 transitions. [2019-12-27 17:04:37,607 INFO L78 Accepts]: Start accepts. Automaton has 19212 states and 61283 transitions. Word has length 39 [2019-12-27 17:04:37,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:37,607 INFO L462 AbstractCegarLoop]: Abstraction has 19212 states and 61283 transitions. [2019-12-27 17:04:37,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:04:37,607 INFO L276 IsEmpty]: Start isEmpty. Operand 19212 states and 61283 transitions. [2019-12-27 17:04:37,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 17:04:37,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:37,623 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:04:37,623 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:37,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:37,623 INFO L82 PathProgramCache]: Analyzing trace with hash 335124460, now seen corresponding path program 1 times [2019-12-27 17:04:37,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:37,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074242284] [2019-12-27 17:04:37,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:37,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:37,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074242284] [2019-12-27 17:04:37,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:37,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:04:37,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1009804236] [2019-12-27 17:04:37,692 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:37,701 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:37,714 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 40 transitions. [2019-12-27 17:04:37,714 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:37,714 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:04:37,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:04:37,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:37,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:04:37,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:04:37,715 INFO L87 Difference]: Start difference. First operand 19212 states and 61283 transitions. Second operand 6 states. [2019-12-27 17:04:37,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:37,796 INFO L93 Difference]: Finished difference Result 3462 states and 8738 transitions. [2019-12-27 17:04:37,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:04:37,796 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 17:04:37,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:37,801 INFO L225 Difference]: With dead ends: 3462 [2019-12-27 17:04:37,801 INFO L226 Difference]: Without dead ends: 3115 [2019-12-27 17:04:37,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:04:37,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3115 states. [2019-12-27 17:04:37,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3115 to 3051. [2019-12-27 17:04:37,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3051 states. [2019-12-27 17:04:37,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3051 states to 3051 states and 7552 transitions. [2019-12-27 17:04:37,848 INFO L78 Accepts]: Start accepts. Automaton has 3051 states and 7552 transitions. Word has length 40 [2019-12-27 17:04:37,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:37,849 INFO L462 AbstractCegarLoop]: Abstraction has 3051 states and 7552 transitions. [2019-12-27 17:04:37,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:04:37,849 INFO L276 IsEmpty]: Start isEmpty. Operand 3051 states and 7552 transitions. [2019-12-27 17:04:37,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 17:04:37,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:37,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:04:37,853 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:37,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:37,854 INFO L82 PathProgramCache]: Analyzing trace with hash -784185183, now seen corresponding path program 1 times [2019-12-27 17:04:37,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:37,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926798565] [2019-12-27 17:04:37,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:37,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:37,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926798565] [2019-12-27 17:04:37,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:37,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:04:37,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [189926456] [2019-12-27 17:04:37,952 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:37,970 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:38,008 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 80 transitions. [2019-12-27 17:04:38,008 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:38,035 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:04:38,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:04:38,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:38,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:04:38,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:04:38,036 INFO L87 Difference]: Start difference. First operand 3051 states and 7552 transitions. Second operand 8 states. [2019-12-27 17:04:38,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:38,273 INFO L93 Difference]: Finished difference Result 1240 states and 3354 transitions. [2019-12-27 17:04:38,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 17:04:38,274 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2019-12-27 17:04:38,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:38,277 INFO L225 Difference]: With dead ends: 1240 [2019-12-27 17:04:38,277 INFO L226 Difference]: Without dead ends: 1182 [2019-12-27 17:04:38,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:04:38,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2019-12-27 17:04:38,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1058. [2019-12-27 17:04:38,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1058 states. [2019-12-27 17:04:38,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 2908 transitions. [2019-12-27 17:04:38,299 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 2908 transitions. Word has length 48 [2019-12-27 17:04:38,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:38,299 INFO L462 AbstractCegarLoop]: Abstraction has 1058 states and 2908 transitions. [2019-12-27 17:04:38,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:04:38,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 2908 transitions. [2019-12-27 17:04:38,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 17:04:38,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:38,301 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:04:38,301 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:38,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:38,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1193491105, now seen corresponding path program 1 times [2019-12-27 17:04:38,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:38,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020433526] [2019-12-27 17:04:38,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:38,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:38,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020433526] [2019-12-27 17:04:38,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:38,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:04:38,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2111873725] [2019-12-27 17:04:38,444 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:38,463 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:38,580 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 239 transitions. [2019-12-27 17:04:38,580 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:38,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:04:38,676 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 17:04:38,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 17:04:38,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:38,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 17:04:38,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:04:38,678 INFO L87 Difference]: Start difference. First operand 1058 states and 2908 transitions. Second operand 11 states. [2019-12-27 17:04:39,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:39,100 INFO L93 Difference]: Finished difference Result 2032 states and 5296 transitions. [2019-12-27 17:04:39,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 17:04:39,101 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-27 17:04:39,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:39,103 INFO L225 Difference]: With dead ends: 2032 [2019-12-27 17:04:39,103 INFO L226 Difference]: Without dead ends: 853 [2019-12-27 17:04:39,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2019-12-27 17:04:39,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2019-12-27 17:04:39,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 595. [2019-12-27 17:04:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-12-27 17:04:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 1322 transitions. [2019-12-27 17:04:39,111 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 1322 transitions. Word has length 59 [2019-12-27 17:04:39,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:39,111 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 1322 transitions. [2019-12-27 17:04:39,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 17:04:39,111 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1322 transitions. [2019-12-27 17:04:39,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 17:04:39,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:39,112 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:04:39,112 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:39,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:39,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1632162753, now seen corresponding path program 2 times [2019-12-27 17:04:39,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:39,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881634447] [2019-12-27 17:04:39,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:39,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:39,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881634447] [2019-12-27 17:04:39,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:39,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:04:39,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [391682432] [2019-12-27 17:04:39,170 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:39,201 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:39,252 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 104 transitions. [2019-12-27 17:04:39,252 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:39,267 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:04:39,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:04:39,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:39,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:04:39,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:04:39,268 INFO L87 Difference]: Start difference. First operand 595 states and 1322 transitions. Second operand 4 states. [2019-12-27 17:04:39,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:39,373 INFO L93 Difference]: Finished difference Result 770 states and 1676 transitions. [2019-12-27 17:04:39,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:04:39,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-27 17:04:39,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:39,374 INFO L225 Difference]: With dead ends: 770 [2019-12-27 17:04:39,375 INFO L226 Difference]: Without dead ends: 770 [2019-12-27 17:04:39,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:04:39,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2019-12-27 17:04:39,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 572. [2019-12-27 17:04:39,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-12-27 17:04:39,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 1242 transitions. [2019-12-27 17:04:39,383 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 1242 transitions. Word has length 59 [2019-12-27 17:04:39,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:39,384 INFO L462 AbstractCegarLoop]: Abstraction has 572 states and 1242 transitions. [2019-12-27 17:04:39,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:04:39,384 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 1242 transitions. [2019-12-27 17:04:39,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 17:04:39,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:39,385 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:04:39,385 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:39,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:39,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1384719400, now seen corresponding path program 1 times [2019-12-27 17:04:39,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:39,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848993024] [2019-12-27 17:04:39,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:39,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:39,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848993024] [2019-12-27 17:04:39,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:39,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 17:04:39,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [915903852] [2019-12-27 17:04:39,699 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:39,717 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:39,771 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 109 transitions. [2019-12-27 17:04:39,771 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:39,846 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:04:39,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 17:04:39,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:39,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 17:04:39,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-27 17:04:39,847 INFO L87 Difference]: Start difference. First operand 572 states and 1242 transitions. Second operand 15 states. [2019-12-27 17:04:41,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:41,201 INFO L93 Difference]: Finished difference Result 1204 states and 2624 transitions. [2019-12-27 17:04:41,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 17:04:41,201 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2019-12-27 17:04:41,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:41,204 INFO L225 Difference]: With dead ends: 1204 [2019-12-27 17:04:41,204 INFO L226 Difference]: Without dead ends: 1170 [2019-12-27 17:04:41,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=207, Invalid=785, Unknown=0, NotChecked=0, Total=992 [2019-12-27 17:04:41,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-12-27 17:04:41,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 752. [2019-12-27 17:04:41,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2019-12-27 17:04:41,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1641 transitions. [2019-12-27 17:04:41,217 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1641 transitions. Word has length 60 [2019-12-27 17:04:41,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:41,217 INFO L462 AbstractCegarLoop]: Abstraction has 752 states and 1641 transitions. [2019-12-27 17:04:41,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 17:04:41,217 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1641 transitions. [2019-12-27 17:04:41,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 17:04:41,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:41,218 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:04:41,219 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:41,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:41,219 INFO L82 PathProgramCache]: Analyzing trace with hash -713679046, now seen corresponding path program 2 times [2019-12-27 17:04:41,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:41,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41577768] [2019-12-27 17:04:41,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:41,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:41,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41577768] [2019-12-27 17:04:41,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:41,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 17:04:41,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [631175685] [2019-12-27 17:04:41,579 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:41,591 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:41,640 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 129 transitions. [2019-12-27 17:04:41,640 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:41,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:04:41,816 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 17:04:41,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 17:04:41,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:41,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 17:04:41,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-12-27 17:04:41,817 INFO L87 Difference]: Start difference. First operand 752 states and 1641 transitions. Second operand 17 states. [2019-12-27 17:04:43,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:43,452 INFO L93 Difference]: Finished difference Result 1364 states and 2946 transitions. [2019-12-27 17:04:43,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 17:04:43,452 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 60 [2019-12-27 17:04:43,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:43,454 INFO L225 Difference]: With dead ends: 1364 [2019-12-27 17:04:43,455 INFO L226 Difference]: Without dead ends: 1330 [2019-12-27 17:04:43,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=261, Invalid=1145, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 17:04:43,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2019-12-27 17:04:43,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 760. [2019-12-27 17:04:43,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-12-27 17:04:43,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1659 transitions. [2019-12-27 17:04:43,464 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1659 transitions. Word has length 60 [2019-12-27 17:04:43,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:43,465 INFO L462 AbstractCegarLoop]: Abstraction has 760 states and 1659 transitions. [2019-12-27 17:04:43,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 17:04:43,465 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1659 transitions. [2019-12-27 17:04:43,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 17:04:43,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:43,466 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:04:43,466 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:43,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:43,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1887301962, now seen corresponding path program 3 times [2019-12-27 17:04:43,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:43,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744915192] [2019-12-27 17:04:43,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:43,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:43,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744915192] [2019-12-27 17:04:43,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:43,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 17:04:43,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1378828544] [2019-12-27 17:04:43,871 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:43,902 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:43,970 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 102 transitions. [2019-12-27 17:04:43,970 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:43,980 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:04:43,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 17:04:43,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:43,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 17:04:43,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:04:43,981 INFO L87 Difference]: Start difference. First operand 760 states and 1659 transitions. Second operand 14 states. [2019-12-27 17:04:44,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:44,495 INFO L93 Difference]: Finished difference Result 989 states and 2135 transitions. [2019-12-27 17:04:44,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 17:04:44,495 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-27 17:04:44,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:44,497 INFO L225 Difference]: With dead ends: 989 [2019-12-27 17:04:44,497 INFO L226 Difference]: Without dead ends: 955 [2019-12-27 17:04:44,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2019-12-27 17:04:44,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-12-27 17:04:44,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 776. [2019-12-27 17:04:44,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-12-27 17:04:44,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1695 transitions. [2019-12-27 17:04:44,506 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1695 transitions. Word has length 60 [2019-12-27 17:04:44,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:44,506 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1695 transitions. [2019-12-27 17:04:44,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 17:04:44,507 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1695 transitions. [2019-12-27 17:04:44,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 17:04:44,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:44,508 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:04:44,508 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:44,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:44,509 INFO L82 PathProgramCache]: Analyzing trace with hash 483952232, now seen corresponding path program 4 times [2019-12-27 17:04:44,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:44,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269589174] [2019-12-27 17:04:44,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:04:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:04:44,616 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:04:44,617 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:04:44,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1133~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1133~0.base_21|) |v_ULTIMATE.start_main_~#t1133~0.offset_16| 0)) |v_#memory_int_27|) (= v_~z$r_buff1_thd1~0_136 0) (= 0 v_~__unbuffered_p3_EBX~0_151) (= (select .cse0 |v_ULTIMATE.start_main_~#t1133~0.base_21|) 0) (= 0 v_~__unbuffered_p0_EAX~0_45) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_ULTIMATE.start_main_~#t1133~0.offset_16| 0) (= |v_#NULL.offset_7| 0) (= v_~__unbuffered_p3_EAX~0_151 0) (= v_~__unbuffered_cnt~0_172 0) (= v_~main$tmp_guard0~0_29 0) (= v_~z$r_buff1_thd0~0_320 0) (= v_~y~0_38 0) (= v_~z$w_buff1~0_115 0) (= 0 v_~weak$$choice0~0_17) (= v_~z$mem_tmp~0_24 0) (= v_~z$read_delayed~0_5 0) (= v_~z$r_buff0_thd2~0_135 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t1133~0.base_21| 4)) (= 0 v_~z$r_buff1_thd3~0_221) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff1_thd2~0_136 0) (= v_~z$w_buff1_used~0_340 0) (= v_~main$tmp_guard1~0_28 0) (= 0 v_~z$flush_delayed~0_43) (= v_~z$w_buff0_used~0_571 0) (= v_~b~0_164 0) (= 0 v_~z$r_buff0_thd3~0_200) (< 0 |v_#StackHeapBarrier_20|) (= 0 |v_#NULL.base_7|) (= v_~z~0_188 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t1133~0.base_21| 1)) (= v_~weak$$choice2~0_123 0) (= v_~a~0_136 0) (= v_~z$r_buff0_thd0~0_374 0) (= v_~z$r_buff0_thd1~0_137 0) (= 0 v_~__unbuffered_p1_EAX~0_36) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1133~0.base_21|) (= 0 v_~z$r_buff1_thd4~0_193) (= v_~z$w_buff0~0_113 0) (= v_~x~0_47 0) (= 0 v_~z$r_buff0_thd4~0_323))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_28|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_80|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_136, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_40|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, ULTIMATE.start_main_~#t1134~0.offset=|v_ULTIMATE.start_main_~#t1134~0.offset_16|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_27|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_16|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_32|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_49|, ~a~0=v_~a~0_136, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_374, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_45, ULTIMATE.start_main_~#t1136~0.base=|v_ULTIMATE.start_main_~#t1136~0.base_22|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_323, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_151, #length=|v_#length_27|, ULTIMATE.start_main_~#t1133~0.base=|v_ULTIMATE.start_main_~#t1133~0.base_21|, ULTIMATE.start_main_~#t1134~0.base=|v_ULTIMATE.start_main_~#t1134~0.base_22|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_73|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_105|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_340, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_192|, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_18|, ULTIMATE.start_main_~#t1136~0.offset=|v_ULTIMATE.start_main_~#t1136~0.offset_16|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_28|, ~weak$$choice0~0=v_~weak$$choice0~0_17, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_44|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_136, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_200, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_172, ULTIMATE.start_main_~#t1135~0.offset=|v_ULTIMATE.start_main_~#t1135~0.offset_16|, ~x~0=v_~x~0_47, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_193, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_27|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~z$w_buff1~0=v_~z$w_buff1~0_115, ULTIMATE.start_main_~#t1135~0.base=|v_ULTIMATE.start_main_~#t1135~0.base_21|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_42|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_22|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_32|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_320, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_26|, ~y~0=v_~y~0_38, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_135, ULTIMATE.start_main_~#t1133~0.offset=|v_ULTIMATE.start_main_~#t1133~0.offset_16|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_571, ~z$w_buff0~0=v_~z$w_buff0~0_113, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_26|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_221, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_120|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_30|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_151, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_27|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ~b~0=v_~b~0_164, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_15|, ~z~0=v_~z~0_188, ~weak$$choice2~0=v_~weak$$choice2~0_123, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_137} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t1134~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1136~0.base, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t1133~0.base, ULTIMATE.start_main_~#t1134~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_~#t1136~0.offset, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1135~0.offset, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ULTIMATE.start_main_~#t1135~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1133~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 17:04:44,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L835-1-->L837: Formula: (and (= |v_ULTIMATE.start_main_~#t1134~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1134~0.base_12|)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1134~0.base_12| 4)) (= (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1134~0.base_12| 1) |v_#valid_44|) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1134~0.base_12|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1134~0.base_12|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1134~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1134~0.base_12|) |v_ULTIMATE.start_main_~#t1134~0.offset_10| 1)) |v_#memory_int_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1134~0.base=|v_ULTIMATE.start_main_~#t1134~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t1134~0.offset=|v_ULTIMATE.start_main_~#t1134~0.offset_10|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1134~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1134~0.offset, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 17:04:44,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L837-1-->L839: Formula: (and (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1135~0.base_8|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1135~0.base_8|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1135~0.base_8| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1135~0.base_8|) |v_ULTIMATE.start_main_~#t1135~0.offset_8| 2)) |v_#memory_int_17|) (= 0 |v_ULTIMATE.start_main_~#t1135~0.offset_8|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1135~0.base_8| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1135~0.base_8| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1135~0.base_8|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_3|, ULTIMATE.start_main_~#t1135~0.base=|v_ULTIMATE.start_main_~#t1135~0.base_8|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1135~0.offset=|v_ULTIMATE.start_main_~#t1135~0.offset_8|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1135~0.base, #length, ULTIMATE.start_main_~#t1135~0.offset] because there is no mapped edge [2019-12-27 17:04:44,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L839-1-->L841: Formula: (and (= |v_ULTIMATE.start_main_~#t1136~0.offset_10| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1136~0.base_12| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1136~0.base_12|) |v_ULTIMATE.start_main_~#t1136~0.offset_10| 3)) |v_#memory_int_23|) (not (= 0 |v_ULTIMATE.start_main_~#t1136~0.base_12|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1136~0.base_12| 4)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1136~0.base_12| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1136~0.base_12|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1136~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1136~0.base=|v_ULTIMATE.start_main_~#t1136~0.base_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, ULTIMATE.start_main_~#t1136~0.offset=|v_ULTIMATE.start_main_~#t1136~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1136~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1136~0.offset] because there is no mapped edge [2019-12-27 17:04:44,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L4-->L812: Formula: (and (= ~__unbuffered_p3_EBX~0_Out-447320166 ~b~0_In-447320166) (not (= P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-447320166 0)) (= ~z$r_buff1_thd2~0_Out-447320166 ~z$r_buff0_thd2~0_In-447320166) (= ~z$r_buff1_thd0~0_Out-447320166 ~z$r_buff0_thd0~0_In-447320166) (= 1 ~a~0_Out-447320166) (= ~z$r_buff0_thd4~0_Out-447320166 1) (= ~z$r_buff0_thd1~0_In-447320166 ~z$r_buff1_thd1~0_Out-447320166) (= ~__unbuffered_p3_EAX~0_Out-447320166 ~a~0_Out-447320166) (= ~z$r_buff0_thd4~0_In-447320166 ~z$r_buff1_thd4~0_Out-447320166) (= ~z$r_buff1_thd3~0_Out-447320166 ~z$r_buff0_thd3~0_In-447320166)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-447320166, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-447320166, ~b~0=~b~0_In-447320166, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-447320166, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-447320166, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-447320166, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-447320166} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-447320166, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-447320166, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-447320166, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-447320166, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-447320166, ~a~0=~a~0_Out-447320166, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-447320166, ~b~0=~b~0_In-447320166, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-447320166, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-447320166, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-447320166, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-447320166, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-447320166, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-447320166, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-447320166} AuxVars[] AssignedVars[~a~0, ~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, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 17:04:44,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_20 |v_P0Thread1of1ForFork0_#in~arg.base_20|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.offset_20 |v_P0Thread1of1ForFork0_#in~arg.offset_20|) (= v_~x~0_33 v_~__unbuffered_p0_EAX~0_26) (= v_~b~0_72 1) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_20|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, ~x~0=v_~x~0_33} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_20|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_72, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_20|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_20, ~x~0=v_~x~0_33, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_20} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 17:04:44,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= v_~y~0_25 v_~__unbuffered_p1_EAX~0_14) (= |v_P1Thread1of1ForFork1_#in~arg.offset_10| v_P1Thread1of1ForFork1_~arg.offset_10) (= v_~x~0_18 1) (= v_P1Thread1of1ForFork1_~arg.base_10 |v_P1Thread1of1ForFork1_#in~arg.base_10|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y~0=v_~y~0_25} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_10, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_10, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~y~0=v_~y~0_25, ~x~0=v_~x~0_18, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 17:04:44,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-856040228 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-856040228 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out-856040228| ~z$w_buff0_used~0_In-856040228)) (and (not .cse0) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out-856040228|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-856040228, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-856040228} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-856040228, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-856040228, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-856040228|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 17:04:44,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L776-2-->L776-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-712265834 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-712265834 256)))) (or (and (= ~z~0_In-712265834 |P2Thread1of1ForFork2_#t~ite3_Out-712265834|) (or .cse0 .cse1)) (and (= ~z$w_buff1~0_In-712265834 |P2Thread1of1ForFork2_#t~ite3_Out-712265834|) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-712265834, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-712265834, ~z$w_buff1~0=~z$w_buff1~0_In-712265834, ~z~0=~z~0_In-712265834} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-712265834|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-712265834, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-712265834, ~z$w_buff1~0=~z$w_buff1~0_In-712265834, ~z~0=~z~0_In-712265834} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 17:04:44,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L776-4-->L777: Formula: (= v_~z~0_18 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_9|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-27 17:04:44,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-496358353 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-496358353 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite5_Out-496358353|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-496358353 |P2Thread1of1ForFork2_#t~ite5_Out-496358353|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-496358353, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-496358353} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-496358353|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-496358353, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-496358353} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 17:04:44,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L778-->L778-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-2125064542 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-2125064542 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-2125064542 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2125064542 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite6_Out-2125064542|)) (and (= |P2Thread1of1ForFork2_#t~ite6_Out-2125064542| ~z$w_buff1_used~0_In-2125064542) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2125064542, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2125064542, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2125064542, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2125064542} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-2125064542|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2125064542, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2125064542, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2125064542, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2125064542} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 17:04:44,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1222242023 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1222242023 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite7_Out1222242023| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out1222242023| ~z$r_buff0_thd3~0_In1222242023)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1222242023, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1222242023} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1222242023, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1222242023, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out1222242023|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 17:04:44,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In621547805 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In621547805 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In621547805 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In621547805 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite8_Out621547805|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In621547805 |P2Thread1of1ForFork2_#t~ite8_Out621547805|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In621547805, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In621547805, ~z$w_buff1_used~0=~z$w_buff1_used~0_In621547805, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In621547805} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In621547805, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In621547805, ~z$w_buff1_used~0=~z$w_buff1_used~0_In621547805, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In621547805, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out621547805|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 17:04:44,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L780-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite8_44| v_~z$r_buff1_thd3~0_114) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_44|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_114, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_43|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 17:04:44,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L814-->L814-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd4~0_In720757199 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In720757199 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In720757199 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In720757199 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In720757199 |P3Thread1of1ForFork3_#t~ite12_Out720757199|)) (and (= |P3Thread1of1ForFork3_#t~ite12_Out720757199| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In720757199, ~z$w_buff0_used~0=~z$w_buff0_used~0_In720757199, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In720757199, ~z$w_buff1_used~0=~z$w_buff1_used~0_In720757199} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In720757199, ~z$w_buff0_used~0=~z$w_buff0_used~0_In720757199, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In720757199, ~z$w_buff1_used~0=~z$w_buff1_used~0_In720757199, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out720757199|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-27 17:04:44,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L815-->L816: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2142325399 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In2142325399 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out2142325399 ~z$r_buff0_thd4~0_In2142325399)) (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd4~0_Out2142325399 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2142325399, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2142325399} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2142325399, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out2142325399, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out2142325399|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-27 17:04:44,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L816-->L816-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd4~0_In-2065238238 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-2065238238 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-2065238238 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-2065238238 256) 0))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite14_Out-2065238238|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$r_buff1_thd4~0_In-2065238238 |P3Thread1of1ForFork3_#t~ite14_Out-2065238238|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2065238238, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2065238238, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2065238238, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2065238238} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2065238238, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2065238238, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-2065238238|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2065238238, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2065238238} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-27 17:04:44,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= |v_P3Thread1of1ForFork3_#t~ite14_48| v_~z$r_buff1_thd4~0_102)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_48|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_102, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_47|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 17:04:44,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L845-->L847-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_79 256)) (= (mod v_~z$r_buff0_thd0~0_53 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_53, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_53, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 17:04:44,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L847-2-->L847-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-2062782090 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite19_Out-2062782090| |ULTIMATE.start_main_#t~ite20_Out-2062782090|)) (.cse0 (= (mod ~z$w_buff1_used~0_In-2062782090 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In-2062782090 |ULTIMATE.start_main_#t~ite19_Out-2062782090|) .cse2) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out-2062782090| ~z$w_buff1~0_In-2062782090) .cse2 (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2062782090, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2062782090, ~z$w_buff1~0=~z$w_buff1~0_In-2062782090, ~z~0=~z~0_In-2062782090} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-2062782090|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2062782090, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2062782090, ~z$w_buff1~0=~z$w_buff1~0_In-2062782090, ~z~0=~z~0_In-2062782090, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-2062782090|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 17:04:44,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-328479300 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-328479300 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-328479300| ~z$w_buff0_used~0_In-328479300) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite21_Out-328479300| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-328479300, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-328479300} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-328479300, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-328479300, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-328479300|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 17:04:44,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L849-->L849-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-225082888 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-225082888 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-225082888 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-225082888 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-225082888| ~z$w_buff1_used~0_In-225082888) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite22_Out-225082888| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-225082888, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-225082888, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-225082888, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-225082888} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-225082888, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-225082888, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-225082888, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-225082888, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-225082888|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 17:04:44,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L850-->L850-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1419069691 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1419069691 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1419069691 |ULTIMATE.start_main_#t~ite23_Out1419069691|)) (and (= 0 |ULTIMATE.start_main_#t~ite23_Out1419069691|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1419069691, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1419069691} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1419069691, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1419069691, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1419069691|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 17:04:44,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L851-->L851-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In60598353 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In60598353 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In60598353 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In60598353 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite24_Out60598353|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd0~0_In60598353 |ULTIMATE.start_main_#t~ite24_Out60598353|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In60598353, ~z$w_buff0_used~0=~z$w_buff0_used~0_In60598353, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In60598353, ~z$w_buff1_used~0=~z$w_buff1_used~0_In60598353} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In60598353, ~z$w_buff0_used~0=~z$w_buff0_used~0_In60598353, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In60598353, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out60598353|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In60598353} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 17:04:44,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L861-->L861-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In380537780 256) 0))) (or (and (= ~z$w_buff0_used~0_In380537780 |ULTIMATE.start_main_#t~ite37_Out380537780|) (not .cse0) (= |ULTIMATE.start_main_#t~ite36_In380537780| |ULTIMATE.start_main_#t~ite36_Out380537780|)) (and .cse0 (= ~z$w_buff0_used~0_In380537780 |ULTIMATE.start_main_#t~ite36_Out380537780|) (= |ULTIMATE.start_main_#t~ite37_Out380537780| |ULTIMATE.start_main_#t~ite36_Out380537780|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In380537780 256)))) (or (= (mod ~z$w_buff0_used~0_In380537780 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In380537780 256)) .cse1) (and (= (mod ~z$r_buff1_thd0~0_In380537780 256) 0) .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In380537780, ~z$w_buff0_used~0=~z$w_buff0_used~0_In380537780, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In380537780, ~z$w_buff1_used~0=~z$w_buff1_used~0_In380537780, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_In380537780|, ~weak$$choice2~0=~weak$$choice2~0_In380537780} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In380537780, ~z$w_buff0_used~0=~z$w_buff0_used~0_In380537780, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In380537780, ~z$w_buff1_used~0=~z$w_buff1_used~0_In380537780, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out380537780|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out380537780|, ~weak$$choice2~0=~weak$$choice2~0_In380537780} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 17:04:44,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L862-->L862-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1587101344 256)))) (or (and (= ~z$w_buff1_used~0_In1587101344 |ULTIMATE.start_main_#t~ite40_Out1587101344|) (not .cse0) (= |ULTIMATE.start_main_#t~ite39_In1587101344| |ULTIMATE.start_main_#t~ite39_Out1587101344|)) (and .cse0 (= |ULTIMATE.start_main_#t~ite40_Out1587101344| |ULTIMATE.start_main_#t~ite39_Out1587101344|) (= ~z$w_buff1_used~0_In1587101344 |ULTIMATE.start_main_#t~ite39_Out1587101344|) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1587101344 256) 0))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1587101344 256))) (= (mod ~z$w_buff0_used~0_In1587101344 256) 0) (and .cse1 (= (mod ~z$w_buff1_used~0_In1587101344 256) 0))))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1587101344, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1587101344, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In1587101344|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1587101344, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1587101344, ~weak$$choice2~0=~weak$$choice2~0_In1587101344} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1587101344, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1587101344|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1587101344|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1587101344, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1587101344, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1587101344, ~weak$$choice2~0=~weak$$choice2~0_In1587101344} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 17:04:44,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L863-->L864: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~z$r_buff0_thd0~0_79 v_~z$r_buff0_thd0~0_80)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_79, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 17:04:44,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L866-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (not (= (mod v_~z$flush_delayed~0_29 256) 0)) (= v_~z$mem_tmp~0_15 v_~z~0_103) (= 0 v_~z$flush_delayed~0_28)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_29} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ~z~0=v_~z~0_103, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:04:44,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 17:04:44,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:04:44 BasicIcfg [2019-12-27 17:04:44,737 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:04:44,739 INFO L168 Benchmark]: Toolchain (without parser) took 74549.27 ms. Allocated memory was 146.3 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 102.2 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-27 17:04:44,740 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 17:04:44,740 INFO L168 Benchmark]: CACSL2BoogieTranslator took 812.89 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.0 MB in the beginning and 155.2 MB in the end (delta: -53.2 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:04:44,741 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.81 ms. Allocated memory is still 203.9 MB. Free memory was 155.2 MB in the beginning and 151.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-27 17:04:44,741 INFO L168 Benchmark]: Boogie Preprocessor took 41.28 ms. Allocated memory is still 203.9 MB. Free memory was 151.9 MB in the beginning and 150.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:04:44,742 INFO L168 Benchmark]: RCFGBuilder took 871.01 ms. Allocated memory is still 203.9 MB. Free memory was 149.3 MB in the beginning and 99.9 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2019-12-27 17:04:44,742 INFO L168 Benchmark]: TraceAbstraction took 72744.70 ms. Allocated memory was 203.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 99.9 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 962.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:04:44,745 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.20 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 812.89 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.0 MB in the beginning and 155.2 MB in the end (delta: -53.2 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.81 ms. Allocated memory is still 203.9 MB. Free memory was 155.2 MB in the beginning and 151.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.28 ms. Allocated memory is still 203.9 MB. Free memory was 151.9 MB in the beginning and 150.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 871.01 ms. Allocated memory is still 203.9 MB. Free memory was 149.3 MB in the beginning and 99.9 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 72744.70 ms. Allocated memory was 203.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 99.9 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 962.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 182 ProgramPointsBefore, 90 ProgramPointsAfterwards, 210 TransitionsBefore, 97 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 26 ChoiceCompositions, 4720 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 226 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 56592 CheckedPairsTotal, 126 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t1133, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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(&t1134, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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(&t1135, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L841] FCALL, FORK 0 pthread_create(&t1136, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L790] 4 z$w_buff1 = z$w_buff0 [L791] 4 z$w_buff0 = 2 [L792] 4 z$w_buff1_used = z$w_buff0_used [L793] 4 z$w_buff0_used = (_Bool)1 [L812] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 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) [L776] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L778] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L779] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 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 [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 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 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 72.4s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 30.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3069 SDtfs, 4877 SDslu, 10365 SDs, 0 SdLazy, 8027 SolverSat, 491 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 314 GetRequests, 41 SyntacticMatches, 19 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1162 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65578occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 27.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 164933 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 859 NumberOfCodeBlocks, 859 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 778 ConstructedInterpolants, 0 QuantifiedInterpolants, 194039 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...