/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:23:35,907 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:23:35,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:23:35,930 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:23:35,930 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:23:35,932 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:23:35,934 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:23:35,947 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:23:35,949 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:23:35,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:23:35,953 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:23:35,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:23:35,955 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:23:35,958 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:23:35,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:23:35,963 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:23:35,964 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:23:35,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:23:35,970 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:23:35,976 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:23:35,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:23:35,983 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:23:35,985 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:23:35,986 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:23:35,988 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:23:35,988 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:23:35,989 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:23:35,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:23:35,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:23:35,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:23:35,994 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:23:35,996 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:23:35,997 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:23:35,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:23:36,000 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:23:36,000 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:23:36,002 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:23:36,002 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:23:36,002 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:23:36,004 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:23:36,005 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:23:36,006 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 22:23:36,026 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:23:36,027 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:23:36,028 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:23:36,028 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:23:36,028 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:23:36,029 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:23:36,029 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:23:36,029 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:23:36,029 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:23:36,029 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:23:36,030 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:23:36,030 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:23:36,030 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:23:36,030 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:23:36,030 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:23:36,031 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:23:36,031 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:23:36,031 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:23:36,031 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:23:36,032 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:23:36,032 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:23:36,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:23:36,032 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:23:36,033 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:23:36,033 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:23:36,033 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:23:36,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:23:36,033 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:23:36,034 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:23:36,034 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:23:36,034 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:23:36,034 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:23:36,307 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:23:36,320 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:23:36,324 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:23:36,325 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:23:36,326 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:23:36,326 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i [2019-12-27 22:23:36,395 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da4fbaece/ab31528c820b46f494cec5db02677a75/FLAG748ee7bd4 [2019-12-27 22:23:36,985 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:23:36,986 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i [2019-12-27 22:23:37,010 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da4fbaece/ab31528c820b46f494cec5db02677a75/FLAG748ee7bd4 [2019-12-27 22:23:37,197 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da4fbaece/ab31528c820b46f494cec5db02677a75 [2019-12-27 22:23:37,207 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:23:37,209 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:23:37,211 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:23:37,211 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:23:37,214 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:23:37,215 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:23:37" (1/1) ... [2019-12-27 22:23:37,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6943ffe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:37, skipping insertion in model container [2019-12-27 22:23:37,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:23:37" (1/1) ... [2019-12-27 22:23:37,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:23:37,285 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:23:37,806 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:23:37,819 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:23:37,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:23:37,983 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:23:37,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:37 WrapperNode [2019-12-27 22:23:37,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:23:37,984 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:23:37,984 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:23:37,985 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:23:37,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:37" (1/1) ... [2019-12-27 22:23:38,015 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:37" (1/1) ... [2019-12-27 22:23:38,055 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:23:38,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:23:38,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:23:38,056 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:23:38,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:37" (1/1) ... [2019-12-27 22:23:38,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:37" (1/1) ... [2019-12-27 22:23:38,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:37" (1/1) ... [2019-12-27 22:23:38,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:37" (1/1) ... [2019-12-27 22:23:38,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:37" (1/1) ... [2019-12-27 22:23:38,087 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:37" (1/1) ... [2019-12-27 22:23:38,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:37" (1/1) ... [2019-12-27 22:23:38,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:23:38,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:23:38,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:23:38,097 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:23:38,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:23:38,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:23:38,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:23:38,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:23:38,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:23:38,169 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:23:38,169 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:23:38,169 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:23:38,169 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:23:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:23:38,170 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:23:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:23:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:23:38,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:23:38,172 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 22:23:38,959 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:23:38,960 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:23:38,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:23:38 BoogieIcfgContainer [2019-12-27 22:23:38,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:23:38,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:23:38,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:23:38,966 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:23:38,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:23:37" (1/3) ... [2019-12-27 22:23:38,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d99eaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:23:38, skipping insertion in model container [2019-12-27 22:23:38,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:37" (2/3) ... [2019-12-27 22:23:38,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d99eaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:23:38, skipping insertion in model container [2019-12-27 22:23:38,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:23:38" (3/3) ... [2019-12-27 22:23:38,971 INFO L109 eAbstractionObserver]: Analyzing ICFG safe011_power.opt.i [2019-12-27 22:23:38,981 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:23:38,982 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:23:38,990 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:23:38,991 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:23:39,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,033 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,034 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,044 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,044 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,045 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,047 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,048 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,077 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,077 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,095 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,095 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,099 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,099 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,100 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,104 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,105 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:39,121 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:23:39,141 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:23:39,141 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:23:39,141 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:23:39,141 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:23:39,141 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:23:39,141 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:23:39,141 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:23:39,142 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:23:39,158 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 22:23:39,160 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 22:23:39,273 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 22:23:39,274 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:23:39,296 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 332 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 22:23:39,317 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 22:23:39,392 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 22:23:39,393 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:23:39,400 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 332 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 22:23:39,420 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-27 22:23:39,421 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:23:42,470 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2019-12-27 22:23:42,693 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 22:23:42,806 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 22:23:42,844 INFO L206 etLargeBlockEncoding]: Checked pairs total: 91848 [2019-12-27 22:23:42,845 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-27 22:23:42,848 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 109 transitions [2019-12-27 22:24:02,029 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 117808 states. [2019-12-27 22:24:02,031 INFO L276 IsEmpty]: Start isEmpty. Operand 117808 states. [2019-12-27 22:24:02,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 22:24:02,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:24:02,038 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 22:24:02,038 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:24:02,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:24:02,044 INFO L82 PathProgramCache]: Analyzing trace with hash 806010685, now seen corresponding path program 1 times [2019-12-27 22:24:02,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:24:02,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69062254] [2019-12-27 22:24:02,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:24:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:24:02,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:24:02,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69062254] [2019-12-27 22:24:02,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:24:02,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:24:02,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [975868087] [2019-12-27 22:24:02,264 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:24:02,268 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:24:02,282 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 22:24:02,282 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:24:02,286 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:24:02,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:24:02,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:24:02,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:24:02,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:24:02,304 INFO L87 Difference]: Start difference. First operand 117808 states. Second operand 3 states. [2019-12-27 22:24:05,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:24:05,242 INFO L93 Difference]: Finished difference Result 117244 states and 506404 transitions. [2019-12-27 22:24:05,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:24:05,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 22:24:05,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:24:06,003 INFO L225 Difference]: With dead ends: 117244 [2019-12-27 22:24:06,004 INFO L226 Difference]: Without dead ends: 114878 [2019-12-27 22:24:06,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:24:12,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114878 states. [2019-12-27 22:24:15,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114878 to 114878. [2019-12-27 22:24:15,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114878 states. [2019-12-27 22:24:15,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114878 states to 114878 states and 496758 transitions. [2019-12-27 22:24:15,934 INFO L78 Accepts]: Start accepts. Automaton has 114878 states and 496758 transitions. Word has length 5 [2019-12-27 22:24:15,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:24:15,934 INFO L462 AbstractCegarLoop]: Abstraction has 114878 states and 496758 transitions. [2019-12-27 22:24:15,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:24:15,934 INFO L276 IsEmpty]: Start isEmpty. Operand 114878 states and 496758 transitions. [2019-12-27 22:24:15,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:24:15,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:24:15,937 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:24:15,938 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:24:15,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:24:15,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1817031618, now seen corresponding path program 1 times [2019-12-27 22:24:15,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:24:15,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728692209] [2019-12-27 22:24:15,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:24:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:24:16,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:24:16,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728692209] [2019-12-27 22:24:16,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:24:16,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:24:16,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1725442816] [2019-12-27 22:24:16,059 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:24:16,060 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:24:16,066 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 22:24:16,066 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:24:16,067 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:24:16,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:24:16,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:24:16,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:24:16,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:24:16,070 INFO L87 Difference]: Start difference. First operand 114878 states and 496758 transitions. Second operand 4 states. [2019-12-27 22:24:21,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:24:21,634 INFO L93 Difference]: Finished difference Result 184188 states and 760222 transitions. [2019-12-27 22:24:21,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:24:21,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:24:21,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:24:22,392 INFO L225 Difference]: With dead ends: 184188 [2019-12-27 22:24:22,392 INFO L226 Difference]: Without dead ends: 184139 [2019-12-27 22:24:22,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:24:27,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184139 states. [2019-12-27 22:24:33,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184139 to 169203. [2019-12-27 22:24:33,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169203 states. [2019-12-27 22:24:35,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169203 states to 169203 states and 707190 transitions. [2019-12-27 22:24:35,300 INFO L78 Accepts]: Start accepts. Automaton has 169203 states and 707190 transitions. Word has length 11 [2019-12-27 22:24:35,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:24:35,300 INFO L462 AbstractCegarLoop]: Abstraction has 169203 states and 707190 transitions. [2019-12-27 22:24:35,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:24:35,301 INFO L276 IsEmpty]: Start isEmpty. Operand 169203 states and 707190 transitions. [2019-12-27 22:24:35,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:24:35,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:24:35,310 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:24:35,311 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:24:35,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:24:35,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1405836985, now seen corresponding path program 1 times [2019-12-27 22:24:35,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:24:35,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278054462] [2019-12-27 22:24:35,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:24:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:24:35,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:24:35,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278054462] [2019-12-27 22:24:35,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:24:35,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:24:35,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [600368975] [2019-12-27 22:24:35,427 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:24:35,430 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:24:35,433 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:24:35,433 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:24:35,433 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:24:35,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:24:35,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:24:35,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:24:35,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:24:35,435 INFO L87 Difference]: Start difference. First operand 169203 states and 707190 transitions. Second operand 4 states. [2019-12-27 22:24:42,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:24:42,718 INFO L93 Difference]: Finished difference Result 240014 states and 977713 transitions. [2019-12-27 22:24:42,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:24:42,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:24:42,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:24:44,059 INFO L225 Difference]: With dead ends: 240014 [2019-12-27 22:24:44,060 INFO L226 Difference]: Without dead ends: 239951 [2019-12-27 22:24:44,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:24:50,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239951 states. [2019-12-27 22:24:54,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239951 to 203645. [2019-12-27 22:24:54,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203645 states. [2019-12-27 22:25:04,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203645 states to 203645 states and 844323 transitions. [2019-12-27 22:25:04,607 INFO L78 Accepts]: Start accepts. Automaton has 203645 states and 844323 transitions. Word has length 13 [2019-12-27 22:25:04,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:04,608 INFO L462 AbstractCegarLoop]: Abstraction has 203645 states and 844323 transitions. [2019-12-27 22:25:04,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:25:04,608 INFO L276 IsEmpty]: Start isEmpty. Operand 203645 states and 844323 transitions. [2019-12-27 22:25:04,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:25:04,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:04,612 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:04,613 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:04,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:04,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1324537938, now seen corresponding path program 1 times [2019-12-27 22:25:04,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:04,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722626799] [2019-12-27 22:25:04,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:04,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:04,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722626799] [2019-12-27 22:25:04,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:04,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:25:04,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1164122132] [2019-12-27 22:25:04,664 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:04,665 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:04,667 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:25:04,667 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:04,667 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:25:04,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:25:04,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:04,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:25:04,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:25:04,668 INFO L87 Difference]: Start difference. First operand 203645 states and 844323 transitions. Second operand 3 states. [2019-12-27 22:25:04,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:04,833 INFO L93 Difference]: Finished difference Result 39928 states and 130360 transitions. [2019-12-27 22:25:04,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:25:04,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 22:25:04,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:04,903 INFO L225 Difference]: With dead ends: 39928 [2019-12-27 22:25:04,903 INFO L226 Difference]: Without dead ends: 39928 [2019-12-27 22:25:04,903 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-27 22:25:05,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39928 states. [2019-12-27 22:25:05,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39928 to 39928. [2019-12-27 22:25:05,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39928 states. [2019-12-27 22:25:05,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39928 states to 39928 states and 130360 transitions. [2019-12-27 22:25:05,589 INFO L78 Accepts]: Start accepts. Automaton has 39928 states and 130360 transitions. Word has length 13 [2019-12-27 22:25:05,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:05,589 INFO L462 AbstractCegarLoop]: Abstraction has 39928 states and 130360 transitions. [2019-12-27 22:25:05,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:25:05,589 INFO L276 IsEmpty]: Start isEmpty. Operand 39928 states and 130360 transitions. [2019-12-27 22:25:05,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 22:25:05,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:05,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:05,592 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:05,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:05,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1708808890, now seen corresponding path program 1 times [2019-12-27 22:25:05,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:05,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058516316] [2019-12-27 22:25:05,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:05,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058516316] [2019-12-27 22:25:05,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:05,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:25:05,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [980336689] [2019-12-27 22:25:05,719 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:05,721 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:05,727 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 79 transitions. [2019-12-27 22:25:05,727 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:05,727 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:25:05,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:25:05,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:05,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:25:05,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:25:05,728 INFO L87 Difference]: Start difference. First operand 39928 states and 130360 transitions. Second operand 5 states. [2019-12-27 22:25:07,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:07,841 INFO L93 Difference]: Finished difference Result 53752 states and 171521 transitions. [2019-12-27 22:25:07,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:25:07,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 22:25:07,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:07,925 INFO L225 Difference]: With dead ends: 53752 [2019-12-27 22:25:07,925 INFO L226 Difference]: Without dead ends: 53739 [2019-12-27 22:25:07,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:25:08,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53739 states. [2019-12-27 22:25:08,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53739 to 40157. [2019-12-27 22:25:08,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40157 states. [2019-12-27 22:25:08,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40157 states to 40157 states and 130977 transitions. [2019-12-27 22:25:08,689 INFO L78 Accepts]: Start accepts. Automaton has 40157 states and 130977 transitions. Word has length 19 [2019-12-27 22:25:08,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:08,690 INFO L462 AbstractCegarLoop]: Abstraction has 40157 states and 130977 transitions. [2019-12-27 22:25:08,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:25:08,690 INFO L276 IsEmpty]: Start isEmpty. Operand 40157 states and 130977 transitions. [2019-12-27 22:25:08,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:25:08,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:08,703 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-27 22:25:08,703 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:08,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:08,703 INFO L82 PathProgramCache]: Analyzing trace with hash 102238509, now seen corresponding path program 1 times [2019-12-27 22:25:08,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:08,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512568380] [2019-12-27 22:25:08,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:08,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:08,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512568380] [2019-12-27 22:25:08,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:08,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:25:08,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1588277604] [2019-12-27 22:25:08,767 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:08,771 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:08,783 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 121 transitions. [2019-12-27 22:25:08,784 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:08,784 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:25:08,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:25:08,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:08,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:25:08,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:25:08,785 INFO L87 Difference]: Start difference. First operand 40157 states and 130977 transitions. Second operand 4 states. [2019-12-27 22:25:08,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:08,825 INFO L93 Difference]: Finished difference Result 7224 states and 19739 transitions. [2019-12-27 22:25:08,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:25:08,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 22:25:08,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:08,836 INFO L225 Difference]: With dead ends: 7224 [2019-12-27 22:25:08,836 INFO L226 Difference]: Without dead ends: 7224 [2019-12-27 22:25:08,836 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-27 22:25:08,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7224 states. [2019-12-27 22:25:08,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7224 to 7112. [2019-12-27 22:25:08,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7112 states. [2019-12-27 22:25:08,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7112 states to 7112 states and 19419 transitions. [2019-12-27 22:25:08,941 INFO L78 Accepts]: Start accepts. Automaton has 7112 states and 19419 transitions. Word has length 25 [2019-12-27 22:25:08,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:08,941 INFO L462 AbstractCegarLoop]: Abstraction has 7112 states and 19419 transitions. [2019-12-27 22:25:08,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:25:08,941 INFO L276 IsEmpty]: Start isEmpty. Operand 7112 states and 19419 transitions. [2019-12-27 22:25:08,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 22:25:08,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:08,952 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] [2019-12-27 22:25:08,953 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:08,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:08,953 INFO L82 PathProgramCache]: Analyzing trace with hash -297997791, now seen corresponding path program 1 times [2019-12-27 22:25:08,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:08,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869656364] [2019-12-27 22:25:08,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:09,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:09,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869656364] [2019-12-27 22:25:09,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:09,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:25:09,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1461125932] [2019-12-27 22:25:09,040 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:09,049 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:09,092 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 205 transitions. [2019-12-27 22:25:09,093 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:09,094 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:25:09,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:25:09,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:09,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:25:09,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:25:09,095 INFO L87 Difference]: Start difference. First operand 7112 states and 19419 transitions. Second operand 5 states. [2019-12-27 22:25:09,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:09,136 INFO L93 Difference]: Finished difference Result 5025 states and 14423 transitions. [2019-12-27 22:25:09,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:25:09,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 22:25:09,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:09,144 INFO L225 Difference]: With dead ends: 5025 [2019-12-27 22:25:09,144 INFO L226 Difference]: Without dead ends: 5025 [2019-12-27 22:25:09,144 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-27 22:25:09,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5025 states. [2019-12-27 22:25:09,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5025 to 4661. [2019-12-27 22:25:09,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4661 states. [2019-12-27 22:25:09,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4661 states to 4661 states and 13439 transitions. [2019-12-27 22:25:09,774 INFO L78 Accepts]: Start accepts. Automaton has 4661 states and 13439 transitions. Word has length 37 [2019-12-27 22:25:09,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:09,774 INFO L462 AbstractCegarLoop]: Abstraction has 4661 states and 13439 transitions. [2019-12-27 22:25:09,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:25:09,775 INFO L276 IsEmpty]: Start isEmpty. Operand 4661 states and 13439 transitions. [2019-12-27 22:25:09,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:25:09,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:09,782 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:09,783 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:09,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:09,783 INFO L82 PathProgramCache]: Analyzing trace with hash 253348591, now seen corresponding path program 1 times [2019-12-27 22:25:09,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:09,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074112154] [2019-12-27 22:25:09,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:09,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:09,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074112154] [2019-12-27 22:25:09,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:09,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:25:09,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1297229676] [2019-12-27 22:25:09,884 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:09,905 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:10,011 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 177 states and 291 transitions. [2019-12-27 22:25:10,011 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:10,013 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:25:10,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:25:10,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:10,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:25:10,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:25:10,014 INFO L87 Difference]: Start difference. First operand 4661 states and 13439 transitions. Second operand 3 states. [2019-12-27 22:25:10,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:10,076 INFO L93 Difference]: Finished difference Result 4670 states and 13453 transitions. [2019-12-27 22:25:10,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:25:10,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 22:25:10,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:10,085 INFO L225 Difference]: With dead ends: 4670 [2019-12-27 22:25:10,086 INFO L226 Difference]: Without dead ends: 4670 [2019-12-27 22:25:10,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:25:10,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-27 22:25:10,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4666. [2019-12-27 22:25:10,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-27 22:25:10,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13449 transitions. [2019-12-27 22:25:10,153 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13449 transitions. Word has length 65 [2019-12-27 22:25:10,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:10,153 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13449 transitions. [2019-12-27 22:25:10,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:25:10,153 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13449 transitions. [2019-12-27 22:25:10,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:25:10,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:10,161 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:10,161 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:10,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:10,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1957187666, now seen corresponding path program 1 times [2019-12-27 22:25:10,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:10,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509994688] [2019-12-27 22:25:10,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:10,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:10,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509994688] [2019-12-27 22:25:10,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:10,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:25:10,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [777181699] [2019-12-27 22:25:10,239 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:10,259 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:10,380 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 177 states and 291 transitions. [2019-12-27 22:25:10,380 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:10,381 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:25:10,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:25:10,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:10,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:25:10,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:25:10,382 INFO L87 Difference]: Start difference. First operand 4666 states and 13449 transitions. Second operand 3 states. [2019-12-27 22:25:10,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:10,434 INFO L93 Difference]: Finished difference Result 4670 states and 13443 transitions. [2019-12-27 22:25:10,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:25:10,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 22:25:10,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:10,440 INFO L225 Difference]: With dead ends: 4670 [2019-12-27 22:25:10,441 INFO L226 Difference]: Without dead ends: 4670 [2019-12-27 22:25:10,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:25:10,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-27 22:25:10,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4666. [2019-12-27 22:25:10,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-27 22:25:10,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13439 transitions. [2019-12-27 22:25:10,505 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13439 transitions. Word has length 65 [2019-12-27 22:25:10,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:10,505 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13439 transitions. [2019-12-27 22:25:10,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:25:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13439 transitions. [2019-12-27 22:25:10,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:25:10,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:10,512 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:10,512 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:10,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:10,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1964874705, now seen corresponding path program 1 times [2019-12-27 22:25:10,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:10,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870015589] [2019-12-27 22:25:10,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:10,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:10,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870015589] [2019-12-27 22:25:10,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:10,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:25:10,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2000351054] [2019-12-27 22:25:10,623 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:10,643 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:10,741 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 177 states and 291 transitions. [2019-12-27 22:25:10,742 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:10,794 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:25:10,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:25:10,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:10,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:25:10,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:25:10,795 INFO L87 Difference]: Start difference. First operand 4666 states and 13439 transitions. Second operand 6 states. [2019-12-27 22:25:11,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:11,178 INFO L93 Difference]: Finished difference Result 7416 states and 21064 transitions. [2019-12-27 22:25:11,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:25:11,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 22:25:11,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:11,189 INFO L225 Difference]: With dead ends: 7416 [2019-12-27 22:25:11,189 INFO L226 Difference]: Without dead ends: 7416 [2019-12-27 22:25:11,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:25:11,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7416 states. [2019-12-27 22:25:11,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7416 to 5422. [2019-12-27 22:25:11,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5422 states. [2019-12-27 22:25:12,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5422 states to 5422 states and 15669 transitions. [2019-12-27 22:25:12,569 INFO L78 Accepts]: Start accepts. Automaton has 5422 states and 15669 transitions. Word has length 65 [2019-12-27 22:25:12,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:12,569 INFO L462 AbstractCegarLoop]: Abstraction has 5422 states and 15669 transitions. [2019-12-27 22:25:12,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:25:12,570 INFO L276 IsEmpty]: Start isEmpty. Operand 5422 states and 15669 transitions. [2019-12-27 22:25:12,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:25:12,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:12,581 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:12,581 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:12,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:12,581 INFO L82 PathProgramCache]: Analyzing trace with hash -857096593, now seen corresponding path program 2 times [2019-12-27 22:25:12,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:12,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5852179] [2019-12-27 22:25:12,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:12,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:12,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5852179] [2019-12-27 22:25:12,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:12,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:25:12,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1447252754] [2019-12-27 22:25:12,697 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:12,718 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:12,840 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 248 transitions. [2019-12-27 22:25:12,840 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:12,907 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:25:12,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:25:12,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:12,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:25:12,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:25:12,909 INFO L87 Difference]: Start difference. First operand 5422 states and 15669 transitions. Second operand 8 states. [2019-12-27 22:25:13,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:13,959 INFO L93 Difference]: Finished difference Result 12280 states and 35560 transitions. [2019-12-27 22:25:13,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 22:25:13,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 22:25:13,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:13,981 INFO L225 Difference]: With dead ends: 12280 [2019-12-27 22:25:13,981 INFO L226 Difference]: Without dead ends: 12280 [2019-12-27 22:25:13,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-12-27 22:25:14,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12280 states. [2019-12-27 22:25:14,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12280 to 5936. [2019-12-27 22:25:14,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5936 states. [2019-12-27 22:25:14,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5936 states to 5936 states and 17207 transitions. [2019-12-27 22:25:14,170 INFO L78 Accepts]: Start accepts. Automaton has 5936 states and 17207 transitions. Word has length 65 [2019-12-27 22:25:14,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:14,170 INFO L462 AbstractCegarLoop]: Abstraction has 5936 states and 17207 transitions. [2019-12-27 22:25:14,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:25:14,171 INFO L276 IsEmpty]: Start isEmpty. Operand 5936 states and 17207 transitions. [2019-12-27 22:25:14,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:25:14,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:14,183 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:14,183 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:14,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:14,184 INFO L82 PathProgramCache]: Analyzing trace with hash -730670737, now seen corresponding path program 3 times [2019-12-27 22:25:14,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:14,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048487038] [2019-12-27 22:25:14,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:14,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:14,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048487038] [2019-12-27 22:25:14,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:14,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:25:14,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [832358992] [2019-12-27 22:25:14,291 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:14,344 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:14,526 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 221 states and 398 transitions. [2019-12-27 22:25:14,526 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:14,527 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:25:14,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:25:14,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:14,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:25:14,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:25:14,528 INFO L87 Difference]: Start difference. First operand 5936 states and 17207 transitions. Second operand 3 states. [2019-12-27 22:25:14,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:14,560 INFO L93 Difference]: Finished difference Result 5114 states and 14534 transitions. [2019-12-27 22:25:14,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:25:14,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 22:25:14,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:14,578 INFO L225 Difference]: With dead ends: 5114 [2019-12-27 22:25:14,579 INFO L226 Difference]: Without dead ends: 5114 [2019-12-27 22:25:14,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:25:14,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5114 states. [2019-12-27 22:25:14,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5114 to 4950. [2019-12-27 22:25:14,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4950 states. [2019-12-27 22:25:14,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4950 states to 4950 states and 14080 transitions. [2019-12-27 22:25:14,688 INFO L78 Accepts]: Start accepts. Automaton has 4950 states and 14080 transitions. Word has length 65 [2019-12-27 22:25:14,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:14,688 INFO L462 AbstractCegarLoop]: Abstraction has 4950 states and 14080 transitions. [2019-12-27 22:25:14,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:25:14,689 INFO L276 IsEmpty]: Start isEmpty. Operand 4950 states and 14080 transitions. [2019-12-27 22:25:14,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:25:14,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:14,698 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:14,698 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:14,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:14,699 INFO L82 PathProgramCache]: Analyzing trace with hash -190495509, now seen corresponding path program 1 times [2019-12-27 22:25:14,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:14,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616595773] [2019-12-27 22:25:14,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:14,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:14,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616595773] [2019-12-27 22:25:14,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:14,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:25:14,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1320168674] [2019-12-27 22:25:14,788 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:14,816 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:15,022 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 199 states and 352 transitions. [2019-12-27 22:25:15,022 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:15,023 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:25:15,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:25:15,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:15,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:25:15,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:25:15,026 INFO L87 Difference]: Start difference. First operand 4950 states and 14080 transitions. Second operand 3 states. [2019-12-27 22:25:15,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:15,086 INFO L93 Difference]: Finished difference Result 4950 states and 14079 transitions. [2019-12-27 22:25:15,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:25:15,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 22:25:15,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:15,093 INFO L225 Difference]: With dead ends: 4950 [2019-12-27 22:25:15,093 INFO L226 Difference]: Without dead ends: 4950 [2019-12-27 22:25:15,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:25:15,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4950 states. [2019-12-27 22:25:15,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4950 to 3603. [2019-12-27 22:25:15,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3603 states. [2019-12-27 22:25:15,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3603 states to 3603 states and 10390 transitions. [2019-12-27 22:25:15,149 INFO L78 Accepts]: Start accepts. Automaton has 3603 states and 10390 transitions. Word has length 66 [2019-12-27 22:25:15,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:15,150 INFO L462 AbstractCegarLoop]: Abstraction has 3603 states and 10390 transitions. [2019-12-27 22:25:15,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:25:15,150 INFO L276 IsEmpty]: Start isEmpty. Operand 3603 states and 10390 transitions. [2019-12-27 22:25:15,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:25:15,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:15,154 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:15,155 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:15,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:15,155 INFO L82 PathProgramCache]: Analyzing trace with hash 260478023, now seen corresponding path program 1 times [2019-12-27 22:25:15,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:15,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369280634] [2019-12-27 22:25:15,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:15,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:15,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369280634] [2019-12-27 22:25:15,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:15,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:25:15,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1758436313] [2019-12-27 22:25:15,244 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:15,264 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:15,404 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 200 states and 351 transitions. [2019-12-27 22:25:15,404 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:15,406 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:25:15,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:25:15,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:15,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:25:15,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:25:15,407 INFO L87 Difference]: Start difference. First operand 3603 states and 10390 transitions. Second operand 3 states. [2019-12-27 22:25:15,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:15,428 INFO L93 Difference]: Finished difference Result 3309 states and 9341 transitions. [2019-12-27 22:25:15,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:25:15,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 22:25:15,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:15,433 INFO L225 Difference]: With dead ends: 3309 [2019-12-27 22:25:15,433 INFO L226 Difference]: Without dead ends: 3309 [2019-12-27 22:25:15,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:25:15,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2019-12-27 22:25:15,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 2989. [2019-12-27 22:25:15,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2989 states. [2019-12-27 22:25:15,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 8453 transitions. [2019-12-27 22:25:15,475 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 8453 transitions. Word has length 67 [2019-12-27 22:25:15,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:15,476 INFO L462 AbstractCegarLoop]: Abstraction has 2989 states and 8453 transitions. [2019-12-27 22:25:15,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:25:15,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 8453 transitions. [2019-12-27 22:25:15,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:25:15,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:15,480 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:15,480 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:15,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:15,480 INFO L82 PathProgramCache]: Analyzing trace with hash -674674477, now seen corresponding path program 1 times [2019-12-27 22:25:15,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:15,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034500732] [2019-12-27 22:25:15,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:15,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:15,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034500732] [2019-12-27 22:25:15,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:15,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:25:15,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [448677407] [2019-12-27 22:25:15,614 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:15,634 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:15,776 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 195 states and 338 transitions. [2019-12-27 22:25:15,777 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:15,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:25:15,925 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 22:25:15,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:25:15,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:15,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:25:15,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:25:15,926 INFO L87 Difference]: Start difference. First operand 2989 states and 8453 transitions. Second operand 10 states. [2019-12-27 22:25:16,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:16,473 INFO L93 Difference]: Finished difference Result 7066 states and 19864 transitions. [2019-12-27 22:25:16,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 22:25:16,473 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2019-12-27 22:25:16,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:16,481 INFO L225 Difference]: With dead ends: 7066 [2019-12-27 22:25:16,482 INFO L226 Difference]: Without dead ends: 4661 [2019-12-27 22:25:16,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2019-12-27 22:25:16,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4661 states. [2019-12-27 22:25:16,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4661 to 2448. [2019-12-27 22:25:16,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2448 states. [2019-12-27 22:25:16,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2448 states to 2448 states and 6869 transitions. [2019-12-27 22:25:16,554 INFO L78 Accepts]: Start accepts. Automaton has 2448 states and 6869 transitions. Word has length 68 [2019-12-27 22:25:16,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:16,554 INFO L462 AbstractCegarLoop]: Abstraction has 2448 states and 6869 transitions. [2019-12-27 22:25:16,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:25:16,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2448 states and 6869 transitions. [2019-12-27 22:25:16,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:25:16,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:16,557 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:16,558 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:16,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:16,558 INFO L82 PathProgramCache]: Analyzing trace with hash -68955433, now seen corresponding path program 2 times [2019-12-27 22:25:16,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:16,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484743942] [2019-12-27 22:25:16,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:16,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:16,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484743942] [2019-12-27 22:25:16,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:16,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:25:16,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [381483186] [2019-12-27 22:25:16,683 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:16,704 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:16,902 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 317 transitions. [2019-12-27 22:25:16,903 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:16,904 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:25:16,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:25:16,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:16,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:25:16,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:25:16,905 INFO L87 Difference]: Start difference. First operand 2448 states and 6869 transitions. Second operand 6 states. [2019-12-27 22:25:16,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:16,989 INFO L93 Difference]: Finished difference Result 4518 states and 12683 transitions. [2019-12-27 22:25:16,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:25:16,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 22:25:16,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:16,993 INFO L225 Difference]: With dead ends: 4518 [2019-12-27 22:25:16,993 INFO L226 Difference]: Without dead ends: 2174 [2019-12-27 22:25:16,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:25:17,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2174 states. [2019-12-27 22:25:17,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2174 to 1805. [2019-12-27 22:25:17,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1805 states. [2019-12-27 22:25:17,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 5008 transitions. [2019-12-27 22:25:17,034 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 5008 transitions. Word has length 68 [2019-12-27 22:25:17,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:17,034 INFO L462 AbstractCegarLoop]: Abstraction has 1805 states and 5008 transitions. [2019-12-27 22:25:17,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:25:17,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 5008 transitions. [2019-12-27 22:25:17,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:25:17,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:17,036 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:17,036 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:17,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:17,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1001515831, now seen corresponding path program 3 times [2019-12-27 22:25:17,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:17,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178539532] [2019-12-27 22:25:17,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:25:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:25:17,152 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:25:17,152 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:25:17,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= v_~x$w_buff1_used~0_75 0) (= 0 v_~x$w_buff0_used~0_119) (= 0 v_~weak$$choice0~0_9) (= 0 v_~x$r_buff0_thd3~0_21) (= 0 |v_ULTIMATE.start_main_~#t2028~0.offset_18|) (= v_~z~0_11 0) (= |v_#NULL.offset_3| 0) (= v_~x$r_buff1_thd2~0_18 0) (= 0 v_~x$r_buff0_thd2~0_27) (= v_~x$flush_delayed~0_17 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice2~0_34) (= 0 v_~x$read_delayed_var~0.base_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t2028~0.base_21|) 0) (= 0 v_~x$r_buff0_thd0~0_79) (= 0 v_~__unbuffered_p2_EAX~0_10) (= v_~x~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff1_thd0~0_48 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t2028~0.base_21| 4)) (= 0 v_~x$r_buff0_thd1~0_21) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2028~0.base_21| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2028~0.base_21|) |v_ULTIMATE.start_main_~#t2028~0.offset_18| 0)) |v_#memory_int_17|) (= 0 |v_#NULL.base_3|) (= 0 v_~__unbuffered_cnt~0_22) (= v_~x$mem_tmp~0_11 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2028~0.base_21|) (= v_~y~0_10 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t2028~0.base_21| 1)) (= v_~main$tmp_guard0~0_11 0) (= 0 v_~x$w_buff0~0_31) (= v_~main$tmp_guard1~0_13 0) (= v_~x$r_buff1_thd1~0_17 0) (= v_~x$r_buff1_thd3~0_16 0) (= 0 v_~x$w_buff1~0_30))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_10|, ~x$w_buff0~0=v_~x$w_buff0~0_31, ULTIMATE.start_main_~#t2029~0.base=|v_ULTIMATE.start_main_~#t2029~0.base_22|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_12|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_14|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_18|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_12|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_15|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_17, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_15|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_14|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_17|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_17|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start_main_~#t2029~0.offset=|v_ULTIMATE.start_main_~#t2029~0.offset_18|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_79, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_11|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ~x$w_buff1~0=v_~x$w_buff1~0_30, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_17|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_75, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_18, ULTIMATE.start_main_~#t2028~0.base=|v_ULTIMATE.start_main_~#t2028~0.base_21|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_15|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_14|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x~0=v_~x~0_31, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_10|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_12|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_14|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_14|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_17|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_14|, ~y~0=v_~y~0_10, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_11|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_10|, ULTIMATE.start_main_~#t2030~0.base=|v_ULTIMATE.start_main_~#t2030~0.base_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_~#t2030~0.offset=|v_ULTIMATE.start_main_~#t2030~0.offset_17|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ULTIMATE.start_main_~#t2028~0.offset=|v_ULTIMATE.start_main_~#t2028~0.offset_18|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_48, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_27, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_14|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_17|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_~#t2029~0.base, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2029~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2028~0.base, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_~#t2030~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t2030~0.offset, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2028~0.offset, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 22:25:17,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L805-1-->L807: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2029~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2029~0.base_13|) |v_ULTIMATE.start_main_~#t2029~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t2029~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2029~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t2029~0.offset_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t2029~0.base_13|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2029~0.base_13| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2029~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t2029~0.base=|v_ULTIMATE.start_main_~#t2029~0.base_13|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2029~0.offset=|v_ULTIMATE.start_main_~#t2029~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2029~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2029~0.offset] because there is no mapped edge [2019-12-27 22:25:17,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= 1 v_~x$w_buff0_used~0_80) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= v_~x$w_buff0~0_17 v_~x$w_buff1~0_15) (= 2 v_~x$w_buff0~0_16) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= v_~x$w_buff1_used~0_49 v_~x$w_buff0_used~0_81) (= (mod v_~x$w_buff1_used~0_49 256) 0)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_17, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_16, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_80} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 22:25:17,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2030~0.base_9| 4) |v_#length_13|) (= |v_ULTIMATE.start_main_~#t2030~0.offset_8| 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2030~0.base_9| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2030~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2030~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2030~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2030~0.base_9|) |v_ULTIMATE.start_main_~#t2030~0.offset_8| 2))) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2030~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t2030~0.base=|v_ULTIMATE.start_main_~#t2030~0.base_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t2030~0.offset=|v_ULTIMATE.start_main_~#t2030~0.offset_8|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2030~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t2030~0.offset, #length] because there is no mapped edge [2019-12-27 22:25:17,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L782-2-->L782-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1076330230 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd3~0_In1076330230 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out1076330230| ~x$w_buff1~0_In1076330230)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out1076330230| ~x~0_In1076330230)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1076330230, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1076330230, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1076330230, ~x~0=~x~0_In1076330230} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1076330230|, ~x$w_buff1~0=~x$w_buff1~0_In1076330230, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1076330230, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1076330230, ~x~0=~x~0_In1076330230} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 22:25:17,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L782-4-->L783: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~x~0_17) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-27 22:25:17,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1092310223 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1092310223 256)))) (or (and (= ~x$w_buff0_used~0_In1092310223 |P2Thread1of1ForFork2_#t~ite17_Out1092310223|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork2_#t~ite17_Out1092310223|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1092310223, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1092310223} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1092310223, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out1092310223|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1092310223} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 22:25:17,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L784-->L784-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In-2142629100 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-2142629100 256))) (.cse3 (= (mod ~x$r_buff0_thd3~0_In-2142629100 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-2142629100 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-2142629100 |P2Thread1of1ForFork2_#t~ite18_Out-2142629100|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork2_#t~ite18_Out-2142629100| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2142629100, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2142629100, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2142629100, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2142629100} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2142629100, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2142629100, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2142629100, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-2142629100|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2142629100} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 22:25:17,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1799935397 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1799935397 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out1799935397| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out1799935397| ~x$r_buff0_thd3~0_In1799935397) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1799935397, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1799935397} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1799935397, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out1799935397|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1799935397} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 22:25:17,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In978242774 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In978242774 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In978242774 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In978242774 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite20_Out978242774|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd3~0_In978242774 |P2Thread1of1ForFork2_#t~ite20_Out978242774|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In978242774, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In978242774, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In978242774, ~x$w_buff0_used~0=~x$w_buff0_used~0_In978242774} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out978242774|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In978242774, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In978242774, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In978242774, ~x$w_buff0_used~0=~x$w_buff0_used~0_In978242774} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 22:25:17,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~x$r_buff1_thd3~0_13)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_13, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 22:25:17,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L733-2-->L733-5: Formula: (let ((.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out947035512| |P0Thread1of1ForFork0_#t~ite3_Out947035512|)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In947035512 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In947035512 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out947035512| ~x~0_In947035512)) (and .cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out947035512| ~x$w_buff1~0_In947035512) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In947035512, ~x$w_buff1_used~0=~x$w_buff1_used~0_In947035512, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In947035512, ~x~0=~x~0_In947035512} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out947035512|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out947035512|, ~x$w_buff1~0=~x$w_buff1~0_In947035512, ~x$w_buff1_used~0=~x$w_buff1_used~0_In947035512, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In947035512, ~x~0=~x~0_In947035512} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 22:25:17,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L734-->L734-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1967626178 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1967626178 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1967626178| 0) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-1967626178 |P0Thread1of1ForFork0_#t~ite5_Out-1967626178|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1967626178, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1967626178} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1967626178|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1967626178, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1967626178} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 22:25:17,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L735-->L735-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In2127092100 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In2127092100 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In2127092100 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In2127092100 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In2127092100 |P0Thread1of1ForFork0_#t~ite6_Out2127092100|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out2127092100|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2127092100, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2127092100, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2127092100, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2127092100} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2127092100|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2127092100, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2127092100, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2127092100, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2127092100} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 22:25:17,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L736-->L736-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-284964361 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-284964361 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd1~0_In-284964361 |P0Thread1of1ForFork0_#t~ite7_Out-284964361|)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-284964361|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-284964361, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-284964361} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-284964361, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-284964361|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-284964361} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 22:25:17,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L737-->L737-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In931185745 256))) (.cse1 (= (mod ~x$r_buff1_thd1~0_In931185745 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In931185745 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In931185745 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out931185745| ~x$r_buff1_thd1~0_In931185745) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out931185745| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In931185745, ~x$w_buff1_used~0=~x$w_buff1_used~0_In931185745, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In931185745, ~x$w_buff0_used~0=~x$w_buff0_used~0_In931185745} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In931185745, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out931185745|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In931185745, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In931185745, ~x$w_buff0_used~0=~x$w_buff0_used~0_In931185745} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 22:25:17,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L737-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~x$r_buff1_thd1~0_14 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 22:25:17,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L763-->L763-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1297685948 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1297685948 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-1297685948| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-1297685948| ~x$w_buff0_used~0_In-1297685948)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1297685948, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1297685948} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1297685948|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1297685948, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1297685948} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 22:25:17,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L764-->L764-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd2~0_In1011215136 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1011215136 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1011215136 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In1011215136 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1011215136|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~x$w_buff1_used~0_In1011215136 |P1Thread1of1ForFork1_#t~ite12_Out1011215136|) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1011215136, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1011215136, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1011215136, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1011215136} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1011215136, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1011215136, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1011215136|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1011215136, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1011215136} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 22:25:17,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L765-->L766: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1759554975 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1759554975 256)))) (or (and (= ~x$r_buff0_thd2~0_Out1759554975 ~x$r_buff0_thd2~0_In1759554975) (or .cse0 .cse1)) (and (not .cse1) (= ~x$r_buff0_thd2~0_Out1759554975 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1759554975, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1759554975} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1759554975|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1759554975, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1759554975} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 22:25:17,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L766-->L766-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-362166101 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-362166101 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-362166101 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-362166101 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-362166101| ~x$r_buff1_thd2~0_In-362166101) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out-362166101| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-362166101, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-362166101, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-362166101, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-362166101} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-362166101, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-362166101, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-362166101, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-362166101|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-362166101} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 22:25:17,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~x$r_buff1_thd2~0_15 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 22:25:17,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 22:25:17,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L815-2-->L815-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In192569378 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In192569378 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite24_Out192569378| |ULTIMATE.start_main_#t~ite25_Out192569378|))) (or (and (= ~x~0_In192569378 |ULTIMATE.start_main_#t~ite24_Out192569378|) (or .cse0 .cse1) .cse2) (and (= |ULTIMATE.start_main_#t~ite24_Out192569378| ~x$w_buff1~0_In192569378) (not .cse1) (not .cse0) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In192569378, ~x$w_buff1_used~0=~x$w_buff1_used~0_In192569378, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In192569378, ~x~0=~x~0_In192569378} OutVars{~x$w_buff1~0=~x$w_buff1~0_In192569378, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out192569378|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out192569378|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In192569378, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In192569378, ~x~0=~x~0_In192569378} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 22:25:17,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1216285347 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1216285347 256) 0))) (or (and (= ~x$w_buff0_used~0_In1216285347 |ULTIMATE.start_main_#t~ite26_Out1216285347|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite26_Out1216285347| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1216285347, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1216285347} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1216285347, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1216285347|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1216285347} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 22:25:17,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L817-->L817-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-115586796 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-115586796 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-115586796 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-115586796 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite27_Out-115586796| ~x$w_buff1_used~0_In-115586796) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite27_Out-115586796| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-115586796, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-115586796, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-115586796, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-115586796} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-115586796, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-115586796, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-115586796|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-115586796, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-115586796} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 22:25:17,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L818-->L818-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In890148 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In890148 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite28_Out890148| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite28_Out890148| ~x$r_buff0_thd0~0_In890148)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In890148, ~x$w_buff0_used~0=~x$w_buff0_used~0_In890148} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In890148, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out890148|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In890148} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 22:25:17,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In975171160 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In975171160 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In975171160 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In975171160 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In975171160 |ULTIMATE.start_main_#t~ite29_Out975171160|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite29_Out975171160|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In975171160, ~x$w_buff1_used~0=~x$w_buff1_used~0_In975171160, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In975171160, ~x$w_buff0_used~0=~x$w_buff0_used~0_In975171160} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In975171160, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out975171160|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In975171160, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In975171160, ~x$w_buff0_used~0=~x$w_buff0_used~0_In975171160} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 22:25:17,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L831-->L832: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~x$r_buff0_thd0~0_56 v_~x$r_buff0_thd0~0_55)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_55, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_21} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 22:25:17,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L834-->L837-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_8 256)) (not (= 0 (mod v_~x$flush_delayed~0_12 256))) (= v_~x$mem_tmp~0_6 v_~x~0_26) (= v_~x$flush_delayed~0_11 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:25:17,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 22:25:17,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:25:17 BasicIcfg [2019-12-27 22:25:17,295 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:25:17,300 INFO L168 Benchmark]: Toolchain (without parser) took 100088.29 ms. Allocated memory was 140.0 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 101.6 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 497.2 MB. Max. memory is 7.1 GB. [2019-12-27 22:25:17,302 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 140.0 MB. Free memory was 121.2 MB in the beginning and 121.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 22:25:17,305 INFO L168 Benchmark]: CACSL2BoogieTranslator took 773.29 ms. Allocated memory was 140.0 MB in the beginning and 205.5 MB in the end (delta: 65.5 MB). Free memory was 101.2 MB in the beginning and 159.1 MB in the end (delta: -57.9 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:25:17,305 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.90 ms. Allocated memory is still 205.5 MB. Free memory was 159.1 MB in the beginning and 156.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:25:17,307 INFO L168 Benchmark]: Boogie Preprocessor took 41.09 ms. Allocated memory is still 205.5 MB. Free memory was 156.5 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:25:17,308 INFO L168 Benchmark]: RCFGBuilder took 864.81 ms. Allocated memory is still 205.5 MB. Free memory was 153.8 MB in the beginning and 103.7 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-27 22:25:17,309 INFO L168 Benchmark]: TraceAbstraction took 98332.45 ms. Allocated memory was 205.5 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 103.7 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 433.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:25:17,320 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.25 ms. Allocated memory is still 140.0 MB. Free memory was 121.2 MB in the beginning and 121.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 773.29 ms. Allocated memory was 140.0 MB in the beginning and 205.5 MB in the end (delta: 65.5 MB). Free memory was 101.2 MB in the beginning and 159.1 MB in the end (delta: -57.9 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.90 ms. Allocated memory is still 205.5 MB. Free memory was 159.1 MB in the beginning and 156.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.09 ms. Allocated memory is still 205.5 MB. Free memory was 156.5 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 864.81 ms. Allocated memory is still 205.5 MB. Free memory was 153.8 MB in the beginning and 103.7 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 98332.45 ms. Allocated memory was 205.5 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 103.7 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 433.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 174 ProgramPointsBefore, 96 ProgramPointsAfterwards, 211 TransitionsBefore, 109 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 28 ChoiceCompositions, 5991 VarBasedMoverChecksPositive, 189 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 91848 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t2028, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_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] [L807] FCALL, FORK 0 pthread_create(&t2029, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_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] [L809] FCALL, FORK 0 pthread_create(&t2030, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_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=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L756] 2 x$r_buff0_thd2 = (_Bool)1 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L727] 1 z = 2 [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L782] 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_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L783] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L762] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L784] 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 [L785] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L733] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L735] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 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) [L763] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L764] 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 [L815] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L815] 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) [L816] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L817] 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 [L818] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L819] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 x$flush_delayed = weak$$choice2 [L825] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L826] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L826] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L827] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L827] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L828] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L828] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L829] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L829] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L830] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L832] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 98.0s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 23.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2336 SDtfs, 2158 SDslu, 3678 SDs, 0 SdLazy, 2307 SolverSat, 164 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 36 SyntacticMatches, 16 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=203645occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 47.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 78059 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 785 NumberOfCodeBlocks, 785 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 701 ConstructedInterpolants, 0 QuantifiedInterpolants, 99267 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...