/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:56:45,814 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:56:45,817 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:56:45,835 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:56:45,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:56:45,838 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:56:45,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:56:45,850 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:56:45,853 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:56:45,856 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:56:45,858 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:56:45,859 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:56:45,860 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:56:45,862 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:56:45,864 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:56:45,865 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:56:45,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:56:45,868 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:56:45,869 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:56:45,874 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:56:45,878 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:56:45,882 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:56:45,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:56:45,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:56:45,886 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:56:45,886 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:56:45,887 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:56:45,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:56:45,890 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:56:45,890 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:56:45,891 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:56:45,892 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:56:45,893 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:56:45,894 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:56:45,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:56:45,895 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:56:45,896 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:56:45,896 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:56:45,896 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:56:45,897 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:56:45,898 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:56:45,899 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-VariableLbe.epf [2019-12-27 06:56:45,923 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:56:45,923 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:56:45,924 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:56:45,925 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:56:45,925 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:56:45,925 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:56:45,925 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:56:45,925 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:56:45,926 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:56:45,926 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:56:45,926 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:56:45,926 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:56:45,926 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:56:45,927 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:56:45,927 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:56:45,927 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:56:45,927 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:56:45,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:56:45,928 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:56:45,928 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:56:45,928 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:56:45,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:56:45,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:56:45,929 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:56:45,929 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:56:45,929 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:56:45,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:56:45,929 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:56:45,930 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:56:45,930 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:56:46,228 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:56:46,248 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:56:46,251 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:56:46,253 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:56:46,253 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:56:46,254 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.opt.i [2019-12-27 06:56:46,313 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a32f53f35/5515f1ac34b54a4db303ea90fe81560f/FLAG65268319d [2019-12-27 06:56:46,853 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:56:46,854 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_tso.opt.i [2019-12-27 06:56:46,874 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a32f53f35/5515f1ac34b54a4db303ea90fe81560f/FLAG65268319d [2019-12-27 06:56:47,181 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a32f53f35/5515f1ac34b54a4db303ea90fe81560f [2019-12-27 06:56:47,191 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:56:47,192 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:56:47,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:56:47,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:56:47,197 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:56:47,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:56:47" (1/1) ... [2019-12-27 06:56:47,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c762407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:56:47, skipping insertion in model container [2019-12-27 06:56:47,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:56:47" (1/1) ... [2019-12-27 06:56:47,208 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:56:47,264 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:56:47,871 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:56:47,891 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:56:47,975 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:56:48,061 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:56:48,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:56:48 WrapperNode [2019-12-27 06:56:48,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:56:48,062 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:56:48,063 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:56:48,063 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:56:48,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:56:48" (1/1) ... [2019-12-27 06:56:48,091 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:56:48" (1/1) ... [2019-12-27 06:56:48,130 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:56:48,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:56:48,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:56:48,131 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:56:48,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:56:48" (1/1) ... [2019-12-27 06:56:48,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:56:48" (1/1) ... [2019-12-27 06:56:48,151 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:56:48" (1/1) ... [2019-12-27 06:56:48,151 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:56:48" (1/1) ... [2019-12-27 06:56:48,164 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:56:48" (1/1) ... [2019-12-27 06:56:48,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:56:48" (1/1) ... [2019-12-27 06:56:48,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:56:48" (1/1) ... [2019-12-27 06:56:48,178 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:56:48,179 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:56:48,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:56:48,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:56:48,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:56:48" (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 06:56:48,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:56:48,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:56:48,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:56:48,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:56:48,247 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:56:48,247 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:56:48,247 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:56:48,247 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:56:48,247 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:56:48,248 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:56:48,248 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 06:56:48,248 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 06:56:48,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:56:48,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:56:48,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:56:48,250 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 06:56:49,022 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:56:49,022 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:56:49,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:56:49 BoogieIcfgContainer [2019-12-27 06:56:49,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:56:49,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:56:49,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:56:49,028 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:56:49,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:56:47" (1/3) ... [2019-12-27 06:56:49,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f1fbc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:56:49, skipping insertion in model container [2019-12-27 06:56:49,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:56:48" (2/3) ... [2019-12-27 06:56:49,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f1fbc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:56:49, skipping insertion in model container [2019-12-27 06:56:49,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:56:49" (3/3) ... [2019-12-27 06:56:49,032 INFO L109 eAbstractionObserver]: Analyzing ICFG mix055_tso.opt.i [2019-12-27 06:56:49,043 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:56:49,043 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:56:49,051 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:56:49,051 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:56:49,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,089 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,089 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,090 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,090 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,091 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,092 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,099 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,100 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,100 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,100 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,100 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,100 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,101 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,101 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,103 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,103 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,103 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,105 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,105 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,105 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,105 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,106 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,106 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,106 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,106 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,107 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,107 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,107 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,107 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,108 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,112 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,113 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,115 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,116 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,140 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,141 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,144 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,144 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,144 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,145 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,145 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,145 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,145 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,145 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,147 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,148 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,148 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,148 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:56:49,167 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 06:56:49,188 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:56:49,188 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:56:49,188 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:56:49,188 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:56:49,189 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:56:49,189 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:56:49,189 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:56:49,189 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:56:49,206 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 207 transitions [2019-12-27 06:56:49,208 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions [2019-12-27 06:56:49,312 INFO L132 PetriNetUnfolder]: 41/203 cut-off events. [2019-12-27 06:56:49,312 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:56:49,331 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 41/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 06:56:49,350 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions [2019-12-27 06:56:49,443 INFO L132 PetriNetUnfolder]: 41/203 cut-off events. [2019-12-27 06:56:49,443 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:56:49,451 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 41/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 06:56:49,467 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 06:56:49,469 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:56:53,109 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 06:56:53,240 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 06:56:53,260 INFO L206 etLargeBlockEncoding]: Checked pairs total: 51526 [2019-12-27 06:56:53,260 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-27 06:56:53,264 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 96 transitions [2019-12-27 06:56:55,437 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34622 states. [2019-12-27 06:56:55,439 INFO L276 IsEmpty]: Start isEmpty. Operand 34622 states. [2019-12-27 06:56:55,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 06:56:55,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:56:55,447 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:56:55,448 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:56:55,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:56:55,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1005539762, now seen corresponding path program 1 times [2019-12-27 06:56:55,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:56:55,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303209273] [2019-12-27 06:56:55,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:56:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:56:55,712 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 06:56:55,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303209273] [2019-12-27 06:56:55,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:56:55,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:56:55,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616950050] [2019-12-27 06:56:55,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:56:55,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:56:55,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:56:55,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:56:55,742 INFO L87 Difference]: Start difference. First operand 34622 states. Second operand 3 states. [2019-12-27 06:56:57,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:56:57,234 INFO L93 Difference]: Finished difference Result 34366 states and 145048 transitions. [2019-12-27 06:56:57,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:56:57,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 06:56:57,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:56:57,594 INFO L225 Difference]: With dead ends: 34366 [2019-12-27 06:56:57,594 INFO L226 Difference]: Without dead ends: 33694 [2019-12-27 06:56:57,599 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 06:56:57,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33694 states. [2019-12-27 06:56:59,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33694 to 33694. [2019-12-27 06:56:59,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33694 states. [2019-12-27 06:56:59,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33694 states to 33694 states and 142304 transitions. [2019-12-27 06:56:59,582 INFO L78 Accepts]: Start accepts. Automaton has 33694 states and 142304 transitions. Word has length 9 [2019-12-27 06:56:59,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:56:59,583 INFO L462 AbstractCegarLoop]: Abstraction has 33694 states and 142304 transitions. [2019-12-27 06:56:59,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:56:59,584 INFO L276 IsEmpty]: Start isEmpty. Operand 33694 states and 142304 transitions. [2019-12-27 06:56:59,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 06:56:59,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:56:59,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:56:59,591 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:56:59,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:56:59,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1499462081, now seen corresponding path program 1 times [2019-12-27 06:56:59,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:56:59,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351466957] [2019-12-27 06:56:59,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:56:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:56:59,777 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 06:56:59,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351466957] [2019-12-27 06:56:59,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:56:59,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:56:59,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315419756] [2019-12-27 06:56:59,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:56:59,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:56:59,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:56:59,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:56:59,783 INFO L87 Difference]: Start difference. First operand 33694 states and 142304 transitions. Second operand 4 states. [2019-12-27 06:57:02,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:57:02,309 INFO L93 Difference]: Finished difference Result 52350 states and 214000 transitions. [2019-12-27 06:57:02,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:57:02,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 06:57:02,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:57:02,601 INFO L225 Difference]: With dead ends: 52350 [2019-12-27 06:57:02,601 INFO L226 Difference]: Without dead ends: 52322 [2019-12-27 06:57:02,602 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 06:57:03,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52322 states. [2019-12-27 06:57:04,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52322 to 46842. [2019-12-27 06:57:04,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46842 states. [2019-12-27 06:57:04,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46842 states to 46842 states and 193636 transitions. [2019-12-27 06:57:04,726 INFO L78 Accepts]: Start accepts. Automaton has 46842 states and 193636 transitions. Word has length 15 [2019-12-27 06:57:04,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:57:04,726 INFO L462 AbstractCegarLoop]: Abstraction has 46842 states and 193636 transitions. [2019-12-27 06:57:04,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:57:04,727 INFO L276 IsEmpty]: Start isEmpty. Operand 46842 states and 193636 transitions. [2019-12-27 06:57:04,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 06:57:04,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:04,729 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:57:04,729 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:04,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:04,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1997976486, now seen corresponding path program 1 times [2019-12-27 06:57:04,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:04,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861731614] [2019-12-27 06:57:04,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:57:04,838 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 06:57:04,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861731614] [2019-12-27 06:57:04,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:57:04,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:57:04,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619574123] [2019-12-27 06:57:04,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:57:04,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:57:04,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:57:04,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:57:04,841 INFO L87 Difference]: Start difference. First operand 46842 states and 193636 transitions. Second operand 4 states. [2019-12-27 06:57:05,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:57:05,285 INFO L93 Difference]: Finished difference Result 57862 states and 237476 transitions. [2019-12-27 06:57:05,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:57:05,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 06:57:05,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:57:07,929 INFO L225 Difference]: With dead ends: 57862 [2019-12-27 06:57:07,932 INFO L226 Difference]: Without dead ends: 57862 [2019-12-27 06:57:07,932 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 06:57:08,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57862 states. [2019-12-27 06:57:09,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57862 to 51558. [2019-12-27 06:57:09,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51558 states. [2019-12-27 06:57:09,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51558 states to 51558 states and 212860 transitions. [2019-12-27 06:57:09,779 INFO L78 Accepts]: Start accepts. Automaton has 51558 states and 212860 transitions. Word has length 15 [2019-12-27 06:57:09,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:57:09,779 INFO L462 AbstractCegarLoop]: Abstraction has 51558 states and 212860 transitions. [2019-12-27 06:57:09,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:57:09,779 INFO L276 IsEmpty]: Start isEmpty. Operand 51558 states and 212860 transitions. [2019-12-27 06:57:09,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 06:57:09,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:09,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:57:09,795 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:09,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:09,795 INFO L82 PathProgramCache]: Analyzing trace with hash 188440407, now seen corresponding path program 1 times [2019-12-27 06:57:09,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:09,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817310629] [2019-12-27 06:57:09,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:57:09,877 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 06:57:09,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817310629] [2019-12-27 06:57:09,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:57:09,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:57:09,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389203946] [2019-12-27 06:57:09,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:57:09,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:57:09,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:57:09,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:57:09,882 INFO L87 Difference]: Start difference. First operand 51558 states and 212860 transitions. Second operand 4 states. [2019-12-27 06:57:10,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:57:10,507 INFO L93 Difference]: Finished difference Result 41440 states and 157219 transitions. [2019-12-27 06:57:10,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:57:10,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-27 06:57:10,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:57:10,596 INFO L225 Difference]: With dead ends: 41440 [2019-12-27 06:57:10,596 INFO L226 Difference]: Without dead ends: 40332 [2019-12-27 06:57:10,596 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 06:57:10,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40332 states. [2019-12-27 06:57:13,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40332 to 40332. [2019-12-27 06:57:13,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40332 states. [2019-12-27 06:57:13,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40332 states to 40332 states and 153743 transitions. [2019-12-27 06:57:13,771 INFO L78 Accepts]: Start accepts. Automaton has 40332 states and 153743 transitions. Word has length 21 [2019-12-27 06:57:13,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:57:13,771 INFO L462 AbstractCegarLoop]: Abstraction has 40332 states and 153743 transitions. [2019-12-27 06:57:13,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:57:13,771 INFO L276 IsEmpty]: Start isEmpty. Operand 40332 states and 153743 transitions. [2019-12-27 06:57:13,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:57:13,784 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:13,784 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:57:13,784 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:13,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:13,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1960384026, now seen corresponding path program 1 times [2019-12-27 06:57:13,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:13,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939707430] [2019-12-27 06:57:13,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:57:13,877 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 06:57:13,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939707430] [2019-12-27 06:57:13,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:57:13,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:57:13,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657949009] [2019-12-27 06:57:13,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:57:13,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:57:13,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:57:13,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:57:13,880 INFO L87 Difference]: Start difference. First operand 40332 states and 153743 transitions. Second operand 5 states. [2019-12-27 06:57:14,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:57:14,563 INFO L93 Difference]: Finished difference Result 53868 states and 201666 transitions. [2019-12-27 06:57:14,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:57:14,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 06:57:14,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:57:14,685 INFO L225 Difference]: With dead ends: 53868 [2019-12-27 06:57:14,685 INFO L226 Difference]: Without dead ends: 53847 [2019-12-27 06:57:14,685 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 06:57:15,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53847 states. [2019-12-27 06:57:15,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53847 to 40578. [2019-12-27 06:57:15,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40578 states. [2019-12-27 06:57:15,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40578 states to 40578 states and 154375 transitions. [2019-12-27 06:57:15,925 INFO L78 Accepts]: Start accepts. Automaton has 40578 states and 154375 transitions. Word has length 22 [2019-12-27 06:57:15,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:57:15,926 INFO L462 AbstractCegarLoop]: Abstraction has 40578 states and 154375 transitions. [2019-12-27 06:57:15,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:57:15,926 INFO L276 IsEmpty]: Start isEmpty. Operand 40578 states and 154375 transitions. [2019-12-27 06:57:15,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 06:57:15,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:15,962 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:57:15,962 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:15,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:15,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1903836691, now seen corresponding path program 1 times [2019-12-27 06:57:15,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:15,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728820278] [2019-12-27 06:57:15,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:57:16,013 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 06:57:16,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728820278] [2019-12-27 06:57:16,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:57:16,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:57:16,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062173153] [2019-12-27 06:57:16,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:57:16,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:57:16,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:57:16,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:57:16,015 INFO L87 Difference]: Start difference. First operand 40578 states and 154375 transitions. Second operand 3 states. [2019-12-27 06:57:16,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:57:16,637 INFO L93 Difference]: Finished difference Result 51158 states and 192741 transitions. [2019-12-27 06:57:16,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:57:16,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-27 06:57:16,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:57:16,759 INFO L225 Difference]: With dead ends: 51158 [2019-12-27 06:57:16,759 INFO L226 Difference]: Without dead ends: 51158 [2019-12-27 06:57:16,760 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 06:57:17,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51158 states. [2019-12-27 06:57:19,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51158 to 44232. [2019-12-27 06:57:19,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44232 states. [2019-12-27 06:57:19,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44232 states to 44232 states and 167871 transitions. [2019-12-27 06:57:19,881 INFO L78 Accepts]: Start accepts. Automaton has 44232 states and 167871 transitions. Word has length 30 [2019-12-27 06:57:19,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:57:19,881 INFO L462 AbstractCegarLoop]: Abstraction has 44232 states and 167871 transitions. [2019-12-27 06:57:19,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:57:19,881 INFO L276 IsEmpty]: Start isEmpty. Operand 44232 states and 167871 transitions. [2019-12-27 06:57:19,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 06:57:19,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:19,910 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:57:19,910 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:19,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:19,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1904073376, now seen corresponding path program 1 times [2019-12-27 06:57:19,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:19,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382846164] [2019-12-27 06:57:19,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:57:19,987 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 06:57:19,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382846164] [2019-12-27 06:57:19,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:57:19,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:57:19,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541858988] [2019-12-27 06:57:19,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:57:19,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:57:19,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:57:19,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:57:19,990 INFO L87 Difference]: Start difference. First operand 44232 states and 167871 transitions. Second operand 5 states. [2019-12-27 06:57:20,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:57:20,121 INFO L93 Difference]: Finished difference Result 19345 states and 60752 transitions. [2019-12-27 06:57:20,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:57:20,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 06:57:20,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:57:20,159 INFO L225 Difference]: With dead ends: 19345 [2019-12-27 06:57:20,159 INFO L226 Difference]: Without dead ends: 18469 [2019-12-27 06:57:20,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:57:20,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18469 states. [2019-12-27 06:57:20,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18469 to 18469. [2019-12-27 06:57:20,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18469 states. [2019-12-27 06:57:20,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18469 states to 18469 states and 57954 transitions. [2019-12-27 06:57:20,445 INFO L78 Accepts]: Start accepts. Automaton has 18469 states and 57954 transitions. Word has length 30 [2019-12-27 06:57:20,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:57:20,445 INFO L462 AbstractCegarLoop]: Abstraction has 18469 states and 57954 transitions. [2019-12-27 06:57:20,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:57:20,446 INFO L276 IsEmpty]: Start isEmpty. Operand 18469 states and 57954 transitions. [2019-12-27 06:57:20,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 06:57:20,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:20,456 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:57:20,456 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:20,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:20,456 INFO L82 PathProgramCache]: Analyzing trace with hash 700126081, now seen corresponding path program 1 times [2019-12-27 06:57:20,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:20,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399410901] [2019-12-27 06:57:20,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:57:20,534 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 06:57:20,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399410901] [2019-12-27 06:57:20,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:57:20,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:57:20,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426952502] [2019-12-27 06:57:20,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:57:20,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:57:20,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:57:20,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:57:20,536 INFO L87 Difference]: Start difference. First operand 18469 states and 57954 transitions. Second operand 6 states. [2019-12-27 06:57:20,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:57:20,618 INFO L93 Difference]: Finished difference Result 3432 states and 8687 transitions. [2019-12-27 06:57:20,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:57:20,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-27 06:57:20,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:57:20,622 INFO L225 Difference]: With dead ends: 3432 [2019-12-27 06:57:20,622 INFO L226 Difference]: Without dead ends: 3063 [2019-12-27 06:57:20,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:57:20,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3063 states. [2019-12-27 06:57:20,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3063 to 3063. [2019-12-27 06:57:20,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3063 states. [2019-12-27 06:57:20,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 3063 states and 7649 transitions. [2019-12-27 06:57:20,654 INFO L78 Accepts]: Start accepts. Automaton has 3063 states and 7649 transitions. Word has length 31 [2019-12-27 06:57:20,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:57:20,654 INFO L462 AbstractCegarLoop]: Abstraction has 3063 states and 7649 transitions. [2019-12-27 06:57:20,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:57:20,654 INFO L276 IsEmpty]: Start isEmpty. Operand 3063 states and 7649 transitions. [2019-12-27 06:57:20,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 06:57:20,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:20,658 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] [2019-12-27 06:57:20,659 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:20,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:20,659 INFO L82 PathProgramCache]: Analyzing trace with hash -196360051, now seen corresponding path program 1 times [2019-12-27 06:57:20,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:20,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702202144] [2019-12-27 06:57:20,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:57:20,773 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 06:57:20,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702202144] [2019-12-27 06:57:20,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:57:20,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:57:20,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7831159] [2019-12-27 06:57:20,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:57:20,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:57:20,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:57:20,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:57:20,777 INFO L87 Difference]: Start difference. First operand 3063 states and 7649 transitions. Second operand 7 states. [2019-12-27 06:57:20,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:57:20,881 INFO L93 Difference]: Finished difference Result 1341 states and 3748 transitions. [2019-12-27 06:57:20,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:57:20,882 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-12-27 06:57:20,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:57:20,885 INFO L225 Difference]: With dead ends: 1341 [2019-12-27 06:57:20,885 INFO L226 Difference]: Without dead ends: 1292 [2019-12-27 06:57:20,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:57:20,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2019-12-27 06:57:20,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1180. [2019-12-27 06:57:20,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1180 states. [2019-12-27 06:57:20,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 3332 transitions. [2019-12-27 06:57:20,907 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 3332 transitions. Word has length 43 [2019-12-27 06:57:20,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:57:20,907 INFO L462 AbstractCegarLoop]: Abstraction has 1180 states and 3332 transitions. [2019-12-27 06:57:20,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:57:20,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 3332 transitions. [2019-12-27 06:57:20,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:57:20,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:20,910 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:57:20,911 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:20,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:20,911 INFO L82 PathProgramCache]: Analyzing trace with hash 443866773, now seen corresponding path program 1 times [2019-12-27 06:57:20,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:20,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984501266] [2019-12-27 06:57:20,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:57:21,032 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 06:57:21,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984501266] [2019-12-27 06:57:21,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:57:21,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:57:21,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614934947] [2019-12-27 06:57:21,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:57:21,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:57:21,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:57:21,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:57:21,035 INFO L87 Difference]: Start difference. First operand 1180 states and 3332 transitions. Second operand 6 states. [2019-12-27 06:57:21,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:57:21,099 INFO L93 Difference]: Finished difference Result 1673 states and 4453 transitions. [2019-12-27 06:57:21,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:57:21,099 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 06:57:21,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:57:21,102 INFO L225 Difference]: With dead ends: 1673 [2019-12-27 06:57:21,102 INFO L226 Difference]: Without dead ends: 1052 [2019-12-27 06:57:21,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:57:21,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-12-27 06:57:21,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2019-12-27 06:57:21,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-12-27 06:57:21,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 2899 transitions. [2019-12-27 06:57:21,123 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 2899 transitions. Word has length 58 [2019-12-27 06:57:21,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:57:21,123 INFO L462 AbstractCegarLoop]: Abstraction has 1052 states and 2899 transitions. [2019-12-27 06:57:21,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:57:21,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 2899 transitions. [2019-12-27 06:57:21,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:57:21,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:21,127 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:57:21,127 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:21,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:21,127 INFO L82 PathProgramCache]: Analyzing trace with hash -324610345, now seen corresponding path program 2 times [2019-12-27 06:57:21,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:21,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010140189] [2019-12-27 06:57:21,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:57:21,207 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 06:57:21,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010140189] [2019-12-27 06:57:21,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:57:21,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:57:21,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025117392] [2019-12-27 06:57:21,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:57:21,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:57:21,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:57:21,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:57:21,210 INFO L87 Difference]: Start difference. First operand 1052 states and 2899 transitions. Second operand 3 states. [2019-12-27 06:57:21,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:57:21,229 INFO L93 Difference]: Finished difference Result 1006 states and 2716 transitions. [2019-12-27 06:57:21,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:57:21,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 06:57:21,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:57:21,233 INFO L225 Difference]: With dead ends: 1006 [2019-12-27 06:57:21,233 INFO L226 Difference]: Without dead ends: 1006 [2019-12-27 06:57:21,233 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 06:57:21,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-12-27 06:57:21,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 1006. [2019-12-27 06:57:21,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2019-12-27 06:57:21,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 2716 transitions. [2019-12-27 06:57:21,253 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 2716 transitions. Word has length 58 [2019-12-27 06:57:21,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:57:21,254 INFO L462 AbstractCegarLoop]: Abstraction has 1006 states and 2716 transitions. [2019-12-27 06:57:21,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:57:21,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 2716 transitions. [2019-12-27 06:57:21,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:57:21,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:21,258 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:57:21,258 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:21,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:21,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1840838980, now seen corresponding path program 1 times [2019-12-27 06:57:21,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:21,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666743057] [2019-12-27 06:57:21,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:57:21,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:57:21,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666743057] [2019-12-27 06:57:21,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:57:21,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:57:21,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190935338] [2019-12-27 06:57:21,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:57:21,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:57:21,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:57:21,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:57:21,445 INFO L87 Difference]: Start difference. First operand 1006 states and 2716 transitions. Second operand 6 states. [2019-12-27 06:57:21,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:57:21,767 INFO L93 Difference]: Finished difference Result 1707 states and 4690 transitions. [2019-12-27 06:57:21,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:57:21,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-27 06:57:21,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:57:21,771 INFO L225 Difference]: With dead ends: 1707 [2019-12-27 06:57:21,771 INFO L226 Difference]: Without dead ends: 1707 [2019-12-27 06:57:21,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:57:21,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-12-27 06:57:21,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1515. [2019-12-27 06:57:21,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1515 states. [2019-12-27 06:57:21,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 4150 transitions. [2019-12-27 06:57:21,795 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 4150 transitions. Word has length 59 [2019-12-27 06:57:21,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:57:21,795 INFO L462 AbstractCegarLoop]: Abstraction has 1515 states and 4150 transitions. [2019-12-27 06:57:21,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:57:21,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 4150 transitions. [2019-12-27 06:57:21,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:57:21,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:21,799 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:57:21,799 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:21,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:21,799 INFO L82 PathProgramCache]: Analyzing trace with hash -746332050, now seen corresponding path program 2 times [2019-12-27 06:57:21,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:21,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116504684] [2019-12-27 06:57:21,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:57:21,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:57:21,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116504684] [2019-12-27 06:57:21,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:57:21,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:57:21,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700360175] [2019-12-27 06:57:21,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:57:21,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:57:21,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:57:21,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:57:21,878 INFO L87 Difference]: Start difference. First operand 1515 states and 4150 transitions. Second operand 3 states. [2019-12-27 06:57:22,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:57:22,067 INFO L93 Difference]: Finished difference Result 1514 states and 4148 transitions. [2019-12-27 06:57:22,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:57:22,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 06:57:22,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:57:22,070 INFO L225 Difference]: With dead ends: 1514 [2019-12-27 06:57:22,071 INFO L226 Difference]: Without dead ends: 1514 [2019-12-27 06:57:22,071 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 06:57:22,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2019-12-27 06:57:22,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1005. [2019-12-27 06:57:22,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1005 states. [2019-12-27 06:57:22,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 2714 transitions. [2019-12-27 06:57:22,089 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 2714 transitions. Word has length 59 [2019-12-27 06:57:22,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:57:22,090 INFO L462 AbstractCegarLoop]: Abstraction has 1005 states and 2714 transitions. [2019-12-27 06:57:22,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:57:22,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 2714 transitions. [2019-12-27 06:57:22,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:57:22,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:22,092 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:57:22,092 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:22,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:22,093 INFO L82 PathProgramCache]: Analyzing trace with hash 792391964, now seen corresponding path program 1 times [2019-12-27 06:57:22,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:22,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137985216] [2019-12-27 06:57:22,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:57:22,253 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 06:57:22,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137985216] [2019-12-27 06:57:22,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:57:22,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:57:22,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965436396] [2019-12-27 06:57:22,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:57:22,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:57:22,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:57:22,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:57:22,255 INFO L87 Difference]: Start difference. First operand 1005 states and 2714 transitions. Second operand 7 states. [2019-12-27 06:57:22,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:57:22,395 INFO L93 Difference]: Finished difference Result 1946 states and 4901 transitions. [2019-12-27 06:57:22,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 06:57:22,396 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-27 06:57:22,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:57:22,397 INFO L225 Difference]: With dead ends: 1946 [2019-12-27 06:57:22,397 INFO L226 Difference]: Without dead ends: 796 [2019-12-27 06:57:22,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:57:22,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2019-12-27 06:57:22,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 565. [2019-12-27 06:57:22,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-12-27 06:57:22,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 1231 transitions. [2019-12-27 06:57:22,411 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 1231 transitions. Word has length 60 [2019-12-27 06:57:22,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:57:22,411 INFO L462 AbstractCegarLoop]: Abstraction has 565 states and 1231 transitions. [2019-12-27 06:57:22,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:57:22,411 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 1231 transitions. [2019-12-27 06:57:22,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:57:22,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:22,413 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:57:22,413 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:22,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:22,414 INFO L82 PathProgramCache]: Analyzing trace with hash -631890150, now seen corresponding path program 2 times [2019-12-27 06:57:22,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:22,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006488418] [2019-12-27 06:57:22,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:57:22,530 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 06:57:22,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006488418] [2019-12-27 06:57:22,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:57:22,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:57:22,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622289949] [2019-12-27 06:57:22,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:57:22,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:57:22,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:57:22,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:57:22,533 INFO L87 Difference]: Start difference. First operand 565 states and 1231 transitions. Second operand 5 states. [2019-12-27 06:57:22,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:57:22,577 INFO L93 Difference]: Finished difference Result 754 states and 1562 transitions. [2019-12-27 06:57:22,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:57:22,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-12-27 06:57:22,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:57:22,578 INFO L225 Difference]: With dead ends: 754 [2019-12-27 06:57:22,578 INFO L226 Difference]: Without dead ends: 222 [2019-12-27 06:57:22,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:57:22,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-12-27 06:57:22,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2019-12-27 06:57:22,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-12-27 06:57:22,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 386 transitions. [2019-12-27 06:57:22,582 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 386 transitions. Word has length 60 [2019-12-27 06:57:22,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:57:22,582 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 386 transitions. [2019-12-27 06:57:22,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:57:22,583 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 386 transitions. [2019-12-27 06:57:22,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:57:22,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:22,584 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:22,584 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:22,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:22,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1041044752, now seen corresponding path program 3 times [2019-12-27 06:57:22,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:22,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771523129] [2019-12-27 06:57:22,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:57:22,895 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 06:57:22,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771523129] [2019-12-27 06:57:22,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:57:22,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 06:57:22,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546380146] [2019-12-27 06:57:22,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 06:57:22,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:57:22,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 06:57:22,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:57:22,899 INFO L87 Difference]: Start difference. First operand 222 states and 386 transitions. Second operand 14 states. [2019-12-27 06:57:23,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:57:23,424 INFO L93 Difference]: Finished difference Result 380 states and 644 transitions. [2019-12-27 06:57:23,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 06:57:23,425 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-27 06:57:23,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:57:23,426 INFO L225 Difference]: With dead ends: 380 [2019-12-27 06:57:23,426 INFO L226 Difference]: Without dead ends: 348 [2019-12-27 06:57:23,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:57:23,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-12-27 06:57:23,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 330. [2019-12-27 06:57:23,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-12-27 06:57:23,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 571 transitions. [2019-12-27 06:57:23,432 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 571 transitions. Word has length 60 [2019-12-27 06:57:23,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:57:23,433 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 571 transitions. [2019-12-27 06:57:23,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 06:57:23,434 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 571 transitions. [2019-12-27 06:57:23,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:57:23,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:23,435 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:57:23,435 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:23,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:23,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1167049754, now seen corresponding path program 4 times [2019-12-27 06:57:23,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:23,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005963175] [2019-12-27 06:57:23,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:57:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:57:23,610 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:57:23,610 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:57:23,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~z$r_buff1_thd1~0_10) (= 0 v_~__unbuffered_p3_EAX~0_10) (= v_~z$r_buff0_thd4~0_27 0) (= v_~a~0_11 0) (= |v_#NULL.offset_6| 0) (= v_~z~0_26 0) (= v_~main$tmp_guard1~0_11 0) (= 0 v_~z$r_buff1_thd3~0_18) (< 0 |v_#StackHeapBarrier_21|) (= v_~x~0_13 0) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t1485~0.base_22| 1)) (= 0 v_~z$w_buff1~0_21) (= 0 v_~z$r_buff1_thd4~0_20) (= 0 v_~z$flush_delayed~0_15) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd3~0_19 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= v_~z$w_buff0_used~0_105 0) (= 0 v_~z$r_buff1_thd0~0_48) (= 0 v_~z$r_buff1_thd2~0_10) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1485~0.base_22|) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~__unbuffered_cnt~0_27) (= v_~z$r_buff0_thd1~0_9 0) (= v_~z$mem_tmp~0_10 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1485~0.base_22|)) (= v_~z$r_buff0_thd0~0_80 0) (= v_~z$r_buff0_thd2~0_9 0) (= v_~y~0_10 0) (= 0 v_~z$w_buff0~0_25) (= 0 v_~z$w_buff1_used~0_65) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1485~0.base_22| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1485~0.base_22|) |v_ULTIMATE.start_main_~#t1485~0.offset_17| 0)) |v_#memory_int_27|) (= 0 |v_ULTIMATE.start_main_~#t1485~0.offset_17|) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t1485~0.base_22| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_13|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_11|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_16|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_14|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_15|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_17|, ~a~0=v_~a~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ULTIMATE.start_main_~#t1485~0.base=|v_ULTIMATE.start_main_~#t1485~0.base_22|, ULTIMATE.start_main_~#t1488~0.base=|v_ULTIMATE.start_main_~#t1488~0.base_20|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_27, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, #length=|v_#length_31|, ULTIMATE.start_main_~#t1486~0.offset=|v_ULTIMATE.start_main_~#t1486~0.offset_18|, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_~#t1485~0.offset=|v_ULTIMATE.start_main_~#t1485~0.offset_17|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_15|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_65, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_16|, ~z$flush_delayed~0=v_~z$flush_delayed~0_15, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_13|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_16|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~x~0=v_~x~0_13, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_20, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_14|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~z$w_buff1~0=v_~z$w_buff1~0_21, ULTIMATE.start_main_~#t1487~0.offset=|v_ULTIMATE.start_main_~#t1487~0.offset_17|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ULTIMATE.start_main_~#t1487~0.base=|v_ULTIMATE.start_main_~#t1487~0.base_20|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_15|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_16|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_48, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_9|, ~y~0=v_~y~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ULTIMATE.start_main_~#t1486~0.base=|v_ULTIMATE.start_main_~#t1486~0.base_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_13|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_18, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_17|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_14|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_~#t1488~0.offset=|v_ULTIMATE.start_main_~#t1488~0.offset_16|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|, ~z~0=v_~z~0_26, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t1485~0.base, ULTIMATE.start_main_~#t1488~0.base, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t1486~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1485~0.offset, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ULTIMATE.start_main_~#t1487~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_~#t1487~0.base, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1486~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1488~0.offset, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:57:23,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L823-1-->L825: Formula: (and (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1486~0.base_13| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1486~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1486~0.base_13|)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1486~0.base_13| 1)) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1486~0.base_13|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1486~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1486~0.base_13|) |v_ULTIMATE.start_main_~#t1486~0.offset_11| 1)) |v_#memory_int_19|) (= 0 |v_ULTIMATE.start_main_~#t1486~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1486~0.base=|v_ULTIMATE.start_main_~#t1486~0.base_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1486~0.offset=|v_ULTIMATE.start_main_~#t1486~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1486~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1486~0.offset] because there is no mapped edge [2019-12-27 06:57:23,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L825-1-->L827: Formula: (and (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1487~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1487~0.base_10|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1487~0.base_10| 4)) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1487~0.base_10| 1) |v_#valid_40|) (not (= |v_ULTIMATE.start_main_~#t1487~0.base_10| 0)) (= 0 |v_ULTIMATE.start_main_~#t1487~0.offset_10|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1487~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1487~0.base_10|) |v_ULTIMATE.start_main_~#t1487~0.offset_10| 2)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ULTIMATE.start_main_~#t1487~0.offset=|v_ULTIMATE.start_main_~#t1487~0.offset_10|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1487~0.base=|v_ULTIMATE.start_main_~#t1487~0.base_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1487~0.offset, #length, ULTIMATE.start_main_~#t1487~0.base] because there is no mapped edge [2019-12-27 06:57:23,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L827-1-->L829: Formula: (and (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1488~0.base_11|) 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1488~0.base_11| 4)) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1488~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1488~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t1488~0.offset_10|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1488~0.base_11|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1488~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1488~0.base_11|) |v_ULTIMATE.start_main_~#t1488~0.offset_10| 3)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1488~0.base=|v_ULTIMATE.start_main_~#t1488~0.base_11|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1488~0.offset=|v_ULTIMATE.start_main_~#t1488~0.offset_10|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1488~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1488~0.offset, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-27 06:57:23,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L4-->L800: Formula: (and (= ~z$r_buff0_thd4~0_In1509853122 ~z$r_buff1_thd4~0_Out1509853122) (= ~z$r_buff0_thd0~0_In1509853122 ~z$r_buff1_thd0~0_Out1509853122) (= ~z$r_buff1_thd1~0_Out1509853122 ~z$r_buff0_thd1~0_In1509853122) (not (= 0 P3Thread1of1ForFork3___VERIFIER_assert_~expression_In1509853122)) (= ~z$r_buff0_thd4~0_Out1509853122 1) (= ~a~0_In1509853122 ~__unbuffered_p3_EAX~0_Out1509853122) (= ~z$r_buff1_thd2~0_Out1509853122 ~z$r_buff0_thd2~0_In1509853122) (= ~z$r_buff1_thd3~0_Out1509853122 ~z$r_buff0_thd3~0_In1509853122)) InVars {~a~0=~a~0_In1509853122, P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In1509853122, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1509853122, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1509853122, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1509853122, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1509853122, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1509853122} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In1509853122, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out1509853122, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1509853122, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1509853122, ~a~0=~a~0_In1509853122, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1509853122, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1509853122, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1509853122, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out1509853122, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1509853122, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1509853122, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1509853122, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1509853122} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-27 06:57:23,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 1 v_~a~0_6) (= 1 v_~x~0_9) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~a~0=v_~a~0_6, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_9, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 06:57:23,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~__unbuffered_p1_EAX~0_7 v_~y~0_7) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_~x~0_10 2) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y~0=v_~y~0_7} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~y~0=v_~y~0_7, ~x~0=v_~x~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 06:57:23,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-551064740 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-551064740 256)))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out-551064740|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-551064740 |P3Thread1of1ForFork3_#t~ite11_Out-551064740|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-551064740, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-551064740} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-551064740, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-551064740, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-551064740|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 06:57:23,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L770-2-->L770-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1806382659 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-1806382659 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-1806382659 |P2Thread1of1ForFork2_#t~ite3_Out-1806382659|)) (and (= ~z~0_In-1806382659 |P2Thread1of1ForFork2_#t~ite3_Out-1806382659|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1806382659, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1806382659, ~z$w_buff1~0=~z$w_buff1~0_In-1806382659, ~z~0=~z~0_In-1806382659} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-1806382659|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1806382659, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1806382659, ~z$w_buff1~0=~z$w_buff1~0_In-1806382659, ~z~0=~z~0_In-1806382659} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 06:57:23,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L770-4-->L771: Formula: (= v_~z~0_19 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_7|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-27 06:57:23,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L802-->L802-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-2129932545 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-2129932545 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd4~0_In-2129932545 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-2129932545 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-2129932545 |P3Thread1of1ForFork3_#t~ite12_Out-2129932545|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P3Thread1of1ForFork3_#t~ite12_Out-2129932545|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2129932545, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2129932545, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2129932545, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2129932545} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2129932545, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2129932545, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2129932545, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2129932545, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-2129932545|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-27 06:57:23,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L803-->L804: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-2033296035 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-2033296035 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out-2033296035)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_In-2033296035 ~z$r_buff0_thd4~0_Out-2033296035)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2033296035, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2033296035} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2033296035, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-2033296035, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-2033296035|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-27 06:57:23,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L804-->L804-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd4~0_In1586869375 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1586869375 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1586869375 256))) (.cse3 (= (mod ~z$r_buff0_thd4~0_In1586869375 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite14_Out1586869375| 0)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite14_Out1586869375| ~z$r_buff1_thd4~0_In1586869375) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1586869375, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1586869375, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1586869375, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1586869375} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1586869375, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1586869375, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out1586869375|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1586869375, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1586869375} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-27 06:57:23,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L804-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_16) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 06:57:23,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L771-->L771-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1691956692 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1691956692 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite5_Out1691956692|)) (and (= ~z$w_buff0_used~0_In1691956692 |P2Thread1of1ForFork2_#t~ite5_Out1691956692|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1691956692, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1691956692} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out1691956692|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1691956692, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1691956692} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 06:57:23,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-2131852812 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-2131852812 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2131852812 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-2131852812 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite6_Out-2131852812| ~z$w_buff1_used~0_In-2131852812) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite6_Out-2131852812| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2131852812, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2131852812, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2131852812, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2131852812} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-2131852812|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2131852812, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2131852812, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2131852812, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2131852812} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 06:57:23,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L773-->L773-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In238409900 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In238409900 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite7_Out238409900| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite7_Out238409900| ~z$r_buff0_thd3~0_In238409900)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In238409900, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In238409900} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In238409900, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In238409900, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out238409900|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 06:57:23,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L774-->L774-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In522367386 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In522367386 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In522367386 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In522367386 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite8_Out522367386| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite8_Out522367386| ~z$r_buff1_thd3~0_In522367386)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In522367386, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In522367386, ~z$w_buff1_used~0=~z$w_buff1_used~0_In522367386, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In522367386} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In522367386, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In522367386, ~z$w_buff1_used~0=~z$w_buff1_used~0_In522367386, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In522367386, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out522367386|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 06:57:23,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L774-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_24 1) v_~__unbuffered_cnt~0_23) (= v_~z$r_buff1_thd3~0_14 |v_P2Thread1of1ForFork2_#t~ite8_8|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_14, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_7|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 06:57:23,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L833-->L835-2: Formula: (and (or (= 0 (mod v_~z$r_buff0_thd0~0_50 256)) (= 0 (mod v_~z$w_buff0_used~0_72 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_50, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_72, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_50, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_72, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 06:57:23,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L835-2-->L835-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-352412401 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-352412401 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite19_Out-352412401| ~z$w_buff1~0_In-352412401) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite19_Out-352412401| ~z~0_In-352412401)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-352412401, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-352412401, ~z$w_buff1~0=~z$w_buff1~0_In-352412401, ~z~0=~z~0_In-352412401} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-352412401|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-352412401, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-352412401, ~z$w_buff1~0=~z$w_buff1~0_In-352412401, ~z~0=~z~0_In-352412401} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 06:57:23,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L835-4-->L836: Formula: (= v_~z~0_18 |v_ULTIMATE.start_main_#t~ite19_7|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~z~0=v_~z~0_18, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 06:57:23,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L836-->L836-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1170708310 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1170708310 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out1170708310| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite21_Out1170708310| ~z$w_buff0_used~0_In1170708310)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1170708310, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1170708310} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1170708310, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1170708310, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1170708310|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 06:57:23,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L837-->L837-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In1547426265 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1547426265 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1547426265 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1547426265 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out1547426265| ~z$w_buff1_used~0_In1547426265) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite22_Out1547426265| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1547426265, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1547426265, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1547426265, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1547426265} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1547426265, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1547426265, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1547426265, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1547426265, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1547426265|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 06:57:23,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L838-->L838-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1700413840 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1700413840 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite23_Out1700413840| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1700413840 |ULTIMATE.start_main_#t~ite23_Out1700413840|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1700413840, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1700413840} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1700413840, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1700413840, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1700413840|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 06:57:23,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L839-->L839-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In-369799303 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-369799303 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-369799303 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-369799303 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite24_Out-369799303| 0)) (and (= |ULTIMATE.start_main_#t~ite24_Out-369799303| ~z$r_buff1_thd0~0_In-369799303) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-369799303, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-369799303, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-369799303, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-369799303} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-369799303, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-369799303, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-369799303, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-369799303|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-369799303} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 06:57:23,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L848-->L848-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1971079346 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In1971079346 |ULTIMATE.start_main_#t~ite34_Out1971079346|) (= |ULTIMATE.start_main_#t~ite33_In1971079346| |ULTIMATE.start_main_#t~ite33_Out1971079346|)) (and (= |ULTIMATE.start_main_#t~ite33_Out1971079346| |ULTIMATE.start_main_#t~ite34_Out1971079346|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1971079346 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1971079346 256))) (and (= 0 (mod ~z$w_buff1_used~0_In1971079346 256)) .cse1) (= (mod ~z$w_buff0_used~0_In1971079346 256) 0))) (= ~z$w_buff1~0_In1971079346 |ULTIMATE.start_main_#t~ite33_Out1971079346|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1971079346, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1971079346, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1971079346, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1971079346, ~z$w_buff1~0=~z$w_buff1~0_In1971079346, ~weak$$choice2~0=~weak$$choice2~0_In1971079346, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In1971079346|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1971079346, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1971079346, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1971079346, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1971079346, ~z$w_buff1~0=~z$w_buff1~0_In1971079346, ~weak$$choice2~0=~weak$$choice2~0_In1971079346, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out1971079346|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1971079346|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 06:57:23,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L850-->L850-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1503323175 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1503323175| |ULTIMATE.start_main_#t~ite39_Out1503323175|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1503323175 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In1503323175 256)) .cse1) (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1503323175 256))) (= 0 (mod ~z$w_buff0_used~0_In1503323175 256)))) (= ~z$w_buff1_used~0_In1503323175 |ULTIMATE.start_main_#t~ite39_Out1503323175|)) (and (= |ULTIMATE.start_main_#t~ite39_In1503323175| |ULTIMATE.start_main_#t~ite39_Out1503323175|) (not .cse0) (= ~z$w_buff1_used~0_In1503323175 |ULTIMATE.start_main_#t~ite40_Out1503323175|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1503323175, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1503323175, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In1503323175|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1503323175, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1503323175, ~weak$$choice2~0=~weak$$choice2~0_In1503323175} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1503323175, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1503323175|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1503323175|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1503323175, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1503323175, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1503323175, ~weak$$choice2~0=~weak$$choice2~0_In1503323175} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 06:57:23,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L851-->L852: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~z$r_buff0_thd0~0_69 v_~z$r_buff0_thd0~0_70)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_70, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_69, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_25, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 06:57:23,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L852-->L852-8: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite45_Out-655014270| |ULTIMATE.start_main_#t~ite46_Out-655014270|)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-655014270 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-655014270 256) 0)) (.cse6 (= 0 (mod ~z$r_buff0_thd0~0_In-655014270 256))) (.cse5 (= (mod ~z$w_buff1_used~0_In-655014270 256) 0)) (.cse4 (= 0 (mod ~weak$$choice2~0_In-655014270 256)))) (or (let ((.cse3 (not .cse6))) (and (not .cse0) .cse1 (or (not .cse2) .cse3) (= |ULTIMATE.start_main_#t~ite44_Out-655014270| |ULTIMATE.start_main_#t~ite45_Out-655014270|) (= |ULTIMATE.start_main_#t~ite44_Out-655014270| 0) .cse4 (or (not .cse5) .cse3))) (and (or (and .cse1 (or (and .cse6 .cse2) .cse0 (and .cse6 .cse5)) .cse4 (= ~z$r_buff1_thd0~0_In-655014270 |ULTIMATE.start_main_#t~ite45_Out-655014270|)) (and (= ~z$r_buff1_thd0~0_In-655014270 |ULTIMATE.start_main_#t~ite46_Out-655014270|) (not .cse4) (= |ULTIMATE.start_main_#t~ite45_In-655014270| |ULTIMATE.start_main_#t~ite45_Out-655014270|))) (= |ULTIMATE.start_main_#t~ite44_In-655014270| |ULTIMATE.start_main_#t~ite44_Out-655014270|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-655014270, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-655014270, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-655014270, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-655014270, ~weak$$choice2~0=~weak$$choice2~0_In-655014270, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-655014270|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In-655014270|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-655014270, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-655014270, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-655014270, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-655014270, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-655014270|, ~weak$$choice2~0=~weak$$choice2~0_In-655014270, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-655014270|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-655014270|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 06:57:23,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L854-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_10) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_22 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:57:23,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 06:57:23,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:57:23 BasicIcfg [2019-12-27 06:57:23,754 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:57:23,756 INFO L168 Benchmark]: Toolchain (without parser) took 36563.59 ms. Allocated memory was 144.2 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 100.3 MB in the beginning and 1.1 GB in the end (delta: -975.9 MB). Peak memory consumption was 791.5 MB. Max. memory is 7.1 GB. [2019-12-27 06:57:23,757 INFO L168 Benchmark]: CDTParser took 1.32 ms. Allocated memory is still 144.2 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 06:57:23,757 INFO L168 Benchmark]: CACSL2BoogieTranslator took 868.72 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 99.9 MB in the beginning and 155.1 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:57:23,762 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.70 ms. Allocated memory is still 201.9 MB. Free memory was 155.1 MB in the beginning and 151.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-27 06:57:23,762 INFO L168 Benchmark]: Boogie Preprocessor took 48.22 ms. Allocated memory is still 201.9 MB. Free memory was 151.7 MB in the beginning and 149.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:57:23,763 INFO L168 Benchmark]: RCFGBuilder took 844.46 ms. Allocated memory is still 201.9 MB. Free memory was 149.6 MB in the beginning and 100.4 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2019-12-27 06:57:23,764 INFO L168 Benchmark]: TraceAbstraction took 34729.45 ms. Allocated memory was 201.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 99.7 MB in the beginning and 1.1 GB in the end (delta: -976.5 MB). Peak memory consumption was 733.2 MB. Max. memory is 7.1 GB. [2019-12-27 06:57:23,776 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.32 ms. Allocated memory is still 144.2 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 868.72 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 99.9 MB in the beginning and 155.1 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.70 ms. Allocated memory is still 201.9 MB. Free memory was 155.1 MB in the beginning and 151.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.22 ms. Allocated memory is still 201.9 MB. Free memory was 151.7 MB in the beginning and 149.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 844.46 ms. Allocated memory is still 201.9 MB. Free memory was 149.6 MB in the beginning and 100.4 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34729.45 ms. Allocated memory was 201.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 99.7 MB in the beginning and 1.1 GB in the end (delta: -976.5 MB). Peak memory consumption was 733.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 179 ProgramPointsBefore, 91 ProgramPointsAfterwards, 207 TransitionsBefore, 96 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 28 ChoiceCompositions, 4854 VarBasedMoverChecksPositive, 171 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 51526 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t1485, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] FCALL, FORK 0 pthread_create(&t1486, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t1487, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t1488, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L784] 4 z$w_buff1 = z$w_buff0 [L785] 4 z$w_buff0 = 2 [L786] 4 z$w_buff1_used = z$w_buff0_used [L787] 4 z$w_buff0_used = (_Bool)1 [L800] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 3 y = 1 [L767] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L770] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L802] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L771] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L773] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L839] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L842] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L843] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L844] 0 z$flush_delayed = weak$$choice2 [L845] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L847] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L848] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L849] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L850] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 34.4s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1863 SDtfs, 2198 SDslu, 3962 SDs, 0 SdLazy, 1366 SolverSat, 171 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 22 SyntacticMatches, 8 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51558occurred 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: 13.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 33041 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 690 NumberOfCodeBlocks, 690 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 614 ConstructedInterpolants, 0 QuantifiedInterpolants, 107744 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...