/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 19:04:58,902 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 19:04:58,905 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 19:04:58,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 19:04:58,921 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 19:04:58,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 19:04:58,924 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 19:04:58,925 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 19:04:58,929 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 19:04:58,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 19:04:58,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 19:04:58,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 19:04:58,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 19:04:58,933 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 19:04:58,939 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 19:04:58,940 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 19:04:58,941 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 19:04:58,942 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 19:04:58,944 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 19:04:58,946 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 19:04:58,947 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 19:04:58,948 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 19:04:58,949 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 19:04:58,950 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 19:04:58,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 19:04:58,953 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 19:04:58,953 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 19:04:58,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 19:04:58,954 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 19:04:58,955 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 19:04:58,955 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 19:04:58,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 19:04:58,959 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 19:04:58,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 19:04:58,962 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 19:04:58,962 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 19:04:58,964 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 19:04:58,965 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 19:04:58,965 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 19:04:58,968 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 19:04:58,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 19:04:58,972 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 19:04:58,995 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 19:04:58,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 19:04:58,998 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 19:04:58,998 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 19:04:58,999 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 19:04:58,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 19:04:58,999 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 19:04:58,999 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 19:04:59,000 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 19:04:59,000 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 19:04:59,000 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 19:04:59,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 19:04:59,001 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 19:04:59,002 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 19:04:59,002 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 19:04:59,002 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 19:04:59,002 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 19:04:59,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 19:04:59,003 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 19:04:59,003 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 19:04:59,003 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 19:04:59,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:04:59,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 19:04:59,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 19:04:59,004 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 19:04:59,004 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 19:04:59,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 19:04:59,004 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 19:04:59,004 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 19:04:59,263 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 19:04:59,278 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 19:04:59,281 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 19:04:59,282 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 19:04:59,282 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 19:04:59,283 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.oepc.i [2019-12-18 19:04:59,355 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8df40340/ad69fcf748c7498ca08e20ecb76359b0/FLAG583a45a67 [2019-12-18 19:04:59,919 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 19:04:59,920 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.oepc.i [2019-12-18 19:04:59,945 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8df40340/ad69fcf748c7498ca08e20ecb76359b0/FLAG583a45a67 [2019-12-18 19:05:00,225 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8df40340/ad69fcf748c7498ca08e20ecb76359b0 [2019-12-18 19:05:00,239 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 19:05:00,240 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 19:05:00,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 19:05:00,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 19:05:00,245 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 19:05:00,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:05:00" (1/1) ... [2019-12-18 19:05:00,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18316cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:00, skipping insertion in model container [2019-12-18 19:05:00,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:05:00" (1/1) ... [2019-12-18 19:05:00,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 19:05:00,315 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 19:05:00,801 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:05:00,823 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 19:05:00,908 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:05:00,975 INFO L208 MainTranslator]: Completed translation [2019-12-18 19:05:00,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:00 WrapperNode [2019-12-18 19:05:00,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 19:05:00,977 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 19:05:00,977 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 19:05:00,977 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 19:05:00,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:00" (1/1) ... [2019-12-18 19:05:01,006 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:00" (1/1) ... [2019-12-18 19:05:01,038 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 19:05:01,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 19:05:01,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 19:05:01,038 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 19:05:01,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:00" (1/1) ... [2019-12-18 19:05:01,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:00" (1/1) ... [2019-12-18 19:05:01,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:00" (1/1) ... [2019-12-18 19:05:01,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:00" (1/1) ... [2019-12-18 19:05:01,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:00" (1/1) ... [2019-12-18 19:05:01,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:00" (1/1) ... [2019-12-18 19:05:01,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:00" (1/1) ... [2019-12-18 19:05:01,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 19:05:01,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 19:05:01,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 19:05:01,079 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 19:05:01,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:00" (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-18 19:05:01,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 19:05:01,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 19:05:01,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 19:05:01,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 19:05:01,155 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 19:05:01,156 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 19:05:01,156 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 19:05:01,156 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 19:05:01,156 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 19:05:01,157 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 19:05:01,157 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 19:05:01,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 19:05:01,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 19:05:01,159 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 19:05:01,890 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 19:05:01,890 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 19:05:01,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:05:01 BoogieIcfgContainer [2019-12-18 19:05:01,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 19:05:01,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 19:05:01,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 19:05:01,896 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 19:05:01,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:05:00" (1/3) ... [2019-12-18 19:05:01,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60eb0ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:05:01, skipping insertion in model container [2019-12-18 19:05:01,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:00" (2/3) ... [2019-12-18 19:05:01,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60eb0ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:05:01, skipping insertion in model container [2019-12-18 19:05:01,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:05:01" (3/3) ... [2019-12-18 19:05:01,901 INFO L109 eAbstractionObserver]: Analyzing ICFG safe031_power.oepc.i [2019-12-18 19:05:01,911 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 19:05:01,912 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 19:05:01,920 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 19:05:01,921 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 19:05:01,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,971 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,971 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:01,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,019 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,019 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,020 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,020 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,020 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,027 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,027 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,036 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,036 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,036 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,042 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,043 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,046 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,047 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:02,066 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 19:05:02,086 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:05:02,087 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:05:02,087 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:05:02,087 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:05:02,087 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:05:02,087 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:05:02,087 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:05:02,088 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:05:02,105 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-18 19:05:02,107 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 19:05:02,192 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 19:05:02,193 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:05:02,214 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 19:05:02,240 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 19:05:02,283 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 19:05:02,283 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:05:02,290 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 19:05:02,310 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 19:05:02,311 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:05:06,089 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-12-18 19:05:07,645 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 19:05:07,774 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 19:05:07,799 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64880 [2019-12-18 19:05:07,799 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 19:05:07,805 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-18 19:05:19,323 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83222 states. [2019-12-18 19:05:19,325 INFO L276 IsEmpty]: Start isEmpty. Operand 83222 states. [2019-12-18 19:05:19,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 19:05:19,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:19,332 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 19:05:19,333 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:19,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:19,339 INFO L82 PathProgramCache]: Analyzing trace with hash 793650723, now seen corresponding path program 1 times [2019-12-18 19:05:19,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:19,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058916279] [2019-12-18 19:05:19,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:19,611 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-18 19:05:19,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058916279] [2019-12-18 19:05:19,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:19,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:05:19,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445901280] [2019-12-18 19:05:19,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:05:19,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:19,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:05:19,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:05:19,643 INFO L87 Difference]: Start difference. First operand 83222 states. Second operand 3 states. [2019-12-18 19:05:20,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:20,540 INFO L93 Difference]: Finished difference Result 82272 states and 355122 transitions. [2019-12-18 19:05:20,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:05:20,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 19:05:20,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:23,613 INFO L225 Difference]: With dead ends: 82272 [2019-12-18 19:05:23,613 INFO L226 Difference]: Without dead ends: 77232 [2019-12-18 19:05:23,615 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-18 19:05:26,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77232 states. [2019-12-18 19:05:28,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77232 to 77232. [2019-12-18 19:05:28,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77232 states. [2019-12-18 19:05:29,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77232 states to 77232 states and 332862 transitions. [2019-12-18 19:05:29,101 INFO L78 Accepts]: Start accepts. Automaton has 77232 states and 332862 transitions. Word has length 5 [2019-12-18 19:05:29,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:29,101 INFO L462 AbstractCegarLoop]: Abstraction has 77232 states and 332862 transitions. [2019-12-18 19:05:29,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:05:29,101 INFO L276 IsEmpty]: Start isEmpty. Operand 77232 states and 332862 transitions. [2019-12-18 19:05:29,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:05:29,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:29,110 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:29,110 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:29,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:29,111 INFO L82 PathProgramCache]: Analyzing trace with hash -187432799, now seen corresponding path program 1 times [2019-12-18 19:05:29,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:29,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41750725] [2019-12-18 19:05:29,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:29,285 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-18 19:05:29,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41750725] [2019-12-18 19:05:29,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:29,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:05:29,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410356127] [2019-12-18 19:05:29,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:05:29,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:29,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:05:29,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:05:29,289 INFO L87 Difference]: Start difference. First operand 77232 states and 332862 transitions. Second operand 4 states. [2019-12-18 19:05:34,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:34,404 INFO L93 Difference]: Finished difference Result 119112 states and 491884 transitions. [2019-12-18 19:05:34,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:05:34,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 19:05:34,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:34,900 INFO L225 Difference]: With dead ends: 119112 [2019-12-18 19:05:34,900 INFO L226 Difference]: Without dead ends: 119007 [2019-12-18 19:05:34,904 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-18 19:05:37,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119007 states. [2019-12-18 19:05:40,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119007 to 111499. [2019-12-18 19:05:40,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111499 states. [2019-12-18 19:05:41,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111499 states to 111499 states and 464543 transitions. [2019-12-18 19:05:41,576 INFO L78 Accepts]: Start accepts. Automaton has 111499 states and 464543 transitions. Word has length 13 [2019-12-18 19:05:41,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:41,578 INFO L462 AbstractCegarLoop]: Abstraction has 111499 states and 464543 transitions. [2019-12-18 19:05:41,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:05:41,578 INFO L276 IsEmpty]: Start isEmpty. Operand 111499 states and 464543 transitions. [2019-12-18 19:05:41,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:05:41,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:41,582 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:41,583 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:41,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:41,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1509262706, now seen corresponding path program 1 times [2019-12-18 19:05:41,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:41,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90798150] [2019-12-18 19:05:41,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:41,631 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-18 19:05:41,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90798150] [2019-12-18 19:05:41,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:41,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:05:41,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437513823] [2019-12-18 19:05:41,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:05:41,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:41,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:05:41,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:05:41,633 INFO L87 Difference]: Start difference. First operand 111499 states and 464543 transitions. Second operand 3 states. [2019-12-18 19:05:41,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:41,755 INFO L93 Difference]: Finished difference Result 27724 states and 93399 transitions. [2019-12-18 19:05:41,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:05:41,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 19:05:41,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:41,804 INFO L225 Difference]: With dead ends: 27724 [2019-12-18 19:05:41,805 INFO L226 Difference]: Without dead ends: 27724 [2019-12-18 19:05:41,806 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-18 19:05:41,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27724 states. [2019-12-18 19:05:42,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27724 to 27724. [2019-12-18 19:05:42,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27724 states. [2019-12-18 19:05:42,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27724 states to 27724 states and 93399 transitions. [2019-12-18 19:05:42,347 INFO L78 Accepts]: Start accepts. Automaton has 27724 states and 93399 transitions. Word has length 13 [2019-12-18 19:05:42,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:42,348 INFO L462 AbstractCegarLoop]: Abstraction has 27724 states and 93399 transitions. [2019-12-18 19:05:42,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:05:42,348 INFO L276 IsEmpty]: Start isEmpty. Operand 27724 states and 93399 transitions. [2019-12-18 19:05:42,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 19:05:42,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:42,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:42,350 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:42,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:42,350 INFO L82 PathProgramCache]: Analyzing trace with hash 2053226586, now seen corresponding path program 1 times [2019-12-18 19:05:42,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:42,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960454276] [2019-12-18 19:05:42,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:42,458 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-18 19:05:42,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960454276] [2019-12-18 19:05:42,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:42,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:05:42,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358739170] [2019-12-18 19:05:42,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:05:42,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:42,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:05:42,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:05:42,461 INFO L87 Difference]: Start difference. First operand 27724 states and 93399 transitions. Second operand 5 states. [2019-12-18 19:05:42,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:42,978 INFO L93 Difference]: Finished difference Result 40807 states and 134933 transitions. [2019-12-18 19:05:42,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:05:42,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 19:05:42,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:43,049 INFO L225 Difference]: With dead ends: 40807 [2019-12-18 19:05:43,049 INFO L226 Difference]: Without dead ends: 40789 [2019-12-18 19:05:43,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:05:43,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40789 states. [2019-12-18 19:05:45,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40789 to 32055. [2019-12-18 19:05:45,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32055 states. [2019-12-18 19:05:45,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32055 states to 32055 states and 107275 transitions. [2019-12-18 19:05:45,706 INFO L78 Accepts]: Start accepts. Automaton has 32055 states and 107275 transitions. Word has length 14 [2019-12-18 19:05:45,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:45,706 INFO L462 AbstractCegarLoop]: Abstraction has 32055 states and 107275 transitions. [2019-12-18 19:05:45,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:05:45,706 INFO L276 IsEmpty]: Start isEmpty. Operand 32055 states and 107275 transitions. [2019-12-18 19:05:45,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:05:45,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:45,717 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:45,717 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:45,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:45,718 INFO L82 PathProgramCache]: Analyzing trace with hash 112714396, now seen corresponding path program 1 times [2019-12-18 19:05:45,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:45,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821680835] [2019-12-18 19:05:45,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:45,864 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-18 19:05:45,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821680835] [2019-12-18 19:05:45,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:45,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:05:45,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708346367] [2019-12-18 19:05:45,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:05:45,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:45,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:05:45,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:05:45,866 INFO L87 Difference]: Start difference. First operand 32055 states and 107275 transitions. Second operand 6 states. [2019-12-18 19:05:46,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:46,591 INFO L93 Difference]: Finished difference Result 51183 states and 167445 transitions. [2019-12-18 19:05:46,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 19:05:46,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 19:05:46,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:46,682 INFO L225 Difference]: With dead ends: 51183 [2019-12-18 19:05:46,682 INFO L226 Difference]: Without dead ends: 51153 [2019-12-18 19:05:46,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:05:46,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51153 states. [2019-12-18 19:05:47,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51153 to 34768. [2019-12-18 19:05:47,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34768 states. [2019-12-18 19:05:47,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34768 states to 34768 states and 115556 transitions. [2019-12-18 19:05:47,825 INFO L78 Accepts]: Start accepts. Automaton has 34768 states and 115556 transitions. Word has length 22 [2019-12-18 19:05:47,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:47,825 INFO L462 AbstractCegarLoop]: Abstraction has 34768 states and 115556 transitions. [2019-12-18 19:05:47,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:05:47,825 INFO L276 IsEmpty]: Start isEmpty. Operand 34768 states and 115556 transitions. [2019-12-18 19:05:47,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:05:47,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:47,835 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:47,836 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:47,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:47,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1117346120, now seen corresponding path program 1 times [2019-12-18 19:05:47,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:47,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820926957] [2019-12-18 19:05:47,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:47,926 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-18 19:05:47,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820926957] [2019-12-18 19:05:47,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:47,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:05:47,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551336618] [2019-12-18 19:05:47,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:05:47,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:47,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:05:47,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:05:47,929 INFO L87 Difference]: Start difference. First operand 34768 states and 115556 transitions. Second operand 6 states. [2019-12-18 19:05:48,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:48,757 INFO L93 Difference]: Finished difference Result 51553 states and 167314 transitions. [2019-12-18 19:05:48,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:05:48,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 19:05:48,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:48,848 INFO L225 Difference]: With dead ends: 51553 [2019-12-18 19:05:48,849 INFO L226 Difference]: Without dead ends: 51523 [2019-12-18 19:05:48,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:05:49,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51523 states. [2019-12-18 19:05:49,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51523 to 36074. [2019-12-18 19:05:49,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36074 states. [2019-12-18 19:05:49,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36074 states to 36074 states and 118567 transitions. [2019-12-18 19:05:49,597 INFO L78 Accepts]: Start accepts. Automaton has 36074 states and 118567 transitions. Word has length 22 [2019-12-18 19:05:49,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:49,598 INFO L462 AbstractCegarLoop]: Abstraction has 36074 states and 118567 transitions. [2019-12-18 19:05:49,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:05:49,598 INFO L276 IsEmpty]: Start isEmpty. Operand 36074 states and 118567 transitions. [2019-12-18 19:05:49,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:05:49,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:49,610 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] [2019-12-18 19:05:49,610 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:49,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:49,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1691433742, now seen corresponding path program 1 times [2019-12-18 19:05:49,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:49,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259573613] [2019-12-18 19:05:49,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:49,660 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-18 19:05:49,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259573613] [2019-12-18 19:05:49,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:49,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:05:49,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943148541] [2019-12-18 19:05:49,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:05:49,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:49,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:05:49,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:05:49,662 INFO L87 Difference]: Start difference. First operand 36074 states and 118567 transitions. Second operand 4 states. [2019-12-18 19:05:49,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:49,735 INFO L93 Difference]: Finished difference Result 14149 states and 43172 transitions. [2019-12-18 19:05:49,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 19:05:49,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 19:05:49,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:49,758 INFO L225 Difference]: With dead ends: 14149 [2019-12-18 19:05:49,758 INFO L226 Difference]: Without dead ends: 14149 [2019-12-18 19:05:49,758 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-18 19:05:49,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14149 states. [2019-12-18 19:05:49,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14149 to 13955. [2019-12-18 19:05:49,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13955 states. [2019-12-18 19:05:49,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13955 states to 13955 states and 42611 transitions. [2019-12-18 19:05:49,962 INFO L78 Accepts]: Start accepts. Automaton has 13955 states and 42611 transitions. Word has length 25 [2019-12-18 19:05:49,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:49,963 INFO L462 AbstractCegarLoop]: Abstraction has 13955 states and 42611 transitions. [2019-12-18 19:05:49,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:05:49,963 INFO L276 IsEmpty]: Start isEmpty. Operand 13955 states and 42611 transitions. [2019-12-18 19:05:49,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 19:05:49,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:49,983 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:49,983 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:49,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:49,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1334742722, now seen corresponding path program 1 times [2019-12-18 19:05:49,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:49,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137715114] [2019-12-18 19:05:49,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:50,050 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-18 19:05:50,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137715114] [2019-12-18 19:05:50,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:50,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:05:50,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494684832] [2019-12-18 19:05:50,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:05:50,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:50,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:05:50,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:05:50,052 INFO L87 Difference]: Start difference. First operand 13955 states and 42611 transitions. Second operand 3 states. [2019-12-18 19:05:50,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:50,134 INFO L93 Difference]: Finished difference Result 25821 states and 78709 transitions. [2019-12-18 19:05:50,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:05:50,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 19:05:50,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:50,159 INFO L225 Difference]: With dead ends: 25821 [2019-12-18 19:05:50,160 INFO L226 Difference]: Without dead ends: 14420 [2019-12-18 19:05:50,160 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-18 19:05:50,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14420 states. [2019-12-18 19:05:50,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14420 to 14287. [2019-12-18 19:05:50,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14287 states. [2019-12-18 19:05:50,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14287 states to 14287 states and 42676 transitions. [2019-12-18 19:05:50,600 INFO L78 Accepts]: Start accepts. Automaton has 14287 states and 42676 transitions. Word has length 39 [2019-12-18 19:05:50,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:50,600 INFO L462 AbstractCegarLoop]: Abstraction has 14287 states and 42676 transitions. [2019-12-18 19:05:50,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:05:50,600 INFO L276 IsEmpty]: Start isEmpty. Operand 14287 states and 42676 transitions. [2019-12-18 19:05:50,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 19:05:50,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:50,622 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:50,622 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:50,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:50,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1169825091, now seen corresponding path program 1 times [2019-12-18 19:05:50,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:50,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576039619] [2019-12-18 19:05:50,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:50,680 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-18 19:05:50,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576039619] [2019-12-18 19:05:50,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:50,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:05:50,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660086570] [2019-12-18 19:05:50,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:05:50,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:50,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:05:50,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:05:50,682 INFO L87 Difference]: Start difference. First operand 14287 states and 42676 transitions. Second operand 5 states. [2019-12-18 19:05:50,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:50,756 INFO L93 Difference]: Finished difference Result 12923 states and 39241 transitions. [2019-12-18 19:05:50,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:05:50,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 19:05:50,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:50,772 INFO L225 Difference]: With dead ends: 12923 [2019-12-18 19:05:50,772 INFO L226 Difference]: Without dead ends: 10951 [2019-12-18 19:05:50,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:05:50,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10951 states. [2019-12-18 19:05:50,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10951 to 10573. [2019-12-18 19:05:50,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10573 states. [2019-12-18 19:05:50,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10573 states to 10573 states and 32791 transitions. [2019-12-18 19:05:50,942 INFO L78 Accepts]: Start accepts. Automaton has 10573 states and 32791 transitions. Word has length 40 [2019-12-18 19:05:50,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:50,943 INFO L462 AbstractCegarLoop]: Abstraction has 10573 states and 32791 transitions. [2019-12-18 19:05:50,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:05:50,943 INFO L276 IsEmpty]: Start isEmpty. Operand 10573 states and 32791 transitions. [2019-12-18 19:05:50,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:05:50,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:50,958 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:05:50,958 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:50,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:50,959 INFO L82 PathProgramCache]: Analyzing trace with hash 917917389, now seen corresponding path program 1 times [2019-12-18 19:05:50,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:50,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715914635] [2019-12-18 19:05:50,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:51,019 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-18 19:05:51,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715914635] [2019-12-18 19:05:51,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:51,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:05:51,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752493417] [2019-12-18 19:05:51,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:05:51,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:51,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:05:51,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:05:51,022 INFO L87 Difference]: Start difference. First operand 10573 states and 32791 transitions. Second operand 3 states. [2019-12-18 19:05:51,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:51,111 INFO L93 Difference]: Finished difference Result 14303 states and 43654 transitions. [2019-12-18 19:05:51,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:05:51,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 19:05:51,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:51,136 INFO L225 Difference]: With dead ends: 14303 [2019-12-18 19:05:51,137 INFO L226 Difference]: Without dead ends: 14303 [2019-12-18 19:05:51,137 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-18 19:05:51,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14303 states. [2019-12-18 19:05:51,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14303 to 11263. [2019-12-18 19:05:51,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11263 states. [2019-12-18 19:05:51,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11263 states to 11263 states and 34861 transitions. [2019-12-18 19:05:51,421 INFO L78 Accepts]: Start accepts. Automaton has 11263 states and 34861 transitions. Word has length 54 [2019-12-18 19:05:51,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:51,422 INFO L462 AbstractCegarLoop]: Abstraction has 11263 states and 34861 transitions. [2019-12-18 19:05:51,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:05:51,422 INFO L276 IsEmpty]: Start isEmpty. Operand 11263 states and 34861 transitions. [2019-12-18 19:05:51,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:05:51,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:51,443 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-18 19:05:51,443 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:51,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:51,443 INFO L82 PathProgramCache]: Analyzing trace with hash 2132180587, now seen corresponding path program 1 times [2019-12-18 19:05:51,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:51,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837683215] [2019-12-18 19:05:51,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:51,518 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-18 19:05:51,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837683215] [2019-12-18 19:05:51,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:51,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:05:51,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463137661] [2019-12-18 19:05:51,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:05:51,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:51,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:05:51,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:05:51,520 INFO L87 Difference]: Start difference. First operand 11263 states and 34861 transitions. Second operand 6 states. [2019-12-18 19:05:51,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:51,857 INFO L93 Difference]: Finished difference Result 33207 states and 101689 transitions. [2019-12-18 19:05:51,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 19:05:51,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-18 19:05:51,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:51,890 INFO L225 Difference]: With dead ends: 33207 [2019-12-18 19:05:51,890 INFO L226 Difference]: Without dead ends: 23787 [2019-12-18 19:05:51,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:05:51,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23787 states. [2019-12-18 19:05:52,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23787 to 13957. [2019-12-18 19:05:52,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13957 states. [2019-12-18 19:05:52,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13957 states to 13957 states and 43447 transitions. [2019-12-18 19:05:52,186 INFO L78 Accepts]: Start accepts. Automaton has 13957 states and 43447 transitions. Word has length 54 [2019-12-18 19:05:52,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:52,186 INFO L462 AbstractCegarLoop]: Abstraction has 13957 states and 43447 transitions. [2019-12-18 19:05:52,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:05:52,186 INFO L276 IsEmpty]: Start isEmpty. Operand 13957 states and 43447 transitions. [2019-12-18 19:05:52,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:05:52,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:52,202 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-18 19:05:52,202 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:52,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:52,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1318577837, now seen corresponding path program 2 times [2019-12-18 19:05:52,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:52,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073808599] [2019-12-18 19:05:52,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:52,301 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-18 19:05:52,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073808599] [2019-12-18 19:05:52,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:52,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 19:05:52,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167823953] [2019-12-18 19:05:52,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:05:52,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:52,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:05:52,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:05:52,304 INFO L87 Difference]: Start difference. First operand 13957 states and 43447 transitions. Second operand 7 states. [2019-12-18 19:05:52,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:52,763 INFO L93 Difference]: Finished difference Result 33199 states and 101841 transitions. [2019-12-18 19:05:52,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:05:52,763 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 19:05:52,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:52,809 INFO L225 Difference]: With dead ends: 33199 [2019-12-18 19:05:52,810 INFO L226 Difference]: Without dead ends: 25551 [2019-12-18 19:05:52,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:05:52,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25551 states. [2019-12-18 19:05:53,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25551 to 16624. [2019-12-18 19:05:53,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16624 states. [2019-12-18 19:05:53,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16624 states to 16624 states and 51830 transitions. [2019-12-18 19:05:53,311 INFO L78 Accepts]: Start accepts. Automaton has 16624 states and 51830 transitions. Word has length 54 [2019-12-18 19:05:53,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:53,311 INFO L462 AbstractCegarLoop]: Abstraction has 16624 states and 51830 transitions. [2019-12-18 19:05:53,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:05:53,311 INFO L276 IsEmpty]: Start isEmpty. Operand 16624 states and 51830 transitions. [2019-12-18 19:05:53,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:05:53,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:53,329 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-18 19:05:53,329 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:53,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:53,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1742027941, now seen corresponding path program 3 times [2019-12-18 19:05:53,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:53,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452385159] [2019-12-18 19:05:53,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:53,411 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-18 19:05:53,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452385159] [2019-12-18 19:05:53,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:53,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 19:05:53,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297644278] [2019-12-18 19:05:53,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:05:53,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:53,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:05:53,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:05:53,415 INFO L87 Difference]: Start difference. First operand 16624 states and 51830 transitions. Second operand 7 states. [2019-12-18 19:05:53,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:53,849 INFO L93 Difference]: Finished difference Result 29813 states and 90433 transitions. [2019-12-18 19:05:53,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 19:05:53,849 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 19:05:53,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:53,889 INFO L225 Difference]: With dead ends: 29813 [2019-12-18 19:05:53,889 INFO L226 Difference]: Without dead ends: 27722 [2019-12-18 19:05:53,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:05:53,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27722 states. [2019-12-18 19:05:54,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27722 to 16706. [2019-12-18 19:05:54,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16706 states. [2019-12-18 19:05:54,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16706 states to 16706 states and 52124 transitions. [2019-12-18 19:05:54,232 INFO L78 Accepts]: Start accepts. Automaton has 16706 states and 52124 transitions. Word has length 54 [2019-12-18 19:05:54,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:54,233 INFO L462 AbstractCegarLoop]: Abstraction has 16706 states and 52124 transitions. [2019-12-18 19:05:54,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:05:54,233 INFO L276 IsEmpty]: Start isEmpty. Operand 16706 states and 52124 transitions. [2019-12-18 19:05:54,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:05:54,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:54,256 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-18 19:05:54,256 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:54,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:54,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1733304659, now seen corresponding path program 1 times [2019-12-18 19:05:54,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:54,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108911251] [2019-12-18 19:05:54,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:54,303 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-18 19:05:54,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108911251] [2019-12-18 19:05:54,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:54,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:05:54,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403402250] [2019-12-18 19:05:54,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:05:54,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:54,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:05:54,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:05:54,305 INFO L87 Difference]: Start difference. First operand 16706 states and 52124 transitions. Second operand 3 states. [2019-12-18 19:05:54,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:54,402 INFO L93 Difference]: Finished difference Result 18535 states and 56308 transitions. [2019-12-18 19:05:54,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:05:54,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 19:05:54,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:54,436 INFO L225 Difference]: With dead ends: 18535 [2019-12-18 19:05:54,436 INFO L226 Difference]: Without dead ends: 18535 [2019-12-18 19:05:54,436 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-18 19:05:54,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18535 states. [2019-12-18 19:05:54,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18535 to 15978. [2019-12-18 19:05:54,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15978 states. [2019-12-18 19:05:54,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15978 states to 15978 states and 49163 transitions. [2019-12-18 19:05:54,727 INFO L78 Accepts]: Start accepts. Automaton has 15978 states and 49163 transitions. Word has length 54 [2019-12-18 19:05:54,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:54,728 INFO L462 AbstractCegarLoop]: Abstraction has 15978 states and 49163 transitions. [2019-12-18 19:05:54,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:05:54,728 INFO L276 IsEmpty]: Start isEmpty. Operand 15978 states and 49163 transitions. [2019-12-18 19:05:54,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:05:54,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:54,748 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-18 19:05:54,748 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:54,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:54,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1573799015, now seen corresponding path program 4 times [2019-12-18 19:05:54,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:54,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845122678] [2019-12-18 19:05:54,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:54,824 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-18 19:05:54,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845122678] [2019-12-18 19:05:54,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:54,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 19:05:54,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146872285] [2019-12-18 19:05:54,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:05:54,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:54,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:05:54,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:05:54,826 INFO L87 Difference]: Start difference. First operand 15978 states and 49163 transitions. Second operand 7 states. [2019-12-18 19:05:55,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:55,185 INFO L93 Difference]: Finished difference Result 31956 states and 95510 transitions. [2019-12-18 19:05:55,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 19:05:55,186 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 19:05:55,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:55,227 INFO L225 Difference]: With dead ends: 31956 [2019-12-18 19:05:55,228 INFO L226 Difference]: Without dead ends: 26966 [2019-12-18 19:05:55,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 19:05:55,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26966 states. [2019-12-18 19:05:55,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26966 to 16134. [2019-12-18 19:05:55,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16134 states. [2019-12-18 19:05:55,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16134 states to 16134 states and 49593 transitions. [2019-12-18 19:05:55,567 INFO L78 Accepts]: Start accepts. Automaton has 16134 states and 49593 transitions. Word has length 54 [2019-12-18 19:05:55,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:55,567 INFO L462 AbstractCegarLoop]: Abstraction has 16134 states and 49593 transitions. [2019-12-18 19:05:55,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:05:55,567 INFO L276 IsEmpty]: Start isEmpty. Operand 16134 states and 49593 transitions. [2019-12-18 19:05:55,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:05:55,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:55,583 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-18 19:05:55,583 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:55,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:55,583 INFO L82 PathProgramCache]: Analyzing trace with hash 721174547, now seen corresponding path program 5 times [2019-12-18 19:05:55,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:55,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438257099] [2019-12-18 19:05:55,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:55,650 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-18 19:05:55,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438257099] [2019-12-18 19:05:55,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:55,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:05:55,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85887792] [2019-12-18 19:05:55,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:05:55,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:55,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:05:55,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:05:55,652 INFO L87 Difference]: Start difference. First operand 16134 states and 49593 transitions. Second operand 3 states. [2019-12-18 19:05:55,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:55,714 INFO L93 Difference]: Finished difference Result 12976 states and 38987 transitions. [2019-12-18 19:05:55,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:05:55,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 19:05:55,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:55,738 INFO L225 Difference]: With dead ends: 12976 [2019-12-18 19:05:55,738 INFO L226 Difference]: Without dead ends: 12976 [2019-12-18 19:05:55,739 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-18 19:05:55,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12976 states. [2019-12-18 19:05:56,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12976 to 12502. [2019-12-18 19:05:56,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12502 states. [2019-12-18 19:05:56,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12502 states to 12502 states and 37525 transitions. [2019-12-18 19:05:56,187 INFO L78 Accepts]: Start accepts. Automaton has 12502 states and 37525 transitions. Word has length 54 [2019-12-18 19:05:56,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:56,188 INFO L462 AbstractCegarLoop]: Abstraction has 12502 states and 37525 transitions. [2019-12-18 19:05:56,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:05:56,188 INFO L276 IsEmpty]: Start isEmpty. Operand 12502 states and 37525 transitions. [2019-12-18 19:05:56,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 19:05:56,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:56,214 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:56,214 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:56,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:56,215 INFO L82 PathProgramCache]: Analyzing trace with hash 262840158, now seen corresponding path program 1 times [2019-12-18 19:05:56,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:56,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540780495] [2019-12-18 19:05:56,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:56,333 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-18 19:05:56,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540780495] [2019-12-18 19:05:56,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:56,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:05:56,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980838535] [2019-12-18 19:05:56,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:05:56,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:56,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:05:56,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:05:56,336 INFO L87 Difference]: Start difference. First operand 12502 states and 37525 transitions. Second operand 3 states. [2019-12-18 19:05:56,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:56,391 INFO L93 Difference]: Finished difference Result 12502 states and 37523 transitions. [2019-12-18 19:05:56,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:05:56,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 19:05:56,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:56,416 INFO L225 Difference]: With dead ends: 12502 [2019-12-18 19:05:56,416 INFO L226 Difference]: Without dead ends: 12502 [2019-12-18 19:05:56,417 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-18 19:05:56,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12502 states. [2019-12-18 19:05:56,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12502 to 10981. [2019-12-18 19:05:56,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10981 states. [2019-12-18 19:05:56,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10981 states to 10981 states and 33292 transitions. [2019-12-18 19:05:56,667 INFO L78 Accepts]: Start accepts. Automaton has 10981 states and 33292 transitions. Word has length 55 [2019-12-18 19:05:56,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:56,668 INFO L462 AbstractCegarLoop]: Abstraction has 10981 states and 33292 transitions. [2019-12-18 19:05:56,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:05:56,668 INFO L276 IsEmpty]: Start isEmpty. Operand 10981 states and 33292 transitions. [2019-12-18 19:05:56,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 19:05:56,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:56,682 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:56,682 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:56,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:56,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1377038518, now seen corresponding path program 1 times [2019-12-18 19:05:56,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:56,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989276851] [2019-12-18 19:05:56,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:05:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:05:56,843 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:05:56,843 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:05:56,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x~0_189) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2513~0.base_30| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2513~0.base_30|) |v_ULTIMATE.start_main_~#t2513~0.offset_17| 0)) |v_#memory_int_21|) (= v_~main$tmp_guard0~0_19 0) (= 0 v_~x$w_buff0~0_458) (= 0 v_~x$w_buff1~0_338) (= v_~main$tmp_guard1~0_59 0) (< 0 |v_#StackHeapBarrier_17|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2513~0.base_30|) 0) (= v_~x$mem_tmp~0_36 0) (= 0 v_~__unbuffered_p0_EAX~0_70) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2513~0.base_30| 4)) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2513~0.base_30|) (= 0 v_~weak$$choice0~0_29) (= 0 v_~x$read_delayed~0_6) (= v_~__unbuffered_cnt~0_127 0) (= 0 v_~x$r_buff1_thd2~0_267) (= 0 v_~x$w_buff0_used~0_920) (= (store .cse0 |v_ULTIMATE.start_main_~#t2513~0.base_30| 1) |v_#valid_76|) (= 0 v_~x$w_buff1_used~0_659) (= 0 v_~x$r_buff0_thd2~0_309) (= 0 v_~x$r_buff1_thd3~0_288) (= v_~x$r_buff1_thd1~0_390 0) (= v_~y~0_272 0) (= v_~weak$$choice2~0_165 0) (= 0 v_~x$r_buff0_thd3~0_149) (= v_~x$r_buff0_thd1~0_356 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_94 0) (= v_~x$flush_delayed~0_66 0) (= 0 |v_ULTIMATE.start_main_~#t2513~0.offset_17|) (= 0 |v_#NULL.base_5|) (= v_~x$r_buff0_thd0~0_158 0) (= v_~x$r_buff1_thd0~0_324 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_458, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_356, ~x$flush_delayed~0=v_~x$flush_delayed~0_66, ULTIMATE.start_main_~#t2513~0.base=|v_ULTIMATE.start_main_~#t2513~0.base_30|, ULTIMATE.start_main_~#t2513~0.offset=|v_ULTIMATE.start_main_~#t2513~0.offset_17|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_124|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_288, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_390, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_59, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_149, ~x$mem_tmp~0=v_~x$mem_tmp~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_226|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_70, ULTIMATE.start_main_~#t2515~0.base=|v_ULTIMATE.start_main_~#t2515~0.base_24|, #length=|v_#length_23|, ~y~0=v_~y~0_272, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_158, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_18|, ULTIMATE.start_main_~#t2514~0.offset=|v_ULTIMATE.start_main_~#t2514~0.offset_18|, ~x$w_buff1~0=v_~x$w_buff1~0_338, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_659, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_267, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_324, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_309, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_920, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t2515~0.offset=|v_ULTIMATE.start_main_~#t2515~0.offset_18|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_37|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_94, ~weak$$choice2~0=v_~weak$$choice2~0_165, ~x~0=v_~x~0_189, ULTIMATE.start_main_~#t2514~0.base=|v_ULTIMATE.start_main_~#t2514~0.base_24|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t2513~0.base, ULTIMATE.start_main_~#t2513~0.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2515~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2514~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2515~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ULTIMATE.start_main_~#t2514~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 19:05:56,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L816-1-->L818: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2514~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t2514~0.offset_11|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2514~0.base_13|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2514~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t2514~0.base_13| 0)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2514~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2514~0.base_13|) |v_ULTIMATE.start_main_~#t2514~0.offset_11| 1))) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2514~0.base_13| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2514~0.offset=|v_ULTIMATE.start_main_~#t2514~0.offset_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2514~0.base=|v_ULTIMATE.start_main_~#t2514~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2514~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2514~0.base] because there is no mapped edge [2019-12-18 19:05:56,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L5-->L773: Formula: (and (= v_~x$r_buff1_thd3~0_11 v_~x$r_buff0_thd3~0_15) (= 1 v_~x$r_buff0_thd2~0_17) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= 1 v_~y~0_6) (= v_~x$r_buff1_thd1~0_25 v_~x$r_buff0_thd1~0_43) (= v_~x$r_buff1_thd2~0_11 v_~x$r_buff0_thd2~0_18) (= v_~x$r_buff1_thd0~0_11 v_~x$r_buff0_thd0~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_18} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_11, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_11, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_17, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~x$r_buff1_thd3~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-18 19:05:56,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L818-1-->L820: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2515~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2515~0.base_13|) |v_ULTIMATE.start_main_~#t2515~0.offset_11| 2)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2515~0.base_13|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2515~0.base_13|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2515~0.base_13| 4)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t2515~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t2515~0.offset_11|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t2515~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t2515~0.offset=|v_ULTIMATE.start_main_~#t2515~0.offset_11|, ULTIMATE.start_main_~#t2515~0.base=|v_ULTIMATE.start_main_~#t2515~0.base_13|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2515~0.offset, ULTIMATE.start_main_~#t2515~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 19:05:56,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L793-2-->L793-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1600329948 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In1600329948 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out1600329948| ~x$w_buff1~0_In1600329948) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out1600329948| ~x~0_In1600329948)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1600329948, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1600329948, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1600329948, ~x~0=~x~0_In1600329948} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1600329948|, ~x$w_buff1~0=~x$w_buff1~0_In1600329948, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1600329948, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1600329948, ~x~0=~x~0_In1600329948} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 19:05:56,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L793-4-->L794: Formula: (= v_~x~0_67 |v_P2Thread1of1ForFork1_#t~ite32_24|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_24|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_23|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_39|, ~x~0=v_~x~0_67} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 19:05:56,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L794-->L794-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In1812109390 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1812109390 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out1812109390|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In1812109390 |P2Thread1of1ForFork1_#t~ite34_Out1812109390|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1812109390, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1812109390} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1812109390|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1812109390, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1812109390} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 19:05:56,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L795-->L795-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In1160157701 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1160157701 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1160157701 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In1160157701 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out1160157701|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In1160157701 |P2Thread1of1ForFork1_#t~ite35_Out1160157701|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1160157701, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1160157701, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1160157701, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1160157701} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out1160157701|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1160157701, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1160157701, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1160157701, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1160157701} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 19:05:56,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In2042465828 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In2042465828 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out2042465828| ~x$r_buff0_thd3~0_In2042465828) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out2042465828| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2042465828, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2042465828} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out2042465828|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2042465828, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2042465828} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 19:05:56,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In473419519 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In473419519 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In473419519 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In473419519 256) 0))) (or (and (= ~x$r_buff1_thd3~0_In473419519 |P2Thread1of1ForFork1_#t~ite37_Out473419519|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out473419519|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In473419519, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In473419519, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In473419519, ~x$w_buff0_used~0=~x$w_buff0_used~0_In473419519} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out473419519|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In473419519, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In473419519, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In473419519, ~x$w_buff0_used~0=~x$w_buff0_used~0_In473419519} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 19:05:56,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L797-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_57 |v_P2Thread1of1ForFork1_#t~ite37_36|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_35|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 19:05:56,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L739-->L739-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In242362671 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite12_Out242362671| ~x$w_buff1~0_In242362671) (= |P0Thread1of1ForFork2_#t~ite11_In242362671| |P0Thread1of1ForFork2_#t~ite11_Out242362671|) (not .cse0)) (and (= |P0Thread1of1ForFork2_#t~ite11_Out242362671| ~x$w_buff1~0_In242362671) (= |P0Thread1of1ForFork2_#t~ite12_Out242362671| |P0Thread1of1ForFork2_#t~ite11_Out242362671|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In242362671 256)))) (or (and .cse1 (= (mod ~x$r_buff1_thd1~0_In242362671 256) 0)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In242362671 256))) (= 0 (mod ~x$w_buff0_used~0_In242362671 256))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In242362671, ~x$w_buff1~0=~x$w_buff1~0_In242362671, ~x$w_buff1_used~0=~x$w_buff1_used~0_In242362671, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In242362671, ~weak$$choice2~0=~weak$$choice2~0_In242362671, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In242362671|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In242362671} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In242362671, ~x$w_buff1~0=~x$w_buff1~0_In242362671, ~x$w_buff1_used~0=~x$w_buff1_used~0_In242362671, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In242362671, ~weak$$choice2~0=~weak$$choice2~0_In242362671, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out242362671|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out242362671|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In242362671} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 19:05:56,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L740-->L740-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In143143948 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In143143948 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In143143948 256)) (and .cse0 (= (mod ~x$r_buff1_thd1~0_In143143948 256) 0)) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In143143948 256))))) (= ~x$w_buff0_used~0_In143143948 |P0Thread1of1ForFork2_#t~ite14_Out143143948|) .cse1 (= |P0Thread1of1ForFork2_#t~ite15_Out143143948| |P0Thread1of1ForFork2_#t~ite14_Out143143948|)) (and (= ~x$w_buff0_used~0_In143143948 |P0Thread1of1ForFork2_#t~ite15_Out143143948|) (= |P0Thread1of1ForFork2_#t~ite14_In143143948| |P0Thread1of1ForFork2_#t~ite14_Out143143948|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In143143948, ~x$w_buff1_used~0=~x$w_buff1_used~0_In143143948, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In143143948, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In143143948|, ~weak$$choice2~0=~weak$$choice2~0_In143143948, ~x$w_buff0_used~0=~x$w_buff0_used~0_In143143948} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In143143948, ~x$w_buff1_used~0=~x$w_buff1_used~0_In143143948, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out143143948|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In143143948, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out143143948|, ~weak$$choice2~0=~weak$$choice2~0_In143143948, ~x$w_buff0_used~0=~x$w_buff0_used~0_In143143948} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 19:05:56,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_11|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_29, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 19:05:56,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1468814528 256)))) (or (and (= ~x$r_buff1_thd1~0_In1468814528 |P0Thread1of1ForFork2_#t~ite24_Out1468814528|) (= |P0Thread1of1ForFork2_#t~ite23_In1468814528| |P0Thread1of1ForFork2_#t~ite23_Out1468814528|) (not .cse0)) (and .cse0 (= ~x$r_buff1_thd1~0_In1468814528 |P0Thread1of1ForFork2_#t~ite23_Out1468814528|) (= |P0Thread1of1ForFork2_#t~ite23_Out1468814528| |P0Thread1of1ForFork2_#t~ite24_Out1468814528|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1468814528 256) 0))) (or (and (= (mod ~x$r_buff1_thd1~0_In1468814528 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In1468814528 256) 0) (and (= 0 (mod ~x$w_buff1_used~0_In1468814528 256)) .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1468814528, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1468814528, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1468814528, ~weak$$choice2~0=~weak$$choice2~0_In1468814528, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In1468814528|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1468814528} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1468814528, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1468814528, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1468814528, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out1468814528|, ~weak$$choice2~0=~weak$$choice2~0_In1468814528, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out1468814528|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1468814528} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-18 19:05:56,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_5 v_~x~0_24) (not (= (mod v_~x$flush_delayed~0_9 256) 0)) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_11|, ~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 19:05:56,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In732211040 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In732211040 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out732211040|) (not .cse1)) (and (= ~x$w_buff0_used~0_In732211040 |P1Thread1of1ForFork0_#t~ite28_Out732211040|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In732211040, ~x$w_buff0_used~0=~x$w_buff0_used~0_In732211040} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In732211040, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out732211040|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In732211040} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 19:05:56,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L775-->L775-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In-1052693782 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1052693782 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-1052693782 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1052693782 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out-1052693782| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out-1052693782| ~x$w_buff1_used~0_In-1052693782)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1052693782, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1052693782, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1052693782, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1052693782} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1052693782, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1052693782, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1052693782, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1052693782|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1052693782} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 19:05:56,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L776-->L777: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In469025553 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In469025553 256)))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out469025553 0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In469025553 ~x$r_buff0_thd2~0_Out469025553)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In469025553, ~x$w_buff0_used~0=~x$w_buff0_used~0_In469025553} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out469025553|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out469025553, ~x$w_buff0_used~0=~x$w_buff0_used~0_In469025553} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 19:05:56,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In1437229049 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1437229049 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1437229049 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1437229049 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out1437229049| ~x$r_buff1_thd2~0_In1437229049)) (and (= |P1Thread1of1ForFork0_#t~ite31_Out1437229049| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1437229049, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1437229049, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1437229049, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1437229049} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1437229049|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1437229049, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1437229049, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1437229049, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1437229049} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 19:05:56,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L777-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_67 |v_P1Thread1of1ForFork0_#t~ite31_40|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_39|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_67, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 19:05:56,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L820-1-->L826: Formula: (and (= 3 v_~__unbuffered_cnt~0_29) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 19:05:56,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L826-2-->L826-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite41_Out1850123574| |ULTIMATE.start_main_#t~ite42_Out1850123574|)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In1850123574 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1850123574 256)))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite41_Out1850123574| ~x~0_In1850123574)) (and (= |ULTIMATE.start_main_#t~ite41_Out1850123574| ~x$w_buff1~0_In1850123574) .cse0 (not .cse2) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1850123574, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1850123574, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1850123574, ~x~0=~x~0_In1850123574} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1850123574|, ~x$w_buff1~0=~x$w_buff1~0_In1850123574, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1850123574, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1850123574, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1850123574|, ~x~0=~x~0_In1850123574} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 19:05:56,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L827-->L827-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1887293038 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1887293038 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1887293038 |ULTIMATE.start_main_#t~ite43_Out-1887293038|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-1887293038| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1887293038, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1887293038} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1887293038, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1887293038|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1887293038} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 19:05:56,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L828-->L828-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1154904419 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1154904419 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-1154904419 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1154904419 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1154904419| ~x$w_buff1_used~0_In-1154904419) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite44_Out-1154904419| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1154904419, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1154904419, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1154904419, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1154904419} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1154904419, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1154904419, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1154904419, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1154904419|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1154904419} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 19:05:56,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1881637170 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1881637170 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-1881637170 |ULTIMATE.start_main_#t~ite45_Out-1881637170|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1881637170|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1881637170, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1881637170} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1881637170, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1881637170|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1881637170} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 19:05:56,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L830-->L830-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In-538562724 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-538562724 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-538562724 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-538562724 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out-538562724| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite46_Out-538562724| ~x$r_buff1_thd0~0_In-538562724)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-538562724, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-538562724, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-538562724, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-538562724} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-538562724, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-538562724|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-538562724, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-538562724, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-538562724} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 19:05:56,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_18 0) (= v_~z~0_43 2) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9| (mod v_~main$tmp_guard1~0_18 256)) (= v_~y~0_108 2) (= 0 v_~__unbuffered_p0_EAX~0_24) (= v_~x$r_buff1_thd0~0_148 |v_ULTIMATE.start_main_#t~ite46_39|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_39|, ~z~0=v_~z~0_43, ~y~0=v_~y~0_108} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_38|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~z~0=v_~z~0_43, ~y~0=v_~y~0_108, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_148, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 19:05:56,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 07:05:56 BasicIcfg [2019-12-18 19:05:56,962 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 19:05:56,963 INFO L168 Benchmark]: Toolchain (without parser) took 56723.45 ms. Allocated memory was 146.3 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 103.2 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 821.8 MB. Max. memory is 7.1 GB. [2019-12-18 19:05:56,964 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 19:05:56,965 INFO L168 Benchmark]: CACSL2BoogieTranslator took 734.69 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.7 MB in the beginning and 156.1 MB in the end (delta: -53.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-18 19:05:56,965 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.40 ms. Allocated memory is still 203.9 MB. Free memory was 156.1 MB in the beginning and 153.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 19:05:56,966 INFO L168 Benchmark]: Boogie Preprocessor took 39.98 ms. Allocated memory is still 203.9 MB. Free memory was 153.3 MB in the beginning and 151.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 19:05:56,967 INFO L168 Benchmark]: RCFGBuilder took 813.36 ms. Allocated memory is still 203.9 MB. Free memory was 151.3 MB in the beginning and 104.6 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. [2019-12-18 19:05:56,967 INFO L168 Benchmark]: TraceAbstraction took 55068.83 ms. Allocated memory was 203.9 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 103.9 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 764.8 MB. Max. memory is 7.1 GB. [2019-12-18 19:05:56,971 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.49 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 734.69 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.7 MB in the beginning and 156.1 MB in the end (delta: -53.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.40 ms. Allocated memory is still 203.9 MB. Free memory was 156.1 MB in the beginning and 153.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.98 ms. Allocated memory is still 203.9 MB. Free memory was 153.3 MB in the beginning and 151.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 813.36 ms. Allocated memory is still 203.9 MB. Free memory was 151.3 MB in the beginning and 104.6 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 55068.83 ms. Allocated memory was 203.9 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 103.9 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 764.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 6611 VarBasedMoverChecksPositive, 290 VarBasedMoverChecksNegative, 125 SemBasedMoverChecksPositive, 244 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 64880 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t2513, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L818] FCALL, FORK 0 pthread_create(&t2514, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L820] FCALL, FORK 0 pthread_create(&t2515, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0: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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L787] 3 y = 2 [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L793] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L728] 1 z = 2 [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L737] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L737] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L738] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L773] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L738] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L740] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L741] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L773] 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) [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L775] 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 [L826] EXPR 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=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 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 [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 54.7s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 14.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3034 SDtfs, 2779 SDslu, 6644 SDs, 0 SdLazy, 2223 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111499occurred 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: 20.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 96978 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 682 NumberOfCodeBlocks, 682 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 609 ConstructedInterpolants, 0 QuantifiedInterpolants, 108750 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...