/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:01:56,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:01:56,960 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:01:56,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:01:56,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:01:56,981 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:01:56,983 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:01:56,992 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:01:56,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:01:57,000 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:01:57,002 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:01:57,004 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:01:57,004 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:01:57,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:01:57,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:01:57,010 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:01:57,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:01:57,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:01:57,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:01:57,018 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:01:57,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:01:57,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:01:57,028 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:01:57,028 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:01:57,030 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:01:57,031 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:01:57,031 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:01:57,033 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:01:57,034 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:01:57,035 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:01:57,036 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:01:57,036 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:01:57,037 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:01:57,038 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:01:57,039 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:01:57,039 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:01:57,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:01:57,040 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:01:57,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:01:57,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:01:57,043 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:01:57,044 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:01:57,078 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:01:57,078 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:01:57,080 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:01:57,080 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:01:57,080 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:01:57,081 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:01:57,081 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:01:57,081 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:01:57,081 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:01:57,081 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:01:57,081 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:01:57,083 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:01:57,083 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:01:57,084 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:01:57,084 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:01:57,084 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:01:57,084 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:01:57,084 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:01:57,085 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:01:57,085 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:01:57,085 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:01:57,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:01:57,085 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:01:57,086 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:01:57,086 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:01:57,086 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:01:57,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:01:57,086 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:01:57,087 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:01:57,361 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:01:57,374 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:01:57,377 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:01:57,378 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:01:57,379 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:01:57,379 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_pso.opt.i [2019-12-18 17:01:57,437 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5970b2a08/3c4eba80905f40b5bd68a1effa68bd56/FLAGc3ee0f67b [2019-12-18 17:01:58,031 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:01:58,035 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_pso.opt.i [2019-12-18 17:01:58,051 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5970b2a08/3c4eba80905f40b5bd68a1effa68bd56/FLAGc3ee0f67b [2019-12-18 17:01:58,257 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5970b2a08/3c4eba80905f40b5bd68a1effa68bd56 [2019-12-18 17:01:58,268 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:01:58,270 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:01:58,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:01:58,271 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:01:58,275 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:01:58,276 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:01:58" (1/1) ... [2019-12-18 17:01:58,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45be7259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:01:58, skipping insertion in model container [2019-12-18 17:01:58,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:01:58" (1/1) ... [2019-12-18 17:01:58,287 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:01:58,356 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:01:58,895 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:01:58,908 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:01:58,996 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:01:59,079 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:01:59,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:01:59 WrapperNode [2019-12-18 17:01:59,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:01:59,081 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:01:59,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:01:59,081 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:01:59,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:01:59" (1/1) ... [2019-12-18 17:01:59,121 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:01:59" (1/1) ... [2019-12-18 17:01:59,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:01:59,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:01:59,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:01:59,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:01:59,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:01:59" (1/1) ... [2019-12-18 17:01:59,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:01:59" (1/1) ... [2019-12-18 17:01:59,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:01:59" (1/1) ... [2019-12-18 17:01:59,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:01:59" (1/1) ... [2019-12-18 17:01:59,198 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:01:59" (1/1) ... [2019-12-18 17:01:59,202 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:01:59" (1/1) ... [2019-12-18 17:01:59,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:01:59" (1/1) ... [2019-12-18 17:01:59,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:01:59,212 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:01:59,212 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:01:59,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:01:59,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:01:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:01:59,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:01:59,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:01:59,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:01:59,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:01:59,278 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:01:59,278 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:01:59,278 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:01:59,279 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:01:59,279 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:01:59,279 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:01:59,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:01:59,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:01:59,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:01:59,281 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 17:02:00,020 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:02:00,020 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:02:00,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:02:00 BoogieIcfgContainer [2019-12-18 17:02:00,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:02:00,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:02:00,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:02:00,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:02:00,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:01:58" (1/3) ... [2019-12-18 17:02:00,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b105fce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:02:00, skipping insertion in model container [2019-12-18 17:02:00,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:01:59" (2/3) ... [2019-12-18 17:02:00,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b105fce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:02:00, skipping insertion in model container [2019-12-18 17:02:00,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:02:00" (3/3) ... [2019-12-18 17:02:00,031 INFO L109 eAbstractionObserver]: Analyzing ICFG mix028_pso.opt.i [2019-12-18 17:02:00,041 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:02:00,042 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:02:00,050 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:02:00,051 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:02:00,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,109 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,110 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,121 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,121 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,122 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,122 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,123 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,133 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,133 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,147 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,152 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,154 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,155 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,155 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,159 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,160 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:00,175 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 17:02:00,196 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:02:00,197 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:02:00,197 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:02:00,197 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:02:00,197 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:02:00,197 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:02:00,197 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:02:00,197 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:02:00,215 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 17:02:00,217 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 17:02:00,305 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 17:02:00,306 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:02:00,324 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 17:02:00,349 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 17:02:00,421 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 17:02:00,422 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:02:00,434 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 17:02:00,456 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-18 17:02:00,457 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:02:03,519 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2019-12-18 17:02:05,612 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 17:02:05,739 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 17:02:05,760 INFO L206 etLargeBlockEncoding]: Checked pairs total: 79058 [2019-12-18 17:02:05,760 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 17:02:05,764 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-18 17:02:23,623 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115078 states. [2019-12-18 17:02:23,625 INFO L276 IsEmpty]: Start isEmpty. Operand 115078 states. [2019-12-18 17:02:23,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 17:02:23,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:02:23,631 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 17:02:23,632 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-18 17:02:23,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:02:23,636 INFO L82 PathProgramCache]: Analyzing trace with hash 811621075, now seen corresponding path program 1 times [2019-12-18 17:02:23,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:02:23,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124801096] [2019-12-18 17:02:23,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:02:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:02:23,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:02:23,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124801096] [2019-12-18 17:02:23,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:02:23,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:02:23,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857835391] [2019-12-18 17:02:23,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:02:23,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:02:23,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:02:23,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:02:23,917 INFO L87 Difference]: Start difference. First operand 115078 states. Second operand 3 states. [2019-12-18 17:02:27,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:02:27,881 INFO L93 Difference]: Finished difference Result 114778 states and 493920 transitions. [2019-12-18 17:02:27,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:02:27,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 17:02:27,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:02:28,757 INFO L225 Difference]: With dead ends: 114778 [2019-12-18 17:02:28,757 INFO L226 Difference]: Without dead ends: 112412 [2019-12-18 17:02:28,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:02:32,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112412 states. [2019-12-18 17:02:38,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112412 to 112412. [2019-12-18 17:02:38,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112412 states. [2019-12-18 17:02:39,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112412 states to 112412 states and 484274 transitions. [2019-12-18 17:02:39,286 INFO L78 Accepts]: Start accepts. Automaton has 112412 states and 484274 transitions. Word has length 5 [2019-12-18 17:02:39,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:02:39,286 INFO L462 AbstractCegarLoop]: Abstraction has 112412 states and 484274 transitions. [2019-12-18 17:02:39,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:02:39,287 INFO L276 IsEmpty]: Start isEmpty. Operand 112412 states and 484274 transitions. [2019-12-18 17:02:39,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 17:02:39,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:02:39,290 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:02:39,290 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-18 17:02:39,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:02:39,290 INFO L82 PathProgramCache]: Analyzing trace with hash -287251583, now seen corresponding path program 1 times [2019-12-18 17:02:39,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:02:39,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471505340] [2019-12-18 17:02:39,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:02:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:02:39,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:02:39,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471505340] [2019-12-18 17:02:39,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:02:39,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:02:39,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082749595] [2019-12-18 17:02:39,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:02:39,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:02:39,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:02:39,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:02:39,435 INFO L87 Difference]: Start difference. First operand 112412 states and 484274 transitions. Second operand 4 states. [2019-12-18 17:02:44,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:02:44,973 INFO L93 Difference]: Finished difference Result 180702 states and 747767 transitions. [2019-12-18 17:02:44,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:02:44,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 17:02:44,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:02:45,550 INFO L225 Difference]: With dead ends: 180702 [2019-12-18 17:02:45,550 INFO L226 Difference]: Without dead ends: 180653 [2019-12-18 17:02:45,551 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-18 17:02:50,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180653 states. [2019-12-18 17:02:54,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180653 to 165577. [2019-12-18 17:02:54,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165577 states. [2019-12-18 17:02:54,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165577 states to 165577 states and 693075 transitions. [2019-12-18 17:02:54,940 INFO L78 Accepts]: Start accepts. Automaton has 165577 states and 693075 transitions. Word has length 11 [2019-12-18 17:02:54,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:02:54,940 INFO L462 AbstractCegarLoop]: Abstraction has 165577 states and 693075 transitions. [2019-12-18 17:02:54,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:02:54,940 INFO L276 IsEmpty]: Start isEmpty. Operand 165577 states and 693075 transitions. [2019-12-18 17:02:54,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:02:54,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:02:54,949 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:02:54,949 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-18 17:02:54,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:02:54,949 INFO L82 PathProgramCache]: Analyzing trace with hash 228163746, now seen corresponding path program 1 times [2019-12-18 17:02:54,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:02:54,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176358628] [2019-12-18 17:02:54,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:02:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:02:55,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:02:55,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176358628] [2019-12-18 17:02:55,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:02:55,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:02:55,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050334250] [2019-12-18 17:02:55,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:02:55,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:02:55,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:02:55,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:02:55,049 INFO L87 Difference]: Start difference. First operand 165577 states and 693075 transitions. Second operand 4 states. [2019-12-18 17:03:02,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:02,129 INFO L93 Difference]: Finished difference Result 235681 states and 964563 transitions. [2019-12-18 17:03:02,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:03:02,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 17:03:02,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:02,892 INFO L225 Difference]: With dead ends: 235681 [2019-12-18 17:03:02,892 INFO L226 Difference]: Without dead ends: 235618 [2019-12-18 17:03:02,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:03:09,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235618 states. [2019-12-18 17:03:18,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235618 to 199613. [2019-12-18 17:03:18,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199613 states. [2019-12-18 17:03:20,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199613 states to 199613 states and 830031 transitions. [2019-12-18 17:03:20,807 INFO L78 Accepts]: Start accepts. Automaton has 199613 states and 830031 transitions. Word has length 13 [2019-12-18 17:03:20,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:20,809 INFO L462 AbstractCegarLoop]: Abstraction has 199613 states and 830031 transitions. [2019-12-18 17:03:20,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:03:20,809 INFO L276 IsEmpty]: Start isEmpty. Operand 199613 states and 830031 transitions. [2019-12-18 17:03:20,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:03:20,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:20,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:20,817 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-18 17:03:20,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:20,818 INFO L82 PathProgramCache]: Analyzing trace with hash 986322522, now seen corresponding path program 1 times [2019-12-18 17:03:20,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:20,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405556214] [2019-12-18 17:03:20,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:20,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:20,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405556214] [2019-12-18 17:03:20,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:20,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:03:20,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634693262] [2019-12-18 17:03:20,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:03:20,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:20,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:03:20,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:03:20,880 INFO L87 Difference]: Start difference. First operand 199613 states and 830031 transitions. Second operand 3 states. [2019-12-18 17:03:21,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:21,017 INFO L93 Difference]: Finished difference Result 39466 states and 128760 transitions. [2019-12-18 17:03:21,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:03:21,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 17:03:21,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:21,099 INFO L225 Difference]: With dead ends: 39466 [2019-12-18 17:03:21,100 INFO L226 Difference]: Without dead ends: 39466 [2019-12-18 17:03:21,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:03:21,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39466 states. [2019-12-18 17:03:21,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39466 to 39466. [2019-12-18 17:03:21,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39466 states. [2019-12-18 17:03:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39466 states to 39466 states and 128760 transitions. [2019-12-18 17:03:27,967 INFO L78 Accepts]: Start accepts. Automaton has 39466 states and 128760 transitions. Word has length 13 [2019-12-18 17:03:27,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:27,967 INFO L462 AbstractCegarLoop]: Abstraction has 39466 states and 128760 transitions. [2019-12-18 17:03:27,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:03:27,967 INFO L276 IsEmpty]: Start isEmpty. Operand 39466 states and 128760 transitions. [2019-12-18 17:03:27,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 17:03:27,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:27,971 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-18 17:03:27,971 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-18 17:03:27,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:27,971 INFO L82 PathProgramCache]: Analyzing trace with hash -462367392, now seen corresponding path program 1 times [2019-12-18 17:03:27,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:27,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124871518] [2019-12-18 17:03:27,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:28,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:28,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124871518] [2019-12-18 17:03:28,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:28,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:03:28,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906251976] [2019-12-18 17:03:28,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:03:28,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:28,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:03:28,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:03:28,094 INFO L87 Difference]: Start difference. First operand 39466 states and 128760 transitions. Second operand 5 states. [2019-12-18 17:03:28,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:28,878 INFO L93 Difference]: Finished difference Result 53323 states and 170492 transitions. [2019-12-18 17:03:28,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:03:28,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 17:03:28,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:28,963 INFO L225 Difference]: With dead ends: 53323 [2019-12-18 17:03:28,963 INFO L226 Difference]: Without dead ends: 53310 [2019-12-18 17:03:28,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:03:29,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53310 states. [2019-12-18 17:03:29,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53310 to 39837. [2019-12-18 17:03:29,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39837 states. [2019-12-18 17:03:29,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39837 states to 39837 states and 129810 transitions. [2019-12-18 17:03:29,713 INFO L78 Accepts]: Start accepts. Automaton has 39837 states and 129810 transitions. Word has length 19 [2019-12-18 17:03:29,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:29,713 INFO L462 AbstractCegarLoop]: Abstraction has 39837 states and 129810 transitions. [2019-12-18 17:03:29,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:03:29,713 INFO L276 IsEmpty]: Start isEmpty. Operand 39837 states and 129810 transitions. [2019-12-18 17:03:29,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 17:03:29,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:29,726 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:29,727 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-18 17:03:29,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:29,727 INFO L82 PathProgramCache]: Analyzing trace with hash 781437825, now seen corresponding path program 1 times [2019-12-18 17:03:29,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:29,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398143858] [2019-12-18 17:03:29,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:29,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:29,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:29,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398143858] [2019-12-18 17:03:29,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:29,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:03:29,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172793922] [2019-12-18 17:03:29,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:03:29,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:29,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:03:29,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:03:29,783 INFO L87 Difference]: Start difference. First operand 39837 states and 129810 transitions. Second operand 4 states. [2019-12-18 17:03:29,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:29,825 INFO L93 Difference]: Finished difference Result 7581 states and 20788 transitions. [2019-12-18 17:03:29,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:03:29,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 17:03:29,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:29,837 INFO L225 Difference]: With dead ends: 7581 [2019-12-18 17:03:29,838 INFO L226 Difference]: Without dead ends: 7581 [2019-12-18 17:03:29,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:03:29,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7581 states. [2019-12-18 17:03:29,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7581 to 7441. [2019-12-18 17:03:29,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7441 states. [2019-12-18 17:03:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7441 states to 7441 states and 20388 transitions. [2019-12-18 17:03:29,951 INFO L78 Accepts]: Start accepts. Automaton has 7441 states and 20388 transitions. Word has length 25 [2019-12-18 17:03:29,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:29,952 INFO L462 AbstractCegarLoop]: Abstraction has 7441 states and 20388 transitions. [2019-12-18 17:03:29,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:03:29,952 INFO L276 IsEmpty]: Start isEmpty. Operand 7441 states and 20388 transitions. [2019-12-18 17:03:29,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 17:03:29,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:29,964 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-18 17:03:29,964 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-18 17:03:29,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:29,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1015424040, now seen corresponding path program 1 times [2019-12-18 17:03:29,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:29,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959533497] [2019-12-18 17:03:29,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:30,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:30,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959533497] [2019-12-18 17:03:30,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:30,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:03:30,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565773065] [2019-12-18 17:03:30,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:03:30,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:30,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:03:30,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:03:30,055 INFO L87 Difference]: Start difference. First operand 7441 states and 20388 transitions. Second operand 5 states. [2019-12-18 17:03:30,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:30,147 INFO L93 Difference]: Finished difference Result 5402 states and 15528 transitions. [2019-12-18 17:03:30,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:03:30,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 17:03:30,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:30,156 INFO L225 Difference]: With dead ends: 5402 [2019-12-18 17:03:30,156 INFO L226 Difference]: Without dead ends: 5402 [2019-12-18 17:03:30,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:03:30,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2019-12-18 17:03:30,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 4989. [2019-12-18 17:03:30,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4989 states. [2019-12-18 17:03:30,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4989 states to 4989 states and 14411 transitions. [2019-12-18 17:03:30,239 INFO L78 Accepts]: Start accepts. Automaton has 4989 states and 14411 transitions. Word has length 37 [2019-12-18 17:03:30,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:30,240 INFO L462 AbstractCegarLoop]: Abstraction has 4989 states and 14411 transitions. [2019-12-18 17:03:30,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:03:30,240 INFO L276 IsEmpty]: Start isEmpty. Operand 4989 states and 14411 transitions. [2019-12-18 17:03:30,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:03:30,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:30,250 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-18 17:03:30,250 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-18 17:03:30,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:30,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1550906862, now seen corresponding path program 1 times [2019-12-18 17:03:30,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:30,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352283135] [2019-12-18 17:03:30,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:30,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:30,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352283135] [2019-12-18 17:03:30,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:30,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:03:30,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533846305] [2019-12-18 17:03:30,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:03:30,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:30,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:03:30,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:03:30,340 INFO L87 Difference]: Start difference. First operand 4989 states and 14411 transitions. Second operand 3 states. [2019-12-18 17:03:30,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:30,420 INFO L93 Difference]: Finished difference Result 4998 states and 14420 transitions. [2019-12-18 17:03:30,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:03:30,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 17:03:30,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:30,428 INFO L225 Difference]: With dead ends: 4998 [2019-12-18 17:03:30,429 INFO L226 Difference]: Without dead ends: 4998 [2019-12-18 17:03:30,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:03:30,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4998 states. [2019-12-18 17:03:30,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4998 to 4994. [2019-12-18 17:03:30,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4994 states. [2019-12-18 17:03:30,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4994 states to 4994 states and 14416 transitions. [2019-12-18 17:03:30,501 INFO L78 Accepts]: Start accepts. Automaton has 4994 states and 14416 transitions. Word has length 65 [2019-12-18 17:03:30,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:30,502 INFO L462 AbstractCegarLoop]: Abstraction has 4994 states and 14416 transitions. [2019-12-18 17:03:30,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:03:30,502 INFO L276 IsEmpty]: Start isEmpty. Operand 4994 states and 14416 transitions. [2019-12-18 17:03:30,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:03:30,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:30,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-18 17:03:30,512 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-18 17:03:30,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:30,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1256158932, now seen corresponding path program 1 times [2019-12-18 17:03:30,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:30,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395600693] [2019-12-18 17:03:30,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:30,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395600693] [2019-12-18 17:03:30,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:30,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:03:30,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557608286] [2019-12-18 17:03:30,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:03:30,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:30,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:03:30,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:03:30,630 INFO L87 Difference]: Start difference. First operand 4994 states and 14416 transitions. Second operand 3 states. [2019-12-18 17:03:30,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:30,659 INFO L93 Difference]: Finished difference Result 4994 states and 14195 transitions. [2019-12-18 17:03:30,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:03:30,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 17:03:30,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:30,667 INFO L225 Difference]: With dead ends: 4994 [2019-12-18 17:03:30,667 INFO L226 Difference]: Without dead ends: 4994 [2019-12-18 17:03:30,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:03:30,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4994 states. [2019-12-18 17:03:30,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4994 to 4994. [2019-12-18 17:03:30,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4994 states. [2019-12-18 17:03:30,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4994 states to 4994 states and 14195 transitions. [2019-12-18 17:03:30,741 INFO L78 Accepts]: Start accepts. Automaton has 4994 states and 14195 transitions. Word has length 65 [2019-12-18 17:03:30,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:30,741 INFO L462 AbstractCegarLoop]: Abstraction has 4994 states and 14195 transitions. [2019-12-18 17:03:30,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:03:30,741 INFO L276 IsEmpty]: Start isEmpty. Operand 4994 states and 14195 transitions. [2019-12-18 17:03:30,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:03:30,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:30,749 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:30,749 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-18 17:03:30,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:30,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1760720695, now seen corresponding path program 1 times [2019-12-18 17:03:30,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:30,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768293910] [2019-12-18 17:03:30,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:30,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:30,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768293910] [2019-12-18 17:03:30,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:30,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:03:30,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138466424] [2019-12-18 17:03:30,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:03:30,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:30,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:03:30,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:03:30,885 INFO L87 Difference]: Start difference. First operand 4994 states and 14195 transitions. Second operand 5 states. [2019-12-18 17:03:31,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:31,197 INFO L93 Difference]: Finished difference Result 7330 states and 20675 transitions. [2019-12-18 17:03:31,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:03:31,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-18 17:03:31,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:31,208 INFO L225 Difference]: With dead ends: 7330 [2019-12-18 17:03:31,208 INFO L226 Difference]: Without dead ends: 7330 [2019-12-18 17:03:31,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:03:31,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7330 states. [2019-12-18 17:03:31,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7330 to 6065. [2019-12-18 17:03:31,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6065 states. [2019-12-18 17:03:31,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6065 states to 6065 states and 17257 transitions. [2019-12-18 17:03:31,300 INFO L78 Accepts]: Start accepts. Automaton has 6065 states and 17257 transitions. Word has length 66 [2019-12-18 17:03:31,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:31,301 INFO L462 AbstractCegarLoop]: Abstraction has 6065 states and 17257 transitions. [2019-12-18 17:03:31,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:03:31,301 INFO L276 IsEmpty]: Start isEmpty. Operand 6065 states and 17257 transitions. [2019-12-18 17:03:31,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:03:31,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:31,309 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-18 17:03:31,310 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-18 17:03:31,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:31,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1764113003, now seen corresponding path program 2 times [2019-12-18 17:03:31,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:31,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964230708] [2019-12-18 17:03:31,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:31,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:31,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964230708] [2019-12-18 17:03:31,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:31,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:03:31,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358664066] [2019-12-18 17:03:31,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:03:31,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:31,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:03:31,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:03:31,406 INFO L87 Difference]: Start difference. First operand 6065 states and 17257 transitions. Second operand 5 states. [2019-12-18 17:03:31,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:31,761 INFO L93 Difference]: Finished difference Result 8773 states and 24705 transitions. [2019-12-18 17:03:31,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:03:31,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-18 17:03:31,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:31,773 INFO L225 Difference]: With dead ends: 8773 [2019-12-18 17:03:31,773 INFO L226 Difference]: Without dead ends: 8773 [2019-12-18 17:03:31,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:03:31,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8773 states. [2019-12-18 17:03:31,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8773 to 6413. [2019-12-18 17:03:31,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6413 states. [2019-12-18 17:03:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6413 states to 6413 states and 18290 transitions. [2019-12-18 17:03:31,924 INFO L78 Accepts]: Start accepts. Automaton has 6413 states and 18290 transitions. Word has length 66 [2019-12-18 17:03:31,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:31,924 INFO L462 AbstractCegarLoop]: Abstraction has 6413 states and 18290 transitions. [2019-12-18 17:03:31,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:03:31,924 INFO L276 IsEmpty]: Start isEmpty. Operand 6413 states and 18290 transitions. [2019-12-18 17:03:31,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:03:31,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:31,936 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-18 17:03:31,936 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-18 17:03:31,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:31,937 INFO L82 PathProgramCache]: Analyzing trace with hash 956425645, now seen corresponding path program 3 times [2019-12-18 17:03:31,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:31,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465971680] [2019-12-18 17:03:31,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:32,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:32,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465971680] [2019-12-18 17:03:32,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:32,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:03:32,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924728784] [2019-12-18 17:03:32,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:03:32,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:32,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:03:32,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:03:32,075 INFO L87 Difference]: Start difference. First operand 6413 states and 18290 transitions. Second operand 6 states. [2019-12-18 17:03:32,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:32,526 INFO L93 Difference]: Finished difference Result 8691 states and 24471 transitions. [2019-12-18 17:03:32,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:03:32,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 17:03:32,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:32,540 INFO L225 Difference]: With dead ends: 8691 [2019-12-18 17:03:32,541 INFO L226 Difference]: Without dead ends: 8691 [2019-12-18 17:03:32,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:03:32,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8691 states. [2019-12-18 17:03:32,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8691 to 6840. [2019-12-18 17:03:32,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6840 states. [2019-12-18 17:03:32,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6840 states to 6840 states and 19489 transitions. [2019-12-18 17:03:32,702 INFO L78 Accepts]: Start accepts. Automaton has 6840 states and 19489 transitions. Word has length 66 [2019-12-18 17:03:32,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:32,702 INFO L462 AbstractCegarLoop]: Abstraction has 6840 states and 19489 transitions. [2019-12-18 17:03:32,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:03:32,703 INFO L276 IsEmpty]: Start isEmpty. Operand 6840 states and 19489 transitions. [2019-12-18 17:03:32,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:03:32,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:32,716 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-18 17:03:32,716 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-18 17:03:32,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:32,716 INFO L82 PathProgramCache]: Analyzing trace with hash 426723893, now seen corresponding path program 4 times [2019-12-18 17:03:32,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:32,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844174096] [2019-12-18 17:03:32,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:32,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:32,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844174096] [2019-12-18 17:03:32,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:32,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:03:32,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314324021] [2019-12-18 17:03:32,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:03:32,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:32,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:03:32,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:03:32,803 INFO L87 Difference]: Start difference. First operand 6840 states and 19489 transitions. Second operand 3 states. [2019-12-18 17:03:32,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:32,835 INFO L93 Difference]: Finished difference Result 6051 states and 16971 transitions. [2019-12-18 17:03:32,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:03:32,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 17:03:32,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:32,844 INFO L225 Difference]: With dead ends: 6051 [2019-12-18 17:03:32,844 INFO L226 Difference]: Without dead ends: 6051 [2019-12-18 17:03:32,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:03:32,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6051 states. [2019-12-18 17:03:32,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6051 to 5715. [2019-12-18 17:03:32,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5715 states. [2019-12-18 17:03:32,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5715 states to 5715 states and 16043 transitions. [2019-12-18 17:03:32,953 INFO L78 Accepts]: Start accepts. Automaton has 5715 states and 16043 transitions. Word has length 66 [2019-12-18 17:03:32,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:32,953 INFO L462 AbstractCegarLoop]: Abstraction has 5715 states and 16043 transitions. [2019-12-18 17:03:32,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:03:32,953 INFO L276 IsEmpty]: Start isEmpty. Operand 5715 states and 16043 transitions. [2019-12-18 17:03:32,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:03:32,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:32,964 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-18 17:03:32,964 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-18 17:03:32,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:32,965 INFO L82 PathProgramCache]: Analyzing trace with hash 220867955, now seen corresponding path program 1 times [2019-12-18 17:03:32,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:32,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403024306] [2019-12-18 17:03:32,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:33,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:33,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403024306] [2019-12-18 17:03:33,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:33,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:03:33,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742570269] [2019-12-18 17:03:33,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:03:33,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:33,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:03:33,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:03:33,033 INFO L87 Difference]: Start difference. First operand 5715 states and 16043 transitions. Second operand 3 states. [2019-12-18 17:03:33,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:33,093 INFO L93 Difference]: Finished difference Result 5715 states and 16042 transitions. [2019-12-18 17:03:33,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:03:33,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 17:03:33,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:33,101 INFO L225 Difference]: With dead ends: 5715 [2019-12-18 17:03:33,102 INFO L226 Difference]: Without dead ends: 5715 [2019-12-18 17:03:33,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:03:33,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5715 states. [2019-12-18 17:03:33,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5715 to 3183. [2019-12-18 17:03:33,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states. [2019-12-18 17:03:33,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 9013 transitions. [2019-12-18 17:03:33,166 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 9013 transitions. Word has length 67 [2019-12-18 17:03:33,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:33,166 INFO L462 AbstractCegarLoop]: Abstraction has 3183 states and 9013 transitions. [2019-12-18 17:03:33,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:03:33,166 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 9013 transitions. [2019-12-18 17:03:33,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 17:03:33,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:33,171 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-18 17:03:33,171 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-18 17:03:33,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:33,171 INFO L82 PathProgramCache]: Analyzing trace with hash -2084050195, now seen corresponding path program 1 times [2019-12-18 17:03:33,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:33,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625514104] [2019-12-18 17:03:33,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:33,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:33,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625514104] [2019-12-18 17:03:33,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:33,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 17:03:33,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161897839] [2019-12-18 17:03:33,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 17:03:33,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:33,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 17:03:33,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:03:33,519 INFO L87 Difference]: Start difference. First operand 3183 states and 9013 transitions. Second operand 13 states. [2019-12-18 17:03:34,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:34,413 INFO L93 Difference]: Finished difference Result 10016 states and 28280 transitions. [2019-12-18 17:03:34,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 17:03:34,414 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-18 17:03:34,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:34,419 INFO L225 Difference]: With dead ends: 10016 [2019-12-18 17:03:34,420 INFO L226 Difference]: Without dead ends: 3670 [2019-12-18 17:03:34,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2019-12-18 17:03:34,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2019-12-18 17:03:34,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 2607. [2019-12-18 17:03:34,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2607 states. [2019-12-18 17:03:34,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2607 states and 7312 transitions. [2019-12-18 17:03:34,463 INFO L78 Accepts]: Start accepts. Automaton has 2607 states and 7312 transitions. Word has length 68 [2019-12-18 17:03:34,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:34,464 INFO L462 AbstractCegarLoop]: Abstraction has 2607 states and 7312 transitions. [2019-12-18 17:03:34,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 17:03:34,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 7312 transitions. [2019-12-18 17:03:34,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 17:03:34,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:34,467 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-18 17:03:34,468 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-18 17:03:34,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:34,468 INFO L82 PathProgramCache]: Analyzing trace with hash -293308025, now seen corresponding path program 2 times [2019-12-18 17:03:34,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:34,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088037382] [2019-12-18 17:03:34,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:34,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:34,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088037382] [2019-12-18 17:03:34,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:34,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:03:34,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176263781] [2019-12-18 17:03:34,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:03:34,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:34,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:03:34,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:03:34,601 INFO L87 Difference]: Start difference. First operand 2607 states and 7312 transitions. Second operand 6 states. [2019-12-18 17:03:34,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:34,710 INFO L93 Difference]: Finished difference Result 4997 states and 14053 transitions. [2019-12-18 17:03:34,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:03:34,710 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-18 17:03:34,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:34,714 INFO L225 Difference]: With dead ends: 4997 [2019-12-18 17:03:34,714 INFO L226 Difference]: Without dead ends: 2359 [2019-12-18 17:03:34,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-18 17:03:34,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2019-12-18 17:03:34,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 1963. [2019-12-18 17:03:34,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2019-12-18 17:03:34,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 5460 transitions. [2019-12-18 17:03:34,763 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 5460 transitions. Word has length 68 [2019-12-18 17:03:34,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:34,763 INFO L462 AbstractCegarLoop]: Abstraction has 1963 states and 5460 transitions. [2019-12-18 17:03:34,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:03:34,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 5460 transitions. [2019-12-18 17:03:34,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 17:03:34,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:34,771 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-18 17:03:34,772 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-18 17:03:34,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:34,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1266757317, now seen corresponding path program 3 times [2019-12-18 17:03:34,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:34,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656454140] [2019-12-18 17:03:34,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:03:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:03:34,953 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:03:34,953 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:03:34,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_23) (= v_~z~0_18 0) (= 0 v_~weak$$choice0~0_14) (= v_~x$flush_delayed~0_41 0) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t754~0.base_20| 1)) (= 0 v_~x$r_buff0_thd3~0_99) (= 0 |v_ULTIMATE.start_main_~#t754~0.offset_17|) (= v_~x$r_buff1_thd1~0_192 0) (= 0 v_~x$w_buff0~0_203) (= v_~weak$$choice2~0_116 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~x$r_buff1_thd3~0_193) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff1~0_195) (= v_~x$mem_tmp~0_22 0) (= v_~__unbuffered_p2_EBX~0_23 0) (= 0 v_~x$r_buff0_thd2~0_205) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t754~0.base_20|)) (= v_~main$tmp_guard1~0_28 0) (= v_~x$r_buff0_thd0~0_335 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t754~0.base_20|) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff1_thd0~0_279 0) (= 0 v_~x$w_buff1_used~0_401) (= v_~__unbuffered_cnt~0_145 0) (= 0 v_~x$r_buff1_thd2~0_186) (= 0 v_~x$w_buff0_used~0_743) (= |v_#NULL.offset_5| 0) (= 0 v_~x~0_213) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t754~0.base_20| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t754~0.base_20|) |v_ULTIMATE.start_main_~#t754~0.offset_17| 0)) |v_#memory_int_23|) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t754~0.base_20| 4)) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~x$r_buff0_thd1~0_88) (= 0 |v_#NULL.base_5|) (= v_~y~0_136 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ~x$w_buff0~0=v_~x$w_buff0~0_203, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ~x$flush_delayed~0=v_~x$flush_delayed~0_41, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_31|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_25|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_40|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_192, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_99, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_25|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_46|, ULTIMATE.start_main_~#t754~0.offset=|v_ULTIMATE.start_main_~#t754~0.offset_17|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_36|, ULTIMATE.start_main_~#t754~0.base=|v_ULTIMATE.start_main_~#t754~0.base_20|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_335, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_23, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_43|, ~x$w_buff1~0=v_~x$w_buff1~0_195, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_46|, ULTIMATE.start_main_~#t756~0.offset=|v_ULTIMATE.start_main_~#t756~0.offset_17|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_401, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_186, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_50|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_111|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_156|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145, ~x~0=v_~x~0_213, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_33|, ULTIMATE.start_main_~#t755~0.offset=|v_ULTIMATE.start_main_~#t755~0.offset_17|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_27|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_25|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_193, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_33|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~x$mem_tmp~0=v_~x$mem_tmp~0_22, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_273|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_34|, ~y~0=v_~y~0_136, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_23|, ULTIMATE.start_main_~#t756~0.base=|v_ULTIMATE.start_main_~#t756~0.base_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_27|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_54|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_279, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_205, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_42|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_743, ULTIMATE.start_main_~#t755~0.base=|v_ULTIMATE.start_main_~#t755~0.base_21|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_162|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_18, ~weak$$choice2~0=v_~weak$$choice2~0_116, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, 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_~#t754~0.offset, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t754~0.base, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t756~0.offset, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, 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_~#t755~0.offset, 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_~#t756~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t755~0.base, 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-18 17:03:34,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L810-1-->L812: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t755~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t755~0.base_13|) |v_ULTIMATE.start_main_~#t755~0.offset_11| 1)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t755~0.base_13|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t755~0.base_13| 4) |v_#length_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t755~0.base_13|) (= |v_ULTIMATE.start_main_~#t755~0.offset_11| 0) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t755~0.base_13|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t755~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t755~0.base=|v_ULTIMATE.start_main_~#t755~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t755~0.offset=|v_ULTIMATE.start_main_~#t755~0.offset_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t755~0.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t755~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 17:03:34,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L812-1-->L814: Formula: (and (= |v_ULTIMATE.start_main_~#t756~0.offset_11| 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t756~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t756~0.base_13|) |v_ULTIMATE.start_main_~#t756~0.offset_11| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t756~0.base_13| 0)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t756~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t756~0.base_13|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t756~0.base_13| 1) |v_#valid_34|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t756~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t756~0.base=|v_ULTIMATE.start_main_~#t756~0.base_13|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t756~0.offset=|v_ULTIMATE.start_main_~#t756~0.offset_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t756~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t756~0.offset, #length] because there is no mapped edge [2019-12-18 17:03:34,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] P1ENTRY-->L4-3: Formula: (and (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_12 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_10|) (= (mod v_~x$w_buff1_used~0_145 256) 0) (= v_~x$w_buff0~0_44 v_~x$w_buff1~0_51) (= 2 v_~x$w_buff0~0_43) (= 1 v_~x$w_buff0_used~0_300) (= |v_P1Thread1of1ForFork1_#in~arg.offset_10| v_P1Thread1of1ForFork1_~arg.offset_10) (= v_P1Thread1of1ForFork1_~arg.base_10 |v_P1Thread1of1ForFork1_#in~arg.base_10|) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_10|) (= v_~x$w_buff0_used~0_301 v_~x$w_buff1_used~0_145)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_12, ~x$w_buff0~0=v_~x$w_buff0~0_43, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_10, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_10|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_10, ~x$w_buff1~0=v_~x$w_buff1~0_51, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_145, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_300} 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-18 17:03:34,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L787-2-->L787-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In60496835 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In60496835 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out60496835| ~x$w_buff1~0_In60496835) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out60496835| ~x~0_In60496835)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In60496835, ~x$w_buff1_used~0=~x$w_buff1_used~0_In60496835, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In60496835, ~x~0=~x~0_In60496835} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out60496835|, ~x$w_buff1~0=~x$w_buff1~0_In60496835, ~x$w_buff1_used~0=~x$w_buff1_used~0_In60496835, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In60496835, ~x~0=~x~0_In60496835} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 17:03:34,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L787-4-->L788: Formula: (= v_~x~0_30 |v_P2Thread1of1ForFork2_#t~ite15_12|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_12|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_11|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_9|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-18 17:03:34,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L735-2-->L735-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out-1182895592| |P0Thread1of1ForFork0_#t~ite3_Out-1182895592|)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1182895592 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1182895592 256)))) (or (and .cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out-1182895592| ~x~0_In-1182895592) (or .cse1 .cse2)) (and .cse0 (not .cse1) (= ~x$w_buff1~0_In-1182895592 |P0Thread1of1ForFork0_#t~ite3_Out-1182895592|) (not .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1182895592, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1182895592, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1182895592, ~x~0=~x~0_In-1182895592} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1182895592|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1182895592|, ~x$w_buff1~0=~x$w_buff1~0_In-1182895592, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1182895592, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1182895592, ~x~0=~x~0_In-1182895592} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 17:03:34,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L736-->L736-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In330134956 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In330134956 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out330134956|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In330134956 |P0Thread1of1ForFork0_#t~ite5_Out330134956|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In330134956, ~x$w_buff0_used~0=~x$w_buff0_used~0_In330134956} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out330134956|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In330134956, ~x$w_buff0_used~0=~x$w_buff0_used~0_In330134956} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 17:03:34,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1698663302 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1698663302 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1698663302 |P2Thread1of1ForFork2_#t~ite17_Out1698663302|)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out1698663302|) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1698663302, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1698663302} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1698663302, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out1698663302|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1698663302} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 17:03:34,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L789-->L789-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1432692855 256))) (.cse3 (= (mod ~x$r_buff0_thd3~0_In-1432692855 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-1432692855 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1432692855 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite18_Out-1432692855| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1432692855 |P2Thread1of1ForFork2_#t~ite18_Out-1432692855|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1432692855, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1432692855, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1432692855, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1432692855} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1432692855, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1432692855, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1432692855, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1432692855|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1432692855} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 17:03:34,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L737-->L737-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In402033867 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd1~0_In402033867 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In402033867 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In402033867 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out402033867| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite6_Out402033867| ~x$w_buff1_used~0_In402033867)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In402033867, ~x$w_buff1_used~0=~x$w_buff1_used~0_In402033867, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In402033867, ~x$w_buff0_used~0=~x$w_buff0_used~0_In402033867} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out402033867|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In402033867, ~x$w_buff1_used~0=~x$w_buff1_used~0_In402033867, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In402033867, ~x$w_buff0_used~0=~x$w_buff0_used~0_In402033867} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 17:03:34,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1444828067 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1444828067 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out1444828067| ~x$r_buff0_thd3~0_In1444828067) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out1444828067| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1444828067, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1444828067} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1444828067, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out1444828067|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1444828067} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 17:03:34,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L791-->L791-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd3~0_In1795266837 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1795266837 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1795266837 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1795266837 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd3~0_In1795266837 |P2Thread1of1ForFork2_#t~ite20_Out1795266837|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite20_Out1795266837|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1795266837, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1795266837, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1795266837, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1795266837} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1795266837|, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1795266837, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1795266837, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1795266837, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1795266837} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 17:03:34,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L791-2-->P2EXIT: Formula: (and (= v_~x$r_buff1_thd3~0_48 |v_P2Thread1of1ForFork2_#t~ite20_28|) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_27|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_48, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, 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-18 17:03:34,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L765-->L765-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1677827220 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1677827220 256) 0))) (or (and (= ~x$w_buff0_used~0_In1677827220 |P1Thread1of1ForFork1_#t~ite11_Out1677827220|) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out1677827220| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1677827220, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1677827220} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1677827220|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1677827220, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1677827220} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 17:03:34,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L766-->L766-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd2~0_In722729901 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In722729901 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In722729901 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In722729901 256)))) (or (and (= ~x$w_buff1_used~0_In722729901 |P1Thread1of1ForFork1_#t~ite12_Out722729901|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out722729901|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In722729901, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In722729901, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In722729901, ~x$w_buff0_used~0=~x$w_buff0_used~0_In722729901} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In722729901, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In722729901, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out722729901|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In722729901, ~x$w_buff0_used~0=~x$w_buff0_used~0_In722729901} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 17:03:34,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L767-->L768: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In892987971 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In892987971 256) 0))) (or (and (= 0 ~x$r_buff0_thd2~0_Out892987971) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In892987971 ~x$r_buff0_thd2~0_Out892987971) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In892987971, ~x$w_buff0_used~0=~x$w_buff0_used~0_In892987971} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out892987971|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out892987971, ~x$w_buff0_used~0=~x$w_buff0_used~0_In892987971} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 17:03:34,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L768-->L768-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-2128093578 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-2128093578 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-2128093578 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-2128093578 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In-2128093578 |P1Thread1of1ForFork1_#t~ite14_Out-2128093578|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-2128093578|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2128093578, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2128093578, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2128093578, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2128093578} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2128093578, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2128093578, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2128093578, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-2128093578|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2128093578} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 17:03:34,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L768-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_68 |v_P1Thread1of1ForFork1_#t~ite14_42|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_41|, 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-18 17:03:34,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L738-->L738-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In2094323353 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In2094323353 256) 0))) (or (and (= ~x$r_buff0_thd1~0_In2094323353 |P0Thread1of1ForFork0_#t~ite7_Out2094323353|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out2094323353|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2094323353, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2094323353} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2094323353, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out2094323353|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2094323353} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 17:03:34,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In417839241 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In417839241 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In417839241 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In417839241 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out417839241|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~x$r_buff1_thd1~0_In417839241 |P0Thread1of1ForFork0_#t~ite8_Out417839241|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In417839241, ~x$w_buff1_used~0=~x$w_buff1_used~0_In417839241, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In417839241, ~x$w_buff0_used~0=~x$w_buff0_used~0_In417839241} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In417839241, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out417839241|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In417839241, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In417839241, ~x$w_buff0_used~0=~x$w_buff0_used~0_In417839241} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 17:03:34,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L739-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_40 |v_P0Thread1of1ForFork0_#t~ite8_20|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_19|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_40} 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-18 17:03:34,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L820: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 17:03:34,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L820-2-->L820-5: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1696075634 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1696075634 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite25_Out-1696075634| |ULTIMATE.start_main_#t~ite24_Out-1696075634|))) (or (and (not .cse0) (not .cse1) .cse2 (= ~x$w_buff1~0_In-1696075634 |ULTIMATE.start_main_#t~ite24_Out-1696075634|)) (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite24_Out-1696075634| ~x~0_In-1696075634)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1696075634, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1696075634, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1696075634, ~x~0=~x~0_In-1696075634} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1696075634, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1696075634|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1696075634|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1696075634, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1696075634, ~x~0=~x~0_In-1696075634} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 17:03:34,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1795209375 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1795209375 256)))) (or (and (= ~x$w_buff0_used~0_In-1795209375 |ULTIMATE.start_main_#t~ite26_Out-1795209375|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite26_Out-1795209375|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1795209375, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1795209375} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1795209375, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1795209375|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1795209375} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 17:03:34,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1072831077 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1072831077 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-1072831077 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1072831077 256)))) (or (and (= |ULTIMATE.start_main_#t~ite27_Out-1072831077| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite27_Out-1072831077| ~x$w_buff1_used~0_In-1072831077) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1072831077, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1072831077, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1072831077, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1072831077} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1072831077, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1072831077, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1072831077|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1072831077, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1072831077} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 17:03:34,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-772937347 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-772937347 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite28_Out-772937347|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In-772937347 |ULTIMATE.start_main_#t~ite28_Out-772937347|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-772937347, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-772937347} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-772937347, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-772937347|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-772937347} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 17:03:34,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-253210468 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-253210468 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-253210468 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-253210468 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite29_Out-253210468|)) (and (= |ULTIMATE.start_main_#t~ite29_Out-253210468| ~x$r_buff1_thd0~0_In-253210468) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-253210468, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-253210468, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-253210468, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-253210468} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-253210468, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-253210468|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-253210468, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-253210468, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-253210468} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 17:03:34,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L836-->L837: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd0~0_87 v_~x$r_buff0_thd0~0_86)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_86, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|, 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_27} 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-18 17:03:34,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L839-->L4: Formula: (and (= v_~x$flush_delayed~0_24 0) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= (mod v_~x$flush_delayed~0_25 256) 0)) (= v_~x$mem_tmp~0_15 v_~x~0_173)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_15} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~x$flush_delayed~0=v_~x$flush_delayed~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~x~0=v_~x~0_173, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:03:34,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 17:03:35,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:03:35 BasicIcfg [2019-12-18 17:03:35,131 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:03:35,133 INFO L168 Benchmark]: Toolchain (without parser) took 96863.25 ms. Allocated memory was 147.8 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 104.6 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 17:03:35,133 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 147.8 MB. Free memory was 124.2 MB in the beginning and 123.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 17:03:35,134 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.31 ms. Allocated memory was 147.8 MB in the beginning and 205.0 MB in the end (delta: 57.1 MB). Free memory was 104.2 MB in the beginning and 158.9 MB in the end (delta: -54.7 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:03:35,135 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.24 ms. Allocated memory is still 205.0 MB. Free memory was 158.9 MB in the beginning and 155.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-12-18 17:03:35,135 INFO L168 Benchmark]: Boogie Preprocessor took 40.84 ms. Allocated memory is still 205.0 MB. Free memory was 155.7 MB in the beginning and 153.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-18 17:03:35,136 INFO L168 Benchmark]: RCFGBuilder took 809.80 ms. Allocated memory is still 205.0 MB. Free memory was 153.2 MB in the beginning and 102.9 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-18 17:03:35,137 INFO L168 Benchmark]: TraceAbstraction took 95107.56 ms. Allocated memory was 205.0 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 102.9 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 17:03:35,140 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.20 ms. Allocated memory is still 147.8 MB. Free memory was 124.2 MB in the beginning and 123.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 809.31 ms. Allocated memory was 147.8 MB in the beginning and 205.0 MB in the end (delta: 57.1 MB). Free memory was 104.2 MB in the beginning and 158.9 MB in the end (delta: -54.7 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 90.24 ms. Allocated memory is still 205.0 MB. Free memory was 158.9 MB in the beginning and 155.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.84 ms. Allocated memory is still 205.0 MB. Free memory was 155.7 MB in the beginning and 153.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 809.80 ms. Allocated memory is still 205.0 MB. Free memory was 153.2 MB in the beginning and 102.9 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 95107.56 ms. Allocated memory was 205.0 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 102.9 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 175 ProgramPointsBefore, 95 ProgramPointsAfterwards, 212 TransitionsBefore, 107 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 29 ChoiceCompositions, 5405 VarBasedMoverChecksPositive, 232 VarBasedMoverChecksNegative, 72 SemBasedMoverChecksPositive, 228 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 79058 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t754, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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] [L812] FCALL, FORK 0 pthread_create(&t755, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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] [L814] FCALL, FORK 0 pthread_create(&t756, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L754] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L755] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L756] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L757] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L758] 2 x$r_buff0_thd2 = (_Bool)1 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L778] 3 y = 2 [L781] 3 __unbuffered_p2_EAX = y [L784] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L729] 1 z = 1 [L732] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2, z=1] [L787] 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=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2, z=1] [L735] 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=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2, z=1] [L735] 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) [L788] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L736] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L737] 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 [L789] 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 [L790] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2, z=1] [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L738] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L820] 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=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, z=1] [L820] 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) [L821] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L822] 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 [L823] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L824] 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 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 x$flush_delayed = weak$$choice2 [L830] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=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=2, z=1] [L831] 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=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=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=2, z=1] [L831] 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) [L832] 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=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=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=2, z=1] [L832] 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)) [L833] 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=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=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=2, z=1] [L833] 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)) [L834] 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=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=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=2, z=1] [L834] 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)) [L835] 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=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=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=2, z=1] [L835] 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)) [L837] 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=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=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=2, z=1] [L837] 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)) [L838] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=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=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 94.7s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 22.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2431 SDtfs, 2260 SDslu, 4314 SDs, 0 SdLazy, 2364 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 27 SyntacticMatches, 12 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199613occurred 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: 46.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 74914 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 788 NumberOfCodeBlocks, 788 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 704 ConstructedInterpolants, 0 QuantifiedInterpolants, 117582 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...