/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:09:30,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:09:30,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:09:30,906 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:09:30,906 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:09:30,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:09:30,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:09:30,920 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:09:30,924 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:09:30,927 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:09:30,928 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:09:30,929 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:09:30,929 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:09:30,930 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:09:30,931 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:09:30,932 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:09:30,932 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:09:30,933 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:09:30,934 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:09:30,936 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:09:30,938 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:09:30,939 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:09:30,940 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:09:30,940 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:09:30,942 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:09:30,942 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:09:30,943 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:09:30,943 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:09:30,944 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:09:30,947 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:09:30,947 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:09:30,948 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:09:30,949 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:09:30,949 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:09:30,951 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:09:30,951 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:09:30,952 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:09:30,953 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:09:30,953 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:09:30,954 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:09:30,955 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:09:30,956 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:09:30,986 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:09:30,986 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:09:30,987 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:09:30,989 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:09:30,989 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:09:30,989 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:09:30,990 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:09:30,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:09:30,990 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:09:30,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:09:30,990 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:09:30,990 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:09:30,992 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:09:30,992 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:09:30,992 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:09:30,993 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:09:30,993 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:09:30,993 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:09:30,994 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:09:30,994 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:09:30,994 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:09:30,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:09:30,994 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:09:30,995 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:09:30,995 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:09:30,995 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:09:30,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:09:30,995 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:09:30,996 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:09:30,999 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:09:31,290 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:09:31,302 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:09:31,306 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:09:31,307 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:09:31,308 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:09:31,308 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i [2019-12-26 23:09:31,384 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71ab2256/d8b793d22a93495da84d1b55ae35328d/FLAG93ad9e30e [2019-12-26 23:09:32,009 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:09:32,010 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i [2019-12-26 23:09:32,036 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71ab2256/d8b793d22a93495da84d1b55ae35328d/FLAG93ad9e30e [2019-12-26 23:09:32,243 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71ab2256/d8b793d22a93495da84d1b55ae35328d [2019-12-26 23:09:32,252 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:09:32,254 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:09:32,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:09:32,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:09:32,260 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:09:32,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:09:32" (1/1) ... [2019-12-26 23:09:32,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@be3ea45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:09:32, skipping insertion in model container [2019-12-26 23:09:32,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:09:32" (1/1) ... [2019-12-26 23:09:32,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:09:32,329 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:09:32,825 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:09:32,840 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:09:32,914 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:09:32,992 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:09:32,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:09:32 WrapperNode [2019-12-26 23:09:32,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:09:32,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:09:32,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:09:32,994 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:09:33,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:09:32" (1/1) ... [2019-12-26 23:09:33,021 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:09:32" (1/1) ... [2019-12-26 23:09:33,070 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:09:33,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:09:33,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:09:33,070 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:09:33,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:09:32" (1/1) ... [2019-12-26 23:09:33,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:09:32" (1/1) ... [2019-12-26 23:09:33,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:09:32" (1/1) ... [2019-12-26 23:09:33,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:09:32" (1/1) ... [2019-12-26 23:09:33,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:09:32" (1/1) ... [2019-12-26 23:09:33,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:09:32" (1/1) ... [2019-12-26 23:09:33,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:09:32" (1/1) ... [2019-12-26 23:09:33,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:09:33,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:09:33,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:09:33,106 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:09:33,107 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:09:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:09:33,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:09:33,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:09:33,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:09:33,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:09:33,173 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:09:33,174 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:09:33,174 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:09:33,174 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:09:33,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:09:33,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:09:33,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:09:33,177 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:09:33,801 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:09:33,801 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:09:33,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:09:33 BoogieIcfgContainer [2019-12-26 23:09:33,803 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:09:33,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:09:33,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:09:33,808 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:09:33,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:09:32" (1/3) ... [2019-12-26 23:09:33,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd17e51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:09:33, skipping insertion in model container [2019-12-26 23:09:33,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:09:32" (2/3) ... [2019-12-26 23:09:33,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd17e51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:09:33, skipping insertion in model container [2019-12-26 23:09:33,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:09:33" (3/3) ... [2019-12-26 23:09:33,812 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_power.opt.i [2019-12-26 23:09:33,823 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:09:33,824 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:09:33,832 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:09:33,833 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:09:33,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,871 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,871 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,880 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,881 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,881 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,881 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,882 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,896 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,896 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,899 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,899 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,900 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:33,918 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 23:09:33,940 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:09:33,940 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:09:33,940 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:09:33,940 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:09:33,941 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:09:33,941 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:09:33,941 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:09:33,941 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:09:33,959 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-26 23:09:33,961 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-26 23:09:34,086 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-26 23:09:34,087 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:09:34,100 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 254 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 23:09:34,118 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-26 23:09:34,203 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-26 23:09:34,203 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:09:34,211 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 254 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 23:09:34,231 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-26 23:09:34,232 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:09:38,396 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-26 23:09:38,522 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-26 23:09:38,546 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50487 [2019-12-26 23:09:38,547 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-26 23:09:38,550 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 94 transitions [2019-12-26 23:09:39,022 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9480 states. [2019-12-26 23:09:39,024 INFO L276 IsEmpty]: Start isEmpty. Operand 9480 states. [2019-12-26 23:09:39,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 23:09:39,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:09:39,032 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 23:09:39,033 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:09:39,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:09:39,039 INFO L82 PathProgramCache]: Analyzing trace with hash 692929394, now seen corresponding path program 1 times [2019-12-26 23:09:39,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:09:39,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098468824] [2019-12-26 23:09:39,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:09:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:09:39,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:09:39,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098468824] [2019-12-26 23:09:39,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:09:39,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:09:39,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351235892] [2019-12-26 23:09:39,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:09:39,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:09:39,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:09:39,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:09:39,334 INFO L87 Difference]: Start difference. First operand 9480 states. Second operand 3 states. [2019-12-26 23:09:39,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:09:39,651 INFO L93 Difference]: Finished difference Result 9416 states and 31128 transitions. [2019-12-26 23:09:39,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:09:39,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 23:09:39,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:09:39,772 INFO L225 Difference]: With dead ends: 9416 [2019-12-26 23:09:39,772 INFO L226 Difference]: Without dead ends: 9234 [2019-12-26 23:09:39,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:09:39,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9234 states. [2019-12-26 23:09:40,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9234 to 9234. [2019-12-26 23:09:40,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9234 states. [2019-12-26 23:09:40,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9234 states to 9234 states and 30568 transitions. [2019-12-26 23:09:40,266 INFO L78 Accepts]: Start accepts. Automaton has 9234 states and 30568 transitions. Word has length 5 [2019-12-26 23:09:40,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:09:40,267 INFO L462 AbstractCegarLoop]: Abstraction has 9234 states and 30568 transitions. [2019-12-26 23:09:40,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:09:40,267 INFO L276 IsEmpty]: Start isEmpty. Operand 9234 states and 30568 transitions. [2019-12-26 23:09:40,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:09:40,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:09:40,270 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:09:40,270 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:09:40,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:09:40,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1820083367, now seen corresponding path program 1 times [2019-12-26 23:09:40,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:09:40,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745086391] [2019-12-26 23:09:40,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:09:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:09:40,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:09:40,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745086391] [2019-12-26 23:09:40,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:09:40,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:09:40,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309560382] [2019-12-26 23:09:40,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:09:40,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:09:40,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:09:40,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:09:40,418 INFO L87 Difference]: Start difference. First operand 9234 states and 30568 transitions. Second operand 4 states. [2019-12-26 23:09:40,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:09:40,765 INFO L93 Difference]: Finished difference Result 14362 states and 45554 transitions. [2019-12-26 23:09:40,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:09:40,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:09:40,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:09:41,435 INFO L225 Difference]: With dead ends: 14362 [2019-12-26 23:09:41,435 INFO L226 Difference]: Without dead ends: 14355 [2019-12-26 23:09:41,436 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-26 23:09:41,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14355 states. [2019-12-26 23:09:41,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14355 to 13038. [2019-12-26 23:09:41,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13038 states. [2019-12-26 23:09:41,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13038 states to 13038 states and 41962 transitions. [2019-12-26 23:09:41,878 INFO L78 Accepts]: Start accepts. Automaton has 13038 states and 41962 transitions. Word has length 11 [2019-12-26 23:09:41,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:09:41,878 INFO L462 AbstractCegarLoop]: Abstraction has 13038 states and 41962 transitions. [2019-12-26 23:09:41,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:09:41,878 INFO L276 IsEmpty]: Start isEmpty. Operand 13038 states and 41962 transitions. [2019-12-26 23:09:41,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:09:41,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:09:41,881 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:09:41,882 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:09:41,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:09:41,882 INFO L82 PathProgramCache]: Analyzing trace with hash 417951775, now seen corresponding path program 1 times [2019-12-26 23:09:41,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:09:41,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995985151] [2019-12-26 23:09:41,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:09:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:09:41,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:09:41,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995985151] [2019-12-26 23:09:41,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:09:41,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:09:41,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096953180] [2019-12-26 23:09:41,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:09:41,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:09:41,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:09:41,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:09:41,950 INFO L87 Difference]: Start difference. First operand 13038 states and 41962 transitions. Second operand 3 states. [2019-12-26 23:09:41,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:09:41,964 INFO L93 Difference]: Finished difference Result 1778 states and 4038 transitions. [2019-12-26 23:09:41,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:09:41,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-26 23:09:41,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:09:41,969 INFO L225 Difference]: With dead ends: 1778 [2019-12-26 23:09:41,969 INFO L226 Difference]: Without dead ends: 1778 [2019-12-26 23:09:41,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:09:41,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2019-12-26 23:09:42,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1778. [2019-12-26 23:09:42,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2019-12-26 23:09:42,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 4038 transitions. [2019-12-26 23:09:42,008 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 4038 transitions. Word has length 11 [2019-12-26 23:09:42,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:09:42,008 INFO L462 AbstractCegarLoop]: Abstraction has 1778 states and 4038 transitions. [2019-12-26 23:09:42,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:09:42,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 4038 transitions. [2019-12-26 23:09:42,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-26 23:09:42,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:09:42,011 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] [2019-12-26 23:09:42,011 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:09:42,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:09:42,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1954901459, now seen corresponding path program 1 times [2019-12-26 23:09:42,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:09:42,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835435627] [2019-12-26 23:09:42,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:09:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:09:42,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:09:42,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835435627] [2019-12-26 23:09:42,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:09:42,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:09:42,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917811136] [2019-12-26 23:09:42,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:09:42,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:09:42,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:09:42,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:09:42,074 INFO L87 Difference]: Start difference. First operand 1778 states and 4038 transitions. Second operand 4 states. [2019-12-26 23:09:42,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:09:42,091 INFO L93 Difference]: Finished difference Result 371 states and 689 transitions. [2019-12-26 23:09:42,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:09:42,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-26 23:09:42,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:09:42,092 INFO L225 Difference]: With dead ends: 371 [2019-12-26 23:09:42,092 INFO L226 Difference]: Without dead ends: 371 [2019-12-26 23:09:42,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:09:42,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-12-26 23:09:42,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 336. [2019-12-26 23:09:42,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-12-26 23:09:42,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 624 transitions. [2019-12-26 23:09:42,100 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 624 transitions. Word has length 23 [2019-12-26 23:09:42,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:09:42,100 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 624 transitions. [2019-12-26 23:09:42,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:09:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 624 transitions. [2019-12-26 23:09:42,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:09:42,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:09:42,102 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] [2019-12-26 23:09:42,103 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:09:42,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:09:42,103 INFO L82 PathProgramCache]: Analyzing trace with hash 798988436, now seen corresponding path program 1 times [2019-12-26 23:09:42,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:09:42,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197514535] [2019-12-26 23:09:42,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:09:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:09:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:09:42,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197514535] [2019-12-26 23:09:42,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:09:42,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:09:42,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689776955] [2019-12-26 23:09:42,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:09:42,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:09:42,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:09:42,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:09:42,208 INFO L87 Difference]: Start difference. First operand 336 states and 624 transitions. Second operand 3 states. [2019-12-26 23:09:42,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:09:42,267 INFO L93 Difference]: Finished difference Result 345 states and 638 transitions. [2019-12-26 23:09:42,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:09:42,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-26 23:09:42,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:09:42,270 INFO L225 Difference]: With dead ends: 345 [2019-12-26 23:09:42,270 INFO L226 Difference]: Without dead ends: 345 [2019-12-26 23:09:42,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:09:42,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-12-26 23:09:42,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2019-12-26 23:09:42,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-12-26 23:09:42,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 634 transitions. [2019-12-26 23:09:42,277 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 634 transitions. Word has length 52 [2019-12-26 23:09:42,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:09:42,278 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 634 transitions. [2019-12-26 23:09:42,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:09:42,278 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 634 transitions. [2019-12-26 23:09:42,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:09:42,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:09:42,282 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] [2019-12-26 23:09:42,282 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:09:42,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:09:42,282 INFO L82 PathProgramCache]: Analyzing trace with hash 112676449, now seen corresponding path program 1 times [2019-12-26 23:09:42,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:09:42,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021098019] [2019-12-26 23:09:42,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:09:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:09:42,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:09:42,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021098019] [2019-12-26 23:09:42,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:09:42,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:09:42,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011188625] [2019-12-26 23:09:42,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:09:42,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:09:42,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:09:42,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:09:42,386 INFO L87 Difference]: Start difference. First operand 341 states and 634 transitions. Second operand 3 states. [2019-12-26 23:09:42,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:09:42,429 INFO L93 Difference]: Finished difference Result 345 states and 628 transitions. [2019-12-26 23:09:42,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:09:42,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-26 23:09:42,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:09:42,431 INFO L225 Difference]: With dead ends: 345 [2019-12-26 23:09:42,431 INFO L226 Difference]: Without dead ends: 345 [2019-12-26 23:09:42,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:09:42,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-12-26 23:09:42,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2019-12-26 23:09:42,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-12-26 23:09:42,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 624 transitions. [2019-12-26 23:09:42,441 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 624 transitions. Word has length 52 [2019-12-26 23:09:42,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:09:42,444 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 624 transitions. [2019-12-26 23:09:42,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:09:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 624 transitions. [2019-12-26 23:09:42,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:09:42,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:09:42,446 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] [2019-12-26 23:09:42,446 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:09:42,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:09:42,446 INFO L82 PathProgramCache]: Analyzing trace with hash 107384222, now seen corresponding path program 1 times [2019-12-26 23:09:42,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:09:42,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221821362] [2019-12-26 23:09:42,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:09:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:09:42,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:09:42,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221821362] [2019-12-26 23:09:42,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:09:42,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:09:42,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584410012] [2019-12-26 23:09:42,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:09:42,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:09:42,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:09:42,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:09:42,573 INFO L87 Difference]: Start difference. First operand 341 states and 624 transitions. Second operand 3 states. [2019-12-26 23:09:42,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:09:42,589 INFO L93 Difference]: Finished difference Result 328 states and 585 transitions. [2019-12-26 23:09:42,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:09:42,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-26 23:09:42,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:09:42,590 INFO L225 Difference]: With dead ends: 328 [2019-12-26 23:09:42,590 INFO L226 Difference]: Without dead ends: 328 [2019-12-26 23:09:42,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:09:42,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-12-26 23:09:42,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2019-12-26 23:09:42,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-26 23:09:42,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 585 transitions. [2019-12-26 23:09:42,597 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 585 transitions. Word has length 52 [2019-12-26 23:09:42,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:09:42,598 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 585 transitions. [2019-12-26 23:09:42,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:09:42,598 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 585 transitions. [2019-12-26 23:09:42,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 23:09:42,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:09:42,599 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:09:42,599 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:09:42,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:09:42,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1649755206, now seen corresponding path program 1 times [2019-12-26 23:09:42,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:09:42,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337211713] [2019-12-26 23:09:42,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:09:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:09:42,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:09:42,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337211713] [2019-12-26 23:09:42,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:09:42,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:09:42,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779717668] [2019-12-26 23:09:42,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:09:42,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:09:42,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:09:42,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:09:42,694 INFO L87 Difference]: Start difference. First operand 328 states and 585 transitions. Second operand 3 states. [2019-12-26 23:09:42,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:09:42,740 INFO L93 Difference]: Finished difference Result 327 states and 583 transitions. [2019-12-26 23:09:42,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:09:42,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-26 23:09:42,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:09:42,741 INFO L225 Difference]: With dead ends: 327 [2019-12-26 23:09:42,742 INFO L226 Difference]: Without dead ends: 327 [2019-12-26 23:09:42,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:09:42,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-12-26 23:09:42,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 273. [2019-12-26 23:09:42,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-12-26 23:09:42,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 489 transitions. [2019-12-26 23:09:42,747 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 489 transitions. Word has length 53 [2019-12-26 23:09:42,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:09:42,747 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 489 transitions. [2019-12-26 23:09:42,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:09:42,747 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 489 transitions. [2019-12-26 23:09:42,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 23:09:42,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:09:42,749 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:09:42,749 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:09:42,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:09:42,749 INFO L82 PathProgramCache]: Analyzing trace with hash -69490417, now seen corresponding path program 1 times [2019-12-26 23:09:42,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:09:42,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449379004] [2019-12-26 23:09:42,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:09:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:09:42,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:09:42,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449379004] [2019-12-26 23:09:42,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:09:42,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:09:42,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552696394] [2019-12-26 23:09:42,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:09:42,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:09:42,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:09:42,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:09:42,844 INFO L87 Difference]: Start difference. First operand 273 states and 489 transitions. Second operand 5 states. [2019-12-26 23:09:42,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:09:42,901 INFO L93 Difference]: Finished difference Result 463 states and 820 transitions. [2019-12-26 23:09:42,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:09:42,902 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-12-26 23:09:42,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:09:42,903 INFO L225 Difference]: With dead ends: 463 [2019-12-26 23:09:42,903 INFO L226 Difference]: Without dead ends: 209 [2019-12-26 23:09:42,903 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-26 23:09:42,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-12-26 23:09:42,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-12-26 23:09:42,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-26 23:09:42,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 362 transitions. [2019-12-26 23:09:42,908 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 362 transitions. Word has length 54 [2019-12-26 23:09:42,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:09:42,908 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 362 transitions. [2019-12-26 23:09:42,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:09:42,909 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 362 transitions. [2019-12-26 23:09:42,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 23:09:42,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:09:42,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] [2019-12-26 23:09:42,910 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:09:42,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:09:42,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1455781027, now seen corresponding path program 2 times [2019-12-26 23:09:42,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:09:42,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035369248] [2019-12-26 23:09:42,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:09:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:09:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:09:43,056 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:09:43,056 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:09:43,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] ULTIMATE.startENTRY-->L787: Formula: (let ((.cse0 (store |v_#valid_48| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x~0_169) (= 0 v_~x$read_delayed_var~0.offset_6) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1587~0.base_19| 4)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1587~0.base_19|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1587~0.base_19| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1587~0.base_19|) |v_ULTIMATE.start_main_~#t1587~0.offset_14| 0)) |v_#memory_int_17|) (= |v_#NULL.offset_7| 0) (= v_~x$r_buff1_thd2~0_98 0) (= 0 v_~__unbuffered_cnt~0_67) (= v_~main$tmp_guard1~0_21 0) (= 0 v_~x$w_buff1_used~0_304) (= v_~x$r_buff0_thd0~0_295 0) (= 0 v_~x$r_buff0_thd2~0_162) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1587~0.base_19|) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x$read_delayed~0_6) (= v_~y~0_104 0) (= 0 |v_ULTIMATE.start_main_~#t1587~0.offset_14|) (= v_~__unbuffered_p1_EBX~0_62 0) (= v_~x$mem_tmp~0_16 0) (= v_~x$flush_delayed~0_31 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1587~0.base_19| 1) |v_#valid_46|) (= 0 v_~weak$$choice2~0_83) (= 0 v_~weak$$choice0~0_11) (= 0 v_~__unbuffered_p1_EAX~0_62) (= 0 |v_#NULL.base_7|) (= 0 v_~x$w_buff1~0_172) (= v_~main$tmp_guard0~0_26 0) (= v_~x$r_buff1_thd1~0_135 0) (= v_~x$r_buff0_thd1~0_120 0) (= 0 v_~x$w_buff0~0_199) (= v_~x$r_buff1_thd0~0_177 0) (= 0 v_~x$w_buff0_used~0_556))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_199, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_30|, ULTIMATE.start_main_~#t1587~0.offset=|v_ULTIMATE.start_main_~#t1587~0.offset_14|, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_25|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_135, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_29|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_32|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_25|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_62, #length=|v_#length_17|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_295, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_31|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_15|, ~x$w_buff1~0=v_~x$w_buff1~0_172, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_23|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_304, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_98, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_34|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_26|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, ~x~0=v_~x~0_169, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_120, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_19|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_32|, ~x$mem_tmp~0=v_~x$mem_tmp~0_16, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_37|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_30|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_28|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_34|, ULTIMATE.start_main_~#t1588~0.base=|v_ULTIMATE.start_main_~#t1588~0.base_17|, ~y~0=v_~y~0_104, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_37|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_15|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_32|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_177, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_162, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_23|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_28|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_556, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1588~0.offset=|v_ULTIMATE.start_main_~#t1588~0.offset_14|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_23|, ULTIMATE.start_main_~#t1587~0.base=|v_ULTIMATE.start_main_~#t1587~0.base_19|, ~weak$$choice2~0=v_~weak$$choice2~0_83, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1587~0.offset, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1588~0.base, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1588~0.offset, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1587~0.base, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 23:09:43,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L787-1-->L789: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1588~0.base_10|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1588~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1588~0.base_10|) |v_ULTIMATE.start_main_~#t1588~0.offset_9| 1))) (= |v_ULTIMATE.start_main_~#t1588~0.offset_9| 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1588~0.base_10| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1588~0.base_10|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1588~0.base_10| 1)) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1588~0.base_10|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1588~0.offset=|v_ULTIMATE.start_main_~#t1588~0.offset_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_3|, ULTIMATE.start_main_~#t1588~0.base=|v_ULTIMATE.start_main_~#t1588~0.base_10|, #length=|v_#length_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1588~0.offset, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1588~0.base, #length] because there is no mapped edge [2019-12-26 23:09:43,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L4-->L764: Formula: (and (= 1 ~x$r_buff0_thd2~0_Out716250362) (= ~x$r_buff1_thd1~0_Out716250362 ~x$r_buff0_thd1~0_In716250362) (= ~__unbuffered_p1_EAX~0_Out716250362 ~y~0_Out716250362) (not (= 0 P1Thread1of1ForFork1___VERIFIER_assert_~expression_In716250362)) (= ~x$r_buff0_thd0~0_In716250362 ~x$r_buff1_thd0~0_Out716250362) (= ~x$r_buff0_thd2~0_In716250362 ~x$r_buff1_thd2~0_Out716250362) (= ~y~0_Out716250362 1) (= ~y~0_Out716250362 ~__unbuffered_p1_EBX~0_Out716250362)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In716250362, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In716250362, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In716250362, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In716250362} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In716250362, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In716250362, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In716250362, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out716250362, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out716250362, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out716250362, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out716250362, ~y~0=~y~0_Out716250362, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out716250362, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out716250362} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-26 23:09:43,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L730-2-->L730-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-458380488 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-458380488 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In-458380488 |P0Thread1of1ForFork0_#t~ite3_Out-458380488|)) (and (not .cse1) (not .cse0) (= ~x$w_buff1~0_In-458380488 |P0Thread1of1ForFork0_#t~ite3_Out-458380488|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-458380488, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-458380488, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-458380488, ~x~0=~x~0_In-458380488} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-458380488|, ~x$w_buff1~0=~x$w_buff1~0_In-458380488, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-458380488, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-458380488, ~x~0=~x~0_In-458380488} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3] because there is no mapped edge [2019-12-26 23:09:43,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L730-4-->L731: Formula: (= v_~x~0_20 |v_P0Thread1of1ForFork0_#t~ite3_16|) InVars {P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_16|} OutVars{P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_15|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_7|, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, ~x~0] because there is no mapped edge [2019-12-26 23:09:43,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L731-->L731-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1419272963 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1419272963 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1419272963| 0) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In1419272963 |P0Thread1of1ForFork0_#t~ite5_Out1419272963|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1419272963, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1419272963} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1419272963|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1419272963, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1419272963} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:09:43,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L732-->L732-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-508239901 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-508239901 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-508239901 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-508239901 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-508239901 |P0Thread1of1ForFork0_#t~ite6_Out-508239901|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-508239901|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-508239901, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-508239901, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-508239901, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-508239901} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-508239901|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-508239901, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-508239901, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-508239901, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-508239901} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:09:43,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L733-->L733-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-118978205 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-118978205 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite7_Out-118978205| ~x$r_buff0_thd1~0_In-118978205) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite7_Out-118978205| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-118978205, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-118978205} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-118978205, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-118978205|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-118978205} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-26 23:09:43,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1227538818 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1227538818 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1227538818| ~x$w_buff0_used~0_In-1227538818) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-1227538818| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1227538818, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1227538818} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1227538818|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1227538818, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1227538818} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 23:09:43,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L766-->L766-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In493948499 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In493948499 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In493948499 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In493948499 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out493948499| ~x$w_buff1_used~0_In493948499) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite12_Out493948499| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In493948499, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In493948499, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In493948499, ~x$w_buff0_used~0=~x$w_buff0_used~0_In493948499} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In493948499, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In493948499, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out493948499|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In493948499, ~x$w_buff0_used~0=~x$w_buff0_used~0_In493948499} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 23:09:43,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L767-->L768: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In110237889 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In110237889 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out110237889)) (and (= ~x$r_buff0_thd2~0_In110237889 ~x$r_buff0_thd2~0_Out110237889) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In110237889, ~x$w_buff0_used~0=~x$w_buff0_used~0_In110237889} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out110237889|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out110237889, ~x$w_buff0_used~0=~x$w_buff0_used~0_In110237889} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 23:09:43,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L768-->L768-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-1546998389 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1546998389 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1546998389 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1546998389 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In-1546998389 |P1Thread1of1ForFork1_#t~ite14_Out-1546998389|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite14_Out-1546998389| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1546998389, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1546998389, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1546998389, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1546998389} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1546998389, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1546998389, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1546998389, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1546998389|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1546998389} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 23:09:43,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= v_~x$r_buff1_thd2~0_46 |v_P1Thread1of1ForFork1_#t~ite14_34|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_34|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_46, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_33|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 23:09:43,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L734-->L734-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In81179171 256))) (.cse3 (= (mod ~x$r_buff0_thd1~0_In81179171 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In81179171 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In81179171 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out81179171| ~x$r_buff1_thd1~0_In81179171) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out81179171| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In81179171, ~x$w_buff1_used~0=~x$w_buff1_used~0_In81179171, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In81179171, ~x$w_buff0_used~0=~x$w_buff0_used~0_In81179171} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In81179171, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out81179171|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In81179171, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In81179171, ~x$w_buff0_used~0=~x$w_buff0_used~0_In81179171} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:09:43,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L734-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_94 |v_P0Thread1of1ForFork0_#t~ite8_34|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_33|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_94} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-26 23:09:43,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L789-1-->L795: Formula: (and (= 2 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 23:09:43,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L795-2-->L795-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In936001896 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In936001896 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In936001896 |ULTIMATE.start_main_#t~ite17_Out936001896|)) (and (= ~x~0_In936001896 |ULTIMATE.start_main_#t~ite17_Out936001896|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In936001896, ~x$w_buff1_used~0=~x$w_buff1_used~0_In936001896, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In936001896, ~x~0=~x~0_In936001896} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out936001896|, ~x$w_buff1~0=~x$w_buff1~0_In936001896, ~x$w_buff1_used~0=~x$w_buff1_used~0_In936001896, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In936001896, ~x~0=~x~0_In936001896} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-26 23:09:43,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [624] [624] L795-4-->L796: Formula: (= v_~x~0_42 |v_ULTIMATE.start_main_#t~ite17_11|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_11|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_10|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_6|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-26 23:09:43,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1464902229 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1464902229 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1464902229 |ULTIMATE.start_main_#t~ite19_Out-1464902229|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite19_Out-1464902229|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1464902229, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1464902229} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1464902229, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1464902229|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1464902229} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-26 23:09:43,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L797-->L797-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1607880268 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-1607880268 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-1607880268 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1607880268 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite20_Out-1607880268|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1607880268 |ULTIMATE.start_main_#t~ite20_Out-1607880268|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1607880268, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1607880268, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1607880268, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1607880268} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1607880268, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1607880268, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1607880268|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1607880268, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1607880268} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-26 23:09:43,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-1788673825 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1788673825 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out-1788673825|)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In-1788673825 |ULTIMATE.start_main_#t~ite21_Out-1788673825|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1788673825, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1788673825} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1788673825, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1788673825|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1788673825} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-26 23:09:43,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In849182366 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In849182366 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In849182366 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In849182366 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite22_Out849182366|)) (and (= |ULTIMATE.start_main_#t~ite22_Out849182366| ~x$r_buff1_thd0~0_In849182366) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In849182366, ~x$w_buff1_used~0=~x$w_buff1_used~0_In849182366, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In849182366, ~x$w_buff0_used~0=~x$w_buff0_used~0_In849182366} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In849182366, ~x$w_buff1_used~0=~x$w_buff1_used~0_In849182366, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In849182366, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out849182366|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In849182366} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-26 23:09:43,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L812: Formula: (and (not (= (mod v_~weak$$choice2~0_40 256) 0)) (= v_~x$r_buff0_thd0~0_150 v_~x$r_buff0_thd0~0_151)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_151, ~weak$$choice2~0=v_~weak$$choice2~0_40} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_150, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ~weak$$choice2~0=v_~weak$$choice2~0_40} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-26 23:09:43,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L814-->L817-1: Formula: (and (= v_~x$mem_tmp~0_10 v_~x~0_111) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_11 256)) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_111, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:09:43,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L817-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 23:09:43,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:09:43 BasicIcfg [2019-12-26 23:09:43,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:09:43,202 INFO L168 Benchmark]: Toolchain (without parser) took 10947.94 ms. Allocated memory was 138.4 MB in the beginning and 515.9 MB in the end (delta: 377.5 MB). Free memory was 98.9 MB in the beginning and 265.0 MB in the end (delta: -166.0 MB). Peak memory consumption was 211.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:09:43,203 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 138.4 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-26 23:09:43,204 INFO L168 Benchmark]: CACSL2BoogieTranslator took 738.16 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 98.7 MB in the beginning and 155.2 MB in the end (delta: -56.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:09:43,209 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.24 ms. Allocated memory is still 201.3 MB. Free memory was 155.2 MB in the beginning and 152.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:09:43,210 INFO L168 Benchmark]: Boogie Preprocessor took 35.39 ms. Allocated memory is still 201.3 MB. Free memory was 152.5 MB in the beginning and 150.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-26 23:09:43,211 INFO L168 Benchmark]: RCFGBuilder took 697.24 ms. Allocated memory is still 201.3 MB. Free memory was 150.4 MB in the beginning and 105.8 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:09:43,216 INFO L168 Benchmark]: TraceAbstraction took 9395.65 ms. Allocated memory was 201.3 MB in the beginning and 515.9 MB in the end (delta: 314.6 MB). Free memory was 105.8 MB in the beginning and 265.0 MB in the end (delta: -159.2 MB). Peak memory consumption was 155.4 MB. Max. memory is 7.1 GB. [2019-12-26 23:09:43,223 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 138.4 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 738.16 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 98.7 MB in the beginning and 155.2 MB in the end (delta: -56.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.24 ms. Allocated memory is still 201.3 MB. Free memory was 155.2 MB in the beginning and 152.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.39 ms. Allocated memory is still 201.3 MB. Free memory was 152.5 MB in the beginning and 150.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 697.24 ms. Allocated memory is still 201.3 MB. Free memory was 150.4 MB in the beginning and 105.8 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9395.65 ms. Allocated memory was 201.3 MB in the beginning and 515.9 MB in the end (delta: 314.6 MB). Free memory was 105.8 MB in the beginning and 265.0 MB in the end (delta: -159.2 MB). Peak memory consumption was 155.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.5s, 147 ProgramPointsBefore, 81 ProgramPointsAfterwards, 181 TransitionsBefore, 94 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 24 ChoiceCompositions, 3783 VarBasedMoverChecksPositive, 170 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 202 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 50487 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L787] FCALL, FORK 0 pthread_create(&t1587, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] FCALL, FORK 0 pthread_create(&t1588, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 2 x$w_buff1 = x$w_buff0 [L745] 2 x$w_buff0 = 2 [L746] 2 x$w_buff1_used = x$w_buff0_used [L747] 2 x$w_buff0_used = (_Bool)1 [L724] 1 y = 2 [L727] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L730] 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L731] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L733] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L795] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L797] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L798] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L799] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L802] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 0 x$flush_delayed = weak$$choice2 [L805] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L807] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L807] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L808] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L809] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L810] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L810] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L812] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L812] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 9.1s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 887 SDtfs, 404 SDslu, 857 SDs, 0 SdLazy, 310 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13038occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 9 MinimizatonAttempts, 1414 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 367 NumberOfCodeBlocks, 367 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 304 ConstructedInterpolants, 0 QuantifiedInterpolants, 29798 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...