/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/mix042_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:02:34,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:02:34,813 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:02:34,831 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:02:34,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:02:34,834 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:02:34,836 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:02:34,843 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:02:34,845 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:02:34,849 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:02:34,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:02:34,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:02:34,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:02:34,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:02:34,853 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:02:34,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:02:34,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:02:34,856 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:02:34,858 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:02:34,861 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:02:34,862 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:02:34,866 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:02:34,867 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:02:34,867 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:02:34,873 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:02:34,873 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:02:34,873 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:02:34,874 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:02:34,875 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:02:34,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:02:34,876 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:02:34,879 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:02:34,880 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:02:34,880 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:02:34,881 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:02:34,881 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:02:34,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:02:34,883 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:02:34,883 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:02:34,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:02:34,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:02:34,889 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:02:34,918 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:02:34,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:02:34,922 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:02:34,922 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:02:34,923 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:02:34,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:02:34,923 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:02:34,923 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:02:34,924 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:02:34,924 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:02:34,925 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:02:34,925 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:02:34,925 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:02:34,926 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:02:34,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:02:34,926 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:02:34,926 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:02:34,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:02:34,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:02:34,927 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:02:34,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:02:34,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:02:34,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:02:34,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:02:34,928 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:02:34,928 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:02:34,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:02:34,929 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:02:34,929 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:02:34,929 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:02:34,930 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:02:35,202 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:02:35,218 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:02:35,221 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:02:35,222 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:02:35,222 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:02:35,223 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_pso.opt.i [2019-12-27 17:02:35,286 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60e738f55/de76178bb0164bb49a5f5c87a9e5b630/FLAGd3e365502 [2019-12-27 17:02:35,837 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:02:35,838 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_pso.opt.i [2019-12-27 17:02:35,858 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60e738f55/de76178bb0164bb49a5f5c87a9e5b630/FLAGd3e365502 [2019-12-27 17:02:36,132 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60e738f55/de76178bb0164bb49a5f5c87a9e5b630 [2019-12-27 17:02:36,141 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:02:36,143 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:02:36,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:02:36,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:02:36,147 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:02:36,147 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:02:36" (1/1) ... [2019-12-27 17:02:36,150 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1548a6b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:36, skipping insertion in model container [2019-12-27 17:02:36,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:02:36" (1/1) ... [2019-12-27 17:02:36,157 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:02:36,204 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:02:36,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:02:36,791 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:02:36,865 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:02:36,940 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:02:36,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:36 WrapperNode [2019-12-27 17:02:36,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:02:36,942 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:02:36,942 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:02:36,942 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:02:36,953 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:02:36" (1/1) ... [2019-12-27 17:02:36,973 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:02:36" (1/1) ... [2019-12-27 17:02:37,021 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:02:37,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:02:37,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:02:37,022 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:02:37,031 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:36" (1/1) ... [2019-12-27 17:02:37,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:36" (1/1) ... [2019-12-27 17:02:37,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:36" (1/1) ... [2019-12-27 17:02:37,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:36" (1/1) ... [2019-12-27 17:02:37,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:36" (1/1) ... [2019-12-27 17:02:37,051 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:36" (1/1) ... [2019-12-27 17:02:37,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:36" (1/1) ... [2019-12-27 17:02:37,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:02:37,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:02:37,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:02:37,061 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:02:37,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:36" (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:02:37,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:02:37,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:02:37,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:02:37,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:02:37,135 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:02:37,135 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:02:37,136 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:02:37,136 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:02:37,136 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 17:02:37,136 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 17:02:37,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:02:37,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:02:37,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:02:37,139 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:02:37,843 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:02:37,843 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:02:37,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:02:37 BoogieIcfgContainer [2019-12-27 17:02:37,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:02:37,846 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:02:37,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:02:37,849 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:02:37,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:02:36" (1/3) ... [2019-12-27 17:02:37,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6720a525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:02:37, skipping insertion in model container [2019-12-27 17:02:37,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:36" (2/3) ... [2019-12-27 17:02:37,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6720a525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:02:37, skipping insertion in model container [2019-12-27 17:02:37,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:02:37" (3/3) ... [2019-12-27 17:02:37,854 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_pso.opt.i [2019-12-27 17:02:37,865 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:02:37,865 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:02:37,877 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:02:37,878 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:02:37,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,920 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,920 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,927 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,927 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,941 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,941 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,942 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,943 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,943 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,958 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,958 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,965 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,995 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,996 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:37,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:38,000 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:38,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:38,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:38,001 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:38,019 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 17:02:38,045 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:02:38,045 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:02:38,045 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:02:38,046 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:02:38,049 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:02:38,050 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:02:38,050 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:02:38,050 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:02:38,079 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-27 17:02:38,081 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-27 17:02:38,183 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-27 17:02:38,183 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:02:38,196 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 17:02:38,217 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-27 17:02:38,264 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-27 17:02:38,264 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:02:38,270 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 17:02:38,285 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 17:02:38,286 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:02:43,092 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 17:02:43,224 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 17:02:43,245 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50142 [2019-12-27 17:02:43,245 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-27 17:02:43,249 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 86 transitions [2019-12-27 17:02:44,141 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14254 states. [2019-12-27 17:02:44,143 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states. [2019-12-27 17:02:44,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 17:02:44,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:44,150 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:02:44,151 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:44,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:44,158 INFO L82 PathProgramCache]: Analyzing trace with hash -632784469, now seen corresponding path program 1 times [2019-12-27 17:02:44,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:44,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106584640] [2019-12-27 17:02:44,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:44,381 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:02:44,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106584640] [2019-12-27 17:02:44,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:44,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:02:44,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1838829751] [2019-12-27 17:02:44,385 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:44,391 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:44,405 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 17:02:44,405 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:44,409 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:02:44,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:02:44,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:44,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:02:44,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:02:44,428 INFO L87 Difference]: Start difference. First operand 14254 states. Second operand 3 states. [2019-12-27 17:02:44,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:44,817 INFO L93 Difference]: Finished difference Result 14182 states and 53160 transitions. [2019-12-27 17:02:44,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:02:44,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 17:02:44,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:44,969 INFO L225 Difference]: With dead ends: 14182 [2019-12-27 17:02:44,969 INFO L226 Difference]: Without dead ends: 13870 [2019-12-27 17:02:44,970 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:02:45,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2019-12-27 17:02:45,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 13870. [2019-12-27 17:02:45,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13870 states. [2019-12-27 17:02:45,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13870 states to 13870 states and 52042 transitions. [2019-12-27 17:02:45,740 INFO L78 Accepts]: Start accepts. Automaton has 13870 states and 52042 transitions. Word has length 7 [2019-12-27 17:02:45,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:45,741 INFO L462 AbstractCegarLoop]: Abstraction has 13870 states and 52042 transitions. [2019-12-27 17:02:45,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:02:45,741 INFO L276 IsEmpty]: Start isEmpty. Operand 13870 states and 52042 transitions. [2019-12-27 17:02:45,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 17:02:45,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:45,752 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:02:45,753 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:45,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:45,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1056225825, now seen corresponding path program 1 times [2019-12-27 17:02:45,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:45,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2450724] [2019-12-27 17:02:45,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:45,918 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:02:45,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2450724] [2019-12-27 17:02:45,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:45,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:02:45,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1299823127] [2019-12-27 17:02:45,921 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:45,922 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:45,932 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 17:02:45,932 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:45,933 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:02:45,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:02:45,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:45,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:02:45,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:02:45,936 INFO L87 Difference]: Start difference. First operand 13870 states and 52042 transitions. Second operand 4 states. [2019-12-27 17:02:46,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:46,498 INFO L93 Difference]: Finished difference Result 19034 states and 69248 transitions. [2019-12-27 17:02:46,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:02:46,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 17:02:46,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:47,512 INFO L225 Difference]: With dead ends: 19034 [2019-12-27 17:02:47,512 INFO L226 Difference]: Without dead ends: 19034 [2019-12-27 17:02:47,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:02:47,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19034 states. [2019-12-27 17:02:48,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19034 to 18800. [2019-12-27 17:02:48,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18800 states. [2019-12-27 17:02:48,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18800 states to 18800 states and 68487 transitions. [2019-12-27 17:02:48,286 INFO L78 Accepts]: Start accepts. Automaton has 18800 states and 68487 transitions. Word has length 13 [2019-12-27 17:02:48,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:48,286 INFO L462 AbstractCegarLoop]: Abstraction has 18800 states and 68487 transitions. [2019-12-27 17:02:48,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:02:48,287 INFO L276 IsEmpty]: Start isEmpty. Operand 18800 states and 68487 transitions. [2019-12-27 17:02:48,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 17:02:48,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:48,289 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:02:48,289 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:48,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:48,289 INFO L82 PathProgramCache]: Analyzing trace with hash 746093816, now seen corresponding path program 1 times [2019-12-27 17:02:48,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:48,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643335832] [2019-12-27 17:02:48,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:48,351 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:02:48,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643335832] [2019-12-27 17:02:48,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:48,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:02:48,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [164043047] [2019-12-27 17:02:48,353 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:48,355 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:48,358 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 37 transitions. [2019-12-27 17:02:48,359 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:48,401 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:02:48,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:02:48,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:48,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:02:48,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:02:48,404 INFO L87 Difference]: Start difference. First operand 18800 states and 68487 transitions. Second operand 5 states. [2019-12-27 17:02:48,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:48,852 INFO L93 Difference]: Finished difference Result 27022 states and 96312 transitions. [2019-12-27 17:02:48,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:02:48,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 17:02:48,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:48,973 INFO L225 Difference]: With dead ends: 27022 [2019-12-27 17:02:48,973 INFO L226 Difference]: Without dead ends: 27008 [2019-12-27 17:02:48,973 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:02:49,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27008 states. [2019-12-27 17:02:49,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27008 to 22366. [2019-12-27 17:02:49,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22366 states. [2019-12-27 17:02:49,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22366 states to 22366 states and 80994 transitions. [2019-12-27 17:02:49,950 INFO L78 Accepts]: Start accepts. Automaton has 22366 states and 80994 transitions. Word has length 13 [2019-12-27 17:02:49,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:49,950 INFO L462 AbstractCegarLoop]: Abstraction has 22366 states and 80994 transitions. [2019-12-27 17:02:49,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:02:49,951 INFO L276 IsEmpty]: Start isEmpty. Operand 22366 states and 80994 transitions. [2019-12-27 17:02:49,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 17:02:49,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:49,958 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:02:49,958 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:49,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:49,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1347005908, now seen corresponding path program 1 times [2019-12-27 17:02:49,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:49,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211349716] [2019-12-27 17:02:49,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:50,071 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:02:50,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211349716] [2019-12-27 17:02:50,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:50,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:02:50,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [484725950] [2019-12-27 17:02:50,073 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:50,075 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:50,079 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 24 transitions. [2019-12-27 17:02:50,079 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:50,079 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:02:50,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:02:50,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:50,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:02:50,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:02:50,080 INFO L87 Difference]: Start difference. First operand 22366 states and 80994 transitions. Second operand 5 states. [2019-12-27 17:02:51,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:51,537 INFO L93 Difference]: Finished difference Result 30132 states and 106959 transitions. [2019-12-27 17:02:51,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 17:02:51,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 17:02:51,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:51,637 INFO L225 Difference]: With dead ends: 30132 [2019-12-27 17:02:51,638 INFO L226 Difference]: Without dead ends: 30118 [2019-12-27 17:02:51,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:02:51,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30118 states. [2019-12-27 17:02:52,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30118 to 22270. [2019-12-27 17:02:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22270 states. [2019-12-27 17:02:52,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22270 states to 22270 states and 80486 transitions. [2019-12-27 17:02:52,463 INFO L78 Accepts]: Start accepts. Automaton has 22270 states and 80486 transitions. Word has length 19 [2019-12-27 17:02:52,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:52,464 INFO L462 AbstractCegarLoop]: Abstraction has 22270 states and 80486 transitions. [2019-12-27 17:02:52,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:02:52,464 INFO L276 IsEmpty]: Start isEmpty. Operand 22270 states and 80486 transitions. [2019-12-27 17:02:52,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:02:52,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:52,507 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] [2019-12-27 17:02:52,508 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:52,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:52,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023153, now seen corresponding path program 1 times [2019-12-27 17:02:52,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:52,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263697341] [2019-12-27 17:02:52,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:52,614 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:02:52,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263697341] [2019-12-27 17:02:52,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:52,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:02:52,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1508969078] [2019-12-27 17:02:52,616 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:52,626 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:52,854 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 17:02:52,854 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:52,854 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:02:52,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:02:52,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:52,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:02:52,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:02:52,855 INFO L87 Difference]: Start difference. First operand 22270 states and 80486 transitions. Second operand 4 states. [2019-12-27 17:02:52,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:52,938 INFO L93 Difference]: Finished difference Result 13342 states and 41523 transitions. [2019-12-27 17:02:52,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:02:52,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-27 17:02:52,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:52,968 INFO L225 Difference]: With dead ends: 13342 [2019-12-27 17:02:52,969 INFO L226 Difference]: Without dead ends: 12812 [2019-12-27 17:02:52,969 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:02:53,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12812 states. [2019-12-27 17:02:53,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12812 to 12812. [2019-12-27 17:02:53,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12812 states. [2019-12-27 17:02:53,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12812 states to 12812 states and 40017 transitions. [2019-12-27 17:02:53,273 INFO L78 Accepts]: Start accepts. Automaton has 12812 states and 40017 transitions. Word has length 27 [2019-12-27 17:02:53,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:53,273 INFO L462 AbstractCegarLoop]: Abstraction has 12812 states and 40017 transitions. [2019-12-27 17:02:53,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:02:53,273 INFO L276 IsEmpty]: Start isEmpty. Operand 12812 states and 40017 transitions. [2019-12-27 17:02:53,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 17:02:53,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:53,285 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:02:53,286 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:53,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:53,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1806206056, now seen corresponding path program 1 times [2019-12-27 17:02:53,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:53,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258412305] [2019-12-27 17:02:53,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:53,360 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:02:53,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258412305] [2019-12-27 17:02:53,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:53,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:02:53,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [799932766] [2019-12-27 17:02:53,362 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:53,369 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:53,378 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 36 transitions. [2019-12-27 17:02:53,378 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:53,400 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:02:53,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:02:53,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:53,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:02:53,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:02:53,401 INFO L87 Difference]: Start difference. First operand 12812 states and 40017 transitions. Second operand 6 states. [2019-12-27 17:02:53,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:53,465 INFO L93 Difference]: Finished difference Result 2336 states and 5507 transitions. [2019-12-27 17:02:53,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:02:53,466 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 17:02:53,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:53,472 INFO L225 Difference]: With dead ends: 2336 [2019-12-27 17:02:53,472 INFO L226 Difference]: Without dead ends: 2027 [2019-12-27 17:02:53,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:02:53,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2019-12-27 17:02:53,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 2027. [2019-12-27 17:02:53,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2027 states. [2019-12-27 17:02:53,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 4646 transitions. [2019-12-27 17:02:53,501 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 4646 transitions. Word has length 28 [2019-12-27 17:02:53,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:53,502 INFO L462 AbstractCegarLoop]: Abstraction has 2027 states and 4646 transitions. [2019-12-27 17:02:53,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:02:53,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 4646 transitions. [2019-12-27 17:02:53,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 17:02:53,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:53,506 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:02:53,506 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:53,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:53,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1654876811, now seen corresponding path program 1 times [2019-12-27 17:02:53,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:53,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510527447] [2019-12-27 17:02:53,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:53,616 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:02:53,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510527447] [2019-12-27 17:02:53,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:53,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:02:53,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1784368137] [2019-12-27 17:02:53,617 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:53,625 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:53,650 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 96 transitions. [2019-12-27 17:02:53,650 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:53,669 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:02:53,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:02:53,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:53,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:02:53,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:02:53,670 INFO L87 Difference]: Start difference. First operand 2027 states and 4646 transitions. Second operand 8 states. [2019-12-27 17:02:54,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:54,251 INFO L93 Difference]: Finished difference Result 2515 states and 5603 transitions. [2019-12-27 17:02:54,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 17:02:54,252 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-12-27 17:02:54,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:54,256 INFO L225 Difference]: With dead ends: 2515 [2019-12-27 17:02:54,257 INFO L226 Difference]: Without dead ends: 2513 [2019-12-27 17:02:54,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:02:54,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2019-12-27 17:02:54,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2212. [2019-12-27 17:02:54,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2212 states. [2019-12-27 17:02:54,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2212 states to 2212 states and 5015 transitions. [2019-12-27 17:02:54,359 INFO L78 Accepts]: Start accepts. Automaton has 2212 states and 5015 transitions. Word has length 40 [2019-12-27 17:02:54,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:54,359 INFO L462 AbstractCegarLoop]: Abstraction has 2212 states and 5015 transitions. [2019-12-27 17:02:54,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:02:54,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2212 states and 5015 transitions. [2019-12-27 17:02:54,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 17:02:54,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:54,364 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] [2019-12-27 17:02:54,364 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:54,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:54,364 INFO L82 PathProgramCache]: Analyzing trace with hash 128435677, now seen corresponding path program 1 times [2019-12-27 17:02:54,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:54,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282845714] [2019-12-27 17:02:54,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:54,423 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:02:54,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282845714] [2019-12-27 17:02:54,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:54,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:02:54,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2081181180] [2019-12-27 17:02:54,424 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:54,439 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:54,462 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 54 transitions. [2019-12-27 17:02:54,462 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:54,462 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:02:54,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:02:54,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:54,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:02:54,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:02:54,464 INFO L87 Difference]: Start difference. First operand 2212 states and 5015 transitions. Second operand 3 states. [2019-12-27 17:02:54,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:54,512 INFO L93 Difference]: Finished difference Result 2673 states and 6073 transitions. [2019-12-27 17:02:54,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:02:54,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-27 17:02:54,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:54,519 INFO L225 Difference]: With dead ends: 2673 [2019-12-27 17:02:54,519 INFO L226 Difference]: Without dead ends: 2673 [2019-12-27 17:02:54,519 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:02:54,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2019-12-27 17:02:54,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2403. [2019-12-27 17:02:54,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2403 states. [2019-12-27 17:02:54,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2403 states to 2403 states and 5508 transitions. [2019-12-27 17:02:54,556 INFO L78 Accepts]: Start accepts. Automaton has 2403 states and 5508 transitions. Word has length 44 [2019-12-27 17:02:54,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:54,556 INFO L462 AbstractCegarLoop]: Abstraction has 2403 states and 5508 transitions. [2019-12-27 17:02:54,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:02:54,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states and 5508 transitions. [2019-12-27 17:02:54,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 17:02:54,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:54,560 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] [2019-12-27 17:02:54,561 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:54,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:54,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1698133153, now seen corresponding path program 1 times [2019-12-27 17:02:54,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:54,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688044718] [2019-12-27 17:02:54,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:54,648 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:02:54,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688044718] [2019-12-27 17:02:54,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:54,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:02:54,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [476487911] [2019-12-27 17:02:54,649 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:54,660 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:54,678 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 54 transitions. [2019-12-27 17:02:54,679 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:54,679 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:02:54,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:02:54,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:54,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:02:54,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:02:54,680 INFO L87 Difference]: Start difference. First operand 2403 states and 5508 transitions. Second operand 5 states. [2019-12-27 17:02:55,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:55,162 INFO L93 Difference]: Finished difference Result 3250 states and 7346 transitions. [2019-12-27 17:02:55,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:02:55,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-27 17:02:55,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:55,166 INFO L225 Difference]: With dead ends: 3250 [2019-12-27 17:02:55,166 INFO L226 Difference]: Without dead ends: 3250 [2019-12-27 17:02:55,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:02:55,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2019-12-27 17:02:55,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 2977. [2019-12-27 17:02:55,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2977 states. [2019-12-27 17:02:55,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2977 states to 2977 states and 6800 transitions. [2019-12-27 17:02:55,203 INFO L78 Accepts]: Start accepts. Automaton has 2977 states and 6800 transitions. Word has length 44 [2019-12-27 17:02:55,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:55,203 INFO L462 AbstractCegarLoop]: Abstraction has 2977 states and 6800 transitions. [2019-12-27 17:02:55,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:02:55,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2977 states and 6800 transitions. [2019-12-27 17:02:55,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 17:02:55,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:55,208 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] [2019-12-27 17:02:55,208 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:55,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:55,209 INFO L82 PathProgramCache]: Analyzing trace with hash 682662632, now seen corresponding path program 1 times [2019-12-27 17:02:55,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:55,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482054779] [2019-12-27 17:02:55,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:55,296 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:02:55,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482054779] [2019-12-27 17:02:55,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:55,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:02:55,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1410477785] [2019-12-27 17:02:55,297 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:55,308 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:55,327 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 55 transitions. [2019-12-27 17:02:55,327 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:55,346 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:02:55,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:02:55,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:55,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:02:55,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:02:55,347 INFO L87 Difference]: Start difference. First operand 2977 states and 6800 transitions. Second operand 7 states. [2019-12-27 17:02:55,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:55,431 INFO L93 Difference]: Finished difference Result 999 states and 2272 transitions. [2019-12-27 17:02:55,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:02:55,434 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-12-27 17:02:55,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:55,435 INFO L225 Difference]: With dead ends: 999 [2019-12-27 17:02:55,435 INFO L226 Difference]: Without dead ends: 929 [2019-12-27 17:02:55,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:02:55,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-12-27 17:02:55,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 799. [2019-12-27 17:02:55,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2019-12-27 17:02:55,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1831 transitions. [2019-12-27 17:02:55,448 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1831 transitions. Word has length 45 [2019-12-27 17:02:55,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:55,448 INFO L462 AbstractCegarLoop]: Abstraction has 799 states and 1831 transitions. [2019-12-27 17:02:55,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:02:55,448 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1831 transitions. [2019-12-27 17:02:55,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 17:02:55,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:55,450 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:02:55,450 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:55,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:55,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1740404695, now seen corresponding path program 1 times [2019-12-27 17:02:55,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:55,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319612876] [2019-12-27 17:02:55,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:55,540 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:02:55,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319612876] [2019-12-27 17:02:55,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:55,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:02:55,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1720485173] [2019-12-27 17:02:55,542 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:55,558 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:55,618 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 93 states and 129 transitions. [2019-12-27 17:02:55,618 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:55,619 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:02:55,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:02:55,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:55,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:02:55,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:02:55,621 INFO L87 Difference]: Start difference. First operand 799 states and 1831 transitions. Second operand 3 states. [2019-12-27 17:02:55,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:55,663 INFO L93 Difference]: Finished difference Result 799 states and 1830 transitions. [2019-12-27 17:02:55,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:02:55,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 17:02:55,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:55,665 INFO L225 Difference]: With dead ends: 799 [2019-12-27 17:02:55,665 INFO L226 Difference]: Without dead ends: 799 [2019-12-27 17:02:55,665 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:02:55,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-12-27 17:02:55,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 642. [2019-12-27 17:02:55,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-12-27 17:02:55,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1470 transitions. [2019-12-27 17:02:55,675 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1470 transitions. Word has length 55 [2019-12-27 17:02:55,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:55,675 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 1470 transitions. [2019-12-27 17:02:55,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:02:55,676 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1470 transitions. [2019-12-27 17:02:55,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 17:02:55,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:55,677 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:02:55,677 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:55,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:55,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1993080434, now seen corresponding path program 1 times [2019-12-27 17:02:55,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:55,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605469075] [2019-12-27 17:02:55,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:55,751 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:02:55,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605469075] [2019-12-27 17:02:55,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:55,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:02:55,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1749143643] [2019-12-27 17:02:55,752 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:55,768 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:55,890 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 129 transitions. [2019-12-27 17:02:55,890 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:55,914 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:02:55,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:02:55,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:55,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:02:55,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:02:55,915 INFO L87 Difference]: Start difference. First operand 642 states and 1470 transitions. Second operand 5 states. [2019-12-27 17:02:56,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:56,066 INFO L93 Difference]: Finished difference Result 822 states and 1829 transitions. [2019-12-27 17:02:56,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:02:56,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-27 17:02:56,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:56,068 INFO L225 Difference]: With dead ends: 822 [2019-12-27 17:02:56,068 INFO L226 Difference]: Without dead ends: 822 [2019-12-27 17:02:56,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:02:56,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2019-12-27 17:02:56,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 606. [2019-12-27 17:02:56,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-12-27 17:02:56,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1354 transitions. [2019-12-27 17:02:56,077 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1354 transitions. Word has length 56 [2019-12-27 17:02:56,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:56,077 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 1354 transitions. [2019-12-27 17:02:56,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:02:56,078 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1354 transitions. [2019-12-27 17:02:56,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 17:02:56,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:56,079 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] [2019-12-27 17:02:56,079 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:56,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:56,080 INFO L82 PathProgramCache]: Analyzing trace with hash 2052620165, now seen corresponding path program 1 times [2019-12-27 17:02:56,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:56,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867460447] [2019-12-27 17:02:56,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:56,320 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:02:56,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867460447] [2019-12-27 17:02:56,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:56,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 17:02:56,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [266462083] [2019-12-27 17:02:56,321 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:56,338 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:56,394 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 132 transitions. [2019-12-27 17:02:56,394 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:56,432 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:02:56,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 17:02:56,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:56,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 17:02:56,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:02:56,433 INFO L87 Difference]: Start difference. First operand 606 states and 1354 transitions. Second operand 13 states. [2019-12-27 17:02:57,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:57,100 INFO L93 Difference]: Finished difference Result 1230 states and 2440 transitions. [2019-12-27 17:02:57,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 17:02:57,101 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 17:02:57,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:57,102 INFO L225 Difference]: With dead ends: 1230 [2019-12-27 17:02:57,102 INFO L226 Difference]: Without dead ends: 610 [2019-12-27 17:02:57,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2019-12-27 17:02:57,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-12-27 17:02:57,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 544. [2019-12-27 17:02:57,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-12-27 17:02:57,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1175 transitions. [2019-12-27 17:02:57,113 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1175 transitions. Word has length 57 [2019-12-27 17:02:57,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:57,113 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 1175 transitions. [2019-12-27 17:02:57,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 17:02:57,113 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1175 transitions. [2019-12-27 17:02:57,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 17:02:57,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:57,115 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] [2019-12-27 17:02:57,115 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:57,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:57,115 INFO L82 PathProgramCache]: Analyzing trace with hash -892812541, now seen corresponding path program 2 times [2019-12-27 17:02:57,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:57,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732863675] [2019-12-27 17:02:57,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:57,397 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:02:57,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732863675] [2019-12-27 17:02:57,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:57,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 17:02:57,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [340485376] [2019-12-27 17:02:57,398 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:57,413 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:57,453 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 130 transitions. [2019-12-27 17:02:57,453 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:57,540 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 17:02:57,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 17:02:57,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:57,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 17:02:57,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:02:57,541 INFO L87 Difference]: Start difference. First operand 544 states and 1175 transitions. Second operand 14 states. [2019-12-27 17:02:58,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:58,085 INFO L93 Difference]: Finished difference Result 852 states and 1845 transitions. [2019-12-27 17:02:58,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 17:02:58,085 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-12-27 17:02:58,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:58,086 INFO L225 Difference]: With dead ends: 852 [2019-12-27 17:02:58,087 INFO L226 Difference]: Without dead ends: 822 [2019-12-27 17:02:58,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2019-12-27 17:02:58,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2019-12-27 17:02:58,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 748. [2019-12-27 17:02:58,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-12-27 17:02:58,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1628 transitions. [2019-12-27 17:02:58,098 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1628 transitions. Word has length 57 [2019-12-27 17:02:58,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:58,098 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 1628 transitions. [2019-12-27 17:02:58,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 17:02:58,099 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1628 transitions. [2019-12-27 17:02:58,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 17:02:58,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:58,100 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] [2019-12-27 17:02:58,101 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:58,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:58,101 INFO L82 PathProgramCache]: Analyzing trace with hash 729108355, now seen corresponding path program 3 times [2019-12-27 17:02:58,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:58,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229628059] [2019-12-27 17:02:58,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:02:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:02:58,244 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:02:58,245 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:02:58,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] ULTIMATE.startENTRY-->L812: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= v_~y$w_buff0_used~0_565 0) (= v_~y$w_buff1_used~0_304 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1114~0.base_27|) (= v_~main$tmp_guard0~0_30 0) (= v_~y$r_buff0_thd0~0_292 0) (= 0 v_~weak$$choice2~0_82) (= 0 v_~y$read_delayed_var~0.offset_8) (= (select .cse0 |v_ULTIMATE.start_main_~#t1114~0.base_27|) 0) (= 0 v_~__unbuffered_cnt~0_94) (= 0 v_~y$r_buff1_thd3~0_89) (= v_~y$read_delayed~0_8 0) (= 0 v_~y$r_buff1_thd2~0_113) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1114~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1114~0.base_27|) |v_ULTIMATE.start_main_~#t1114~0.offset_21| 0)) |v_#memory_int_15|) (= v_~main$tmp_guard1~0_30 0) (= v_~x~0_51 0) (= v_~y$w_buff1~0_136 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1114~0.base_27| 4)) (= 0 v_~y$r_buff0_thd2~0_108) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$r_buff0_thd1~0_41 0) (= 0 |v_ULTIMATE.start_main_~#t1114~0.offset_21|) (= v_~a~0_57 0) (= v_~y$mem_tmp~0_17 0) (= v_~z~0_41 0) (= 0 v_~y$r_buff1_thd1~0_40) (= v_~__unbuffered_p2_EBX~0_54 0) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t1114~0.base_27| 1)) (= v_~y~0_123 0) (= v_~y$r_buff1_thd0~0_196 0) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff0_thd3~0_130) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_p2_EAX~0_54) (= 0 v_~__unbuffered_p0_EAX~0_39) (= 0 v_~weak$$choice0~0_13) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_34) (= 0 v_~y$w_buff0~0_162))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1114~0.offset=|v_ULTIMATE.start_main_~#t1114~0.offset_21|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_35|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_29|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_51|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_50|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_57, ~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_89, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$flush_delayed~0=v_~y$flush_delayed~0_34, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ULTIMATE.start_main_~#t1115~0.base=|v_ULTIMATE.start_main_~#t1115~0.base_26|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_54, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_116|, ULTIMATE.start_main_~#t1116~0.offset=|v_ULTIMATE.start_main_~#t1116~0.offset_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_33|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_25|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~y$w_buff1~0=v_~y$w_buff1~0_136, ULTIMATE.start_main_~#t1116~0.base=|v_ULTIMATE.start_main_~#t1116~0.base_21|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ULTIMATE.start_main_~#t1115~0.offset=|v_ULTIMATE.start_main_~#t1115~0.offset_20|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_196, ~x~0=v_~x~0_51, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_565, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_34|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_49|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_31|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_27|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_27|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_28|, ~y$w_buff0~0=v_~y$w_buff0~0_162, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_130, ~y~0=v_~y~0_123, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_32|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_17|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_196|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_28|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_110|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_26|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_292, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1114~0.base=|v_ULTIMATE.start_main_~#t1114~0.base_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_41, ~weak$$choice2~0=v_~weak$$choice2~0_82, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_304} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1114~0.offset, ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1115~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t1116~0.offset, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ULTIMATE.start_main_~#t1116~0.base, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1115~0.offset, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t1114~0.base, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 17:02:58,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L812-1-->L814: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1115~0.base_9| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1115~0.base_9|) (= |v_ULTIMATE.start_main_~#t1115~0.offset_8| 0) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1115~0.base_9|) 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1115~0.base_9| 1)) (not (= |v_ULTIMATE.start_main_~#t1115~0.base_9| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1115~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1115~0.base_9|) |v_ULTIMATE.start_main_~#t1115~0.offset_8| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start_main_~#t1115~0.offset=|v_ULTIMATE.start_main_~#t1115~0.offset_8|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1115~0.base=|v_ULTIMATE.start_main_~#t1115~0.base_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1115~0.offset, #length, ULTIMATE.start_main_~#t1115~0.base] because there is no mapped edge [2019-12-27 17:02:58,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L816: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1116~0.base_10|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t1116~0.base_10|)) (= |v_ULTIMATE.start_main_~#t1116~0.offset_10| 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t1116~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1116~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1116~0.base_10|) |v_ULTIMATE.start_main_~#t1116~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1116~0.base_10| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1116~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1116~0.base=|v_ULTIMATE.start_main_~#t1116~0.base_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1116~0.offset=|v_ULTIMATE.start_main_~#t1116~0.offset_10|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1116~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1116~0.offset, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-27 17:02:58,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L4-->L789: Formula: (and (= 1 ~z~0_Out-1641752390) (= ~__unbuffered_p2_EAX~0_Out-1641752390 ~z~0_Out-1641752390) (not (= 0 P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-1641752390)) (= ~y$r_buff1_thd0~0_Out-1641752390 ~y$r_buff0_thd0~0_In-1641752390) (= ~y$r_buff0_thd3~0_In-1641752390 ~y$r_buff1_thd3~0_Out-1641752390) (= ~y$r_buff1_thd1~0_Out-1641752390 ~y$r_buff0_thd1~0_In-1641752390) (= 1 ~y$r_buff0_thd3~0_Out-1641752390) (= ~__unbuffered_p2_EBX~0_Out-1641752390 ~a~0_In-1641752390) (= ~y$r_buff1_thd2~0_Out-1641752390 ~y$r_buff0_thd2~0_In-1641752390)) InVars {~a~0=~a~0_In-1641752390, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1641752390, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1641752390, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1641752390, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1641752390, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-1641752390} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out-1641752390, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-1641752390, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1641752390, ~a~0=~a~0_In-1641752390, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1641752390, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out-1641752390, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1641752390, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1641752390, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1641752390, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1641752390, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out-1641752390, ~z~0=~z~0_Out-1641752390, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1641752390} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 17:02:58,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= v_P0Thread1of1ForFork2_~arg.base_10 |v_P0Thread1of1ForFork2_#in~arg.base_10|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_10| v_P0Thread1of1ForFork2_~arg.offset_10) (= v_~a~0_22 1) (= v_~x~0_29 v_~__unbuffered_p0_EAX~0_17) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, ~x~0=v_~x~0_29} OutVars{~a~0=v_~a~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_10, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_29, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_10} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 17:02:58,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L754-2-->L754-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork0_#t~ite3_Out-826034380| |P1Thread1of1ForFork0_#t~ite4_Out-826034380|)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-826034380 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-826034380 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= ~y$w_buff1~0_In-826034380 |P1Thread1of1ForFork0_#t~ite3_Out-826034380|)) (and (= |P1Thread1of1ForFork0_#t~ite3_Out-826034380| ~y~0_In-826034380) .cse0 (or .cse1 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-826034380, ~y$w_buff1~0=~y$w_buff1~0_In-826034380, ~y~0=~y~0_In-826034380, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-826034380} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-826034380, ~y$w_buff1~0=~y$w_buff1~0_In-826034380, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out-826034380|, ~y~0=~y~0_In-826034380, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out-826034380|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-826034380} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 17:02:58,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1078474468 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1078474468 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite11_Out-1078474468| 0)) (and (= |P2Thread1of1ForFork1_#t~ite11_Out-1078474468| ~y$w_buff0_used~0_In-1078474468) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1078474468, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1078474468} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1078474468, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-1078474468|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1078474468} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 17:02:58,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L791-->L791-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In303318246 256))) (.cse3 (= (mod ~y$r_buff0_thd3~0_In303318246 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In303318246 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In303318246 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite12_Out303318246| 0)) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite12_Out303318246| ~y$w_buff1_used~0_In303318246) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In303318246, ~y$w_buff0_used~0=~y$w_buff0_used~0_In303318246, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In303318246, ~y$w_buff1_used~0=~y$w_buff1_used~0_In303318246} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In303318246, ~y$w_buff0_used~0=~y$w_buff0_used~0_In303318246, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In303318246, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out303318246|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In303318246} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 17:02:58,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L792-->L793: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1241388700 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1241388700 256) 0))) (or (and (= ~y$r_buff0_thd3~0_Out1241388700 ~y$r_buff0_thd3~0_In1241388700) (or .cse0 .cse1)) (and (= ~y$r_buff0_thd3~0_Out1241388700 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1241388700, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1241388700} OutVars{P2Thread1of1ForFork1_#t~ite13=|P2Thread1of1ForFork1_#t~ite13_Out1241388700|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1241388700, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1241388700} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite13, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 17:02:58,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L793-->L793-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In-580837282 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-580837282 256))) (.cse3 (= (mod ~y$r_buff0_thd3~0_In-580837282 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-580837282 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite14_Out-580837282| ~y$r_buff1_thd3~0_In-580837282) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite14_Out-580837282| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-580837282, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-580837282, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-580837282, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-580837282} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out-580837282|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-580837282, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-580837282, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-580837282, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-580837282} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 17:02:58,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L793-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#t~ite14_36| v_~y$r_buff1_thd3~0_55) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_35|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 17:02:58,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L755-->L755-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1556112455 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1556112455 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite5_Out1556112455| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite5_Out1556112455| ~y$w_buff0_used~0_In1556112455) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1556112455, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1556112455} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1556112455, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1556112455, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out1556112455|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 17:02:58,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L756-->L756-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In29658773 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In29658773 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In29658773 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In29658773 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite6_Out29658773| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite6_Out29658773| ~y$w_buff1_used~0_In29658773) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In29658773, ~y$w_buff0_used~0=~y$w_buff0_used~0_In29658773, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In29658773, ~y$w_buff1_used~0=~y$w_buff1_used~0_In29658773} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In29658773, ~y$w_buff0_used~0=~y$w_buff0_used~0_In29658773, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In29658773, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out29658773|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In29658773} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 17:02:58,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L757-->L757-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1014206952 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1014206952 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite7_Out1014206952|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In1014206952 |P1Thread1of1ForFork0_#t~ite7_Out1014206952|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1014206952, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1014206952} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1014206952, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1014206952, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out1014206952|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 17:02:58,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L758-->L758-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1396274306 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-1396274306 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1396274306 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1396274306 256)))) (or (and (= ~y$r_buff1_thd2~0_In-1396274306 |P1Thread1of1ForFork0_#t~ite8_Out-1396274306|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork0_#t~ite8_Out-1396274306|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1396274306, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1396274306, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1396274306, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1396274306} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1396274306, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1396274306, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1396274306, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out-1396274306|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1396274306} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 17:02:58,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L758-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_75 (+ v_~__unbuffered_cnt~0_76 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~y$r_buff1_thd2~0_82 |v_P1Thread1of1ForFork0_#t~ite8_38|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_38|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_82, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_37|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 17:02:58,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L820-->L822-2: Formula: (and (or (= 0 (mod v_~y$w_buff0_used~0_253 256)) (= (mod v_~y$r_buff0_thd0~0_142 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 17:02:58,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L822-2-->L822-5: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In2145728471 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite18_Out2145728471| |ULTIMATE.start_main_#t~ite19_Out2145728471|)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In2145728471 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite18_Out2145728471| ~y~0_In2145728471) (or .cse1 .cse2)) (and (not .cse2) (= ~y$w_buff1~0_In2145728471 |ULTIMATE.start_main_#t~ite18_Out2145728471|) .cse0 (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2145728471, ~y~0=~y~0_In2145728471, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2145728471, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2145728471} OutVars{~y$w_buff1~0=~y$w_buff1~0_In2145728471, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out2145728471|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out2145728471|, ~y~0=~y~0_In2145728471, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2145728471, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2145728471} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 17:02:58,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In353125618 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In353125618 256)))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out353125618| ~y$w_buff0_used~0_In353125618) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite20_Out353125618| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In353125618, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In353125618} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In353125618, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In353125618, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out353125618|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 17:02:58,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-1914851469 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1914851469 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-1914851469 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1914851469 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite21_Out-1914851469| ~y$w_buff1_used~0_In-1914851469)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite21_Out-1914851469| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1914851469, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1914851469, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1914851469, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1914851469} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1914851469, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1914851469, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1914851469|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1914851469, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1914851469} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 17:02:58,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L825-->L825-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1009786003 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1009786003 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out1009786003| ~y$r_buff0_thd0~0_In1009786003)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite22_Out1009786003|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1009786003, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1009786003} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1009786003, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1009786003, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1009786003|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 17:02:58,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L826-->L826-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1189501823 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1189501823 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1189501823 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1189501823 256)))) (or (and (= |ULTIMATE.start_main_#t~ite23_Out-1189501823| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite23_Out-1189501823| ~y$r_buff1_thd0~0_In-1189501823)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1189501823, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1189501823, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1189501823, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1189501823} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1189501823, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1189501823, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1189501823, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1189501823|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1189501823} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 17:02:58,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L834-->L834-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2055285420 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite30_Out-2055285420| |ULTIMATE.start_main_#t~ite29_Out-2055285420|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-2055285420 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-2055285420 256)) .cse1) (and (= 0 (mod ~y$r_buff1_thd0~0_In-2055285420 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-2055285420 256)))) (= ~y$w_buff0~0_In-2055285420 |ULTIMATE.start_main_#t~ite29_Out-2055285420|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite30_Out-2055285420| ~y$w_buff0~0_In-2055285420) (= |ULTIMATE.start_main_#t~ite29_In-2055285420| |ULTIMATE.start_main_#t~ite29_Out-2055285420|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2055285420, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-2055285420|, ~y$w_buff0~0=~y$w_buff0~0_In-2055285420, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2055285420, ~weak$$choice2~0=~weak$$choice2~0_In-2055285420, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2055285420, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2055285420} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-2055285420|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2055285420, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-2055285420|, ~y$w_buff0~0=~y$w_buff0~0_In-2055285420, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2055285420, ~weak$$choice2~0=~weak$$choice2~0_In-2055285420, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2055285420, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2055285420} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 17:02:58,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L836-->L836-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1210259548 256)))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1210259548 256) 0))) (or (and .cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1210259548 256))) (= (mod ~y$w_buff0_used~0_In-1210259548 256) 0) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-1210259548 256))))) (= |ULTIMATE.start_main_#t~ite36_Out-1210259548| |ULTIMATE.start_main_#t~ite35_Out-1210259548|) .cse1 (= ~y$w_buff0_used~0_In-1210259548 |ULTIMATE.start_main_#t~ite35_Out-1210259548|)) (and (= ~y$w_buff0_used~0_In-1210259548 |ULTIMATE.start_main_#t~ite36_Out-1210259548|) (not .cse1) (= |ULTIMATE.start_main_#t~ite35_In-1210259548| |ULTIMATE.start_main_#t~ite35_Out-1210259548|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1210259548, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1210259548, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-1210259548|, ~weak$$choice2~0=~weak$$choice2~0_In-1210259548, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1210259548, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1210259548} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1210259548, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1210259548, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1210259548|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1210259548|, ~weak$$choice2~0=~weak$$choice2~0_In-1210259548, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1210259548, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1210259548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 17:02:58,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L837-->L837-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1172733633 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out1172733633| |ULTIMATE.start_main_#t~ite38_Out1172733633|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1172733633 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In1172733633 256)) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In1172733633 256) 0)) (and .cse1 (= (mod ~y$w_buff1_used~0_In1172733633 256) 0)))) (= ~y$w_buff1_used~0_In1172733633 |ULTIMATE.start_main_#t~ite38_Out1172733633|)) (and (= |ULTIMATE.start_main_#t~ite38_In1172733633| |ULTIMATE.start_main_#t~ite38_Out1172733633|) (not .cse0) (= |ULTIMATE.start_main_#t~ite39_Out1172733633| ~y$w_buff1_used~0_In1172733633)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1172733633, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1172733633, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In1172733633|, ~weak$$choice2~0=~weak$$choice2~0_In1172733633, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1172733633, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1172733633} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1172733633, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1172733633|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1172733633, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1172733633|, ~weak$$choice2~0=~weak$$choice2~0_In1172733633, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1172733633, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1172733633} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 17:02:58,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L838-->L839: Formula: (and (not (= (mod v_~weak$$choice2~0_22 256) 0)) (= v_~y$r_buff0_thd0~0_108 v_~y$r_buff0_thd0~0_107)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_107, ~weak$$choice2~0=v_~weak$$choice2~0_22, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 17:02:58,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L839-->L839-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1884851305 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out1884851305| |ULTIMATE.start_main_#t~ite45_Out1884851305|) .cse0 (= |ULTIMATE.start_main_#t~ite44_Out1884851305| ~y$r_buff1_thd0~0_In1884851305) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1884851305 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1884851305 256))) (and (= (mod ~y$w_buff1_used~0_In1884851305 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1884851305 256))))) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_In1884851305| |ULTIMATE.start_main_#t~ite44_Out1884851305|) (= |ULTIMATE.start_main_#t~ite45_Out1884851305| ~y$r_buff1_thd0~0_In1884851305)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1884851305, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1884851305, ~weak$$choice2~0=~weak$$choice2~0_In1884851305, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1884851305, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1884851305, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In1884851305|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1884851305, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1884851305, ~weak$$choice2~0=~weak$$choice2~0_In1884851305, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1884851305, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1884851305|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1884851305|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1884851305} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 17:02:58,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L841-->L4: Formula: (and (= 0 v_~y$flush_delayed~0_27) (= v_~y~0_103 v_~y$mem_tmp~0_13) (not (= 0 (mod v_~y$flush_delayed~0_28 256))) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_13, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~y~0=v_~y~0_103, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:02:58,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 17:02:58,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:02:58 BasicIcfg [2019-12-27 17:02:58,360 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:02:58,362 INFO L168 Benchmark]: Toolchain (without parser) took 22219.26 ms. Allocated memory was 145.8 MB in the beginning and 1.1 GB in the end (delta: 906.5 MB). Free memory was 101.4 MB in the beginning and 753.8 MB in the end (delta: -652.4 MB). Peak memory consumption was 254.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:02:58,362 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 17:02:58,363 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.39 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.9 MB in the beginning and 156.9 MB in the end (delta: -56.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:02:58,364 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.00 ms. Allocated memory is still 203.4 MB. Free memory was 156.9 MB in the beginning and 154.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:02:58,364 INFO L168 Benchmark]: Boogie Preprocessor took 38.07 ms. Allocated memory is still 203.4 MB. Free memory was 154.3 MB in the beginning and 151.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:02:58,365 INFO L168 Benchmark]: RCFGBuilder took 784.94 ms. Allocated memory is still 203.4 MB. Free memory was 151.7 MB in the beginning and 104.5 MB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. [2019-12-27 17:02:58,366 INFO L168 Benchmark]: TraceAbstraction took 20513.48 ms. Allocated memory was 203.4 MB in the beginning and 1.1 GB in the end (delta: 848.8 MB). Free memory was 104.5 MB in the beginning and 753.8 MB in the end (delta: -649.3 MB). Peak memory consumption was 199.5 MB. Max. memory is 7.1 GB. [2019-12-27 17:02:58,369 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.13 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 797.39 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.9 MB in the beginning and 156.9 MB in the end (delta: -56.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 80.00 ms. Allocated memory is still 203.4 MB. Free memory was 156.9 MB in the beginning and 154.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.07 ms. Allocated memory is still 203.4 MB. Free memory was 154.3 MB in the beginning and 151.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 784.94 ms. Allocated memory is still 203.4 MB. Free memory was 151.7 MB in the beginning and 104.5 MB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20513.48 ms. Allocated memory was 203.4 MB in the beginning and 1.1 GB in the end (delta: 848.8 MB). Free memory was 104.5 MB in the beginning and 753.8 MB in the end (delta: -649.3 MB). Peak memory consumption was 199.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 165 ProgramPointsBefore, 79 ProgramPointsAfterwards, 196 TransitionsBefore, 86 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 28 ChoiceCompositions, 4263 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 192 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 50142 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L812] FCALL, FORK 0 pthread_create(&t1114, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1115, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t1116, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L768] 3 y$w_buff1 = y$w_buff0 [L769] 3 y$w_buff0 = 2 [L770] 3 y$w_buff1_used = y$w_buff0_used [L771] 3 y$w_buff0_used = (_Bool)1 [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 2 x = 1 [L751] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 20.2s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1705 SDtfs, 2296 SDslu, 4103 SDs, 0 SdLazy, 2288 SolverSat, 163 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 28 SyntacticMatches, 21 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22366occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 14211 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 562 NumberOfCodeBlocks, 562 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 491 ConstructedInterpolants, 0 QuantifiedInterpolants, 85693 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...