/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi004_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:03:52,035 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:03:52,038 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:03:52,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:03:52,050 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:03:52,051 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:03:52,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:03:52,057 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:03:52,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:03:52,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:03:52,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:03:52,070 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:03:52,070 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:03:52,071 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:03:52,074 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:03:52,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:03:52,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:03:52,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:03:52,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:03:52,086 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:03:52,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:03:52,091 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:03:52,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:03:52,093 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:03:52,097 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:03:52,098 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:03:52,098 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:03:52,100 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:03:52,101 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:03:52,102 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:03:52,103 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:03:52,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:03:52,104 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:03:52,105 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:03:52,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:03:52,108 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:03:52,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:03:52,109 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:03:52,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:03:52,112 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:03:52,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:03:52,114 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 22:03:52,151 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:03:52,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:03:52,152 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:03:52,152 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:03:52,153 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:03:52,156 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:03:52,156 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:03:52,156 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:03:52,156 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:03:52,157 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:03:52,157 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:03:52,157 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:03:52,157 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:03:52,157 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:03:52,157 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:03:52,159 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:03:52,159 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:03:52,159 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:03:52,159 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:03:52,159 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:03:52,160 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:03:52,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:03:52,160 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:03:52,160 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:03:52,160 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:03:52,161 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:03:52,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:03:52,165 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:03:52,165 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:03:52,166 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:03:52,452 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:03:52,464 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:03:52,468 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:03:52,469 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:03:52,470 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:03:52,470 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004_rmo.opt.i [2019-12-18 22:03:52,532 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db2420149/8fdd5cac8b064db1ad2ae4d98b7eae52/FLAGcdf9f4de0 [2019-12-18 22:03:53,108 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:03:53,109 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004_rmo.opt.i [2019-12-18 22:03:53,124 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db2420149/8fdd5cac8b064db1ad2ae4d98b7eae52/FLAGcdf9f4de0 [2019-12-18 22:03:53,366 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db2420149/8fdd5cac8b064db1ad2ae4d98b7eae52 [2019-12-18 22:03:53,376 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:03:53,378 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:03:53,379 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:03:53,379 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:03:53,383 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:03:53,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:03:53" (1/1) ... [2019-12-18 22:03:53,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d61e7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:53, skipping insertion in model container [2019-12-18 22:03:53,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:03:53" (1/1) ... [2019-12-18 22:03:53,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:03:53,451 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:03:54,032 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:03:54,044 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:03:54,104 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:03:54,189 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:03:54,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:54 WrapperNode [2019-12-18 22:03:54,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:03:54,190 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:03:54,190 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:03:54,191 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:03:54,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:54" (1/1) ... [2019-12-18 22:03:54,218 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:54" (1/1) ... [2019-12-18 22:03:54,255 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:03:54,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:03:54,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:03:54,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:03:54,265 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:54" (1/1) ... [2019-12-18 22:03:54,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:54" (1/1) ... [2019-12-18 22:03:54,270 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:54" (1/1) ... [2019-12-18 22:03:54,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:54" (1/1) ... [2019-12-18 22:03:54,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:54" (1/1) ... [2019-12-18 22:03:54,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:54" (1/1) ... [2019-12-18 22:03:54,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:54" (1/1) ... [2019-12-18 22:03:54,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:03:54,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:03:54,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:03:54,292 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:03:54,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:54" (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 22:03:54,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:03:54,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:03:54,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:03:54,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:03:54,355 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:03:54,356 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:03:54,356 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:03:54,356 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:03:54,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:03:54,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:03:54,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:03:54,359 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 22:03:55,044 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:03:55,045 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:03:55,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:03:55 BoogieIcfgContainer [2019-12-18 22:03:55,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:03:55,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:03:55,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:03:55,053 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:03:55,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:03:53" (1/3) ... [2019-12-18 22:03:55,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fca3d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:03:55, skipping insertion in model container [2019-12-18 22:03:55,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:54" (2/3) ... [2019-12-18 22:03:55,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fca3d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:03:55, skipping insertion in model container [2019-12-18 22:03:55,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:03:55" (3/3) ... [2019-12-18 22:03:55,059 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_rmo.opt.i [2019-12-18 22:03:55,070 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:03:55,070 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:03:55,078 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:03:55,079 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:03:55,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,114 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,115 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,139 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,139 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,139 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,140 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,140 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,151 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,151 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,152 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,158 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,159 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:55,199 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 22:03:55,219 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:03:55,220 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:03:55,220 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:03:55,220 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:03:55,220 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:03:55,220 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:03:55,220 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:03:55,220 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:03:55,236 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 165 transitions [2019-12-18 22:03:55,238 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-18 22:03:55,309 INFO L126 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-18 22:03:55,309 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:03:55,322 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 22:03:55,339 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-18 22:03:55,375 INFO L126 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-18 22:03:55,375 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:03:55,380 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 22:03:55,393 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-18 22:03:55,395 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:03:58,276 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 22:03:58,406 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 22:03:58,458 INFO L206 etLargeBlockEncoding]: Checked pairs total: 41237 [2019-12-18 22:03:58,458 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-18 22:03:58,461 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 69 places, 81 transitions [2019-12-18 22:03:58,846 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 7504 states. [2019-12-18 22:03:58,849 INFO L276 IsEmpty]: Start isEmpty. Operand 7504 states. [2019-12-18 22:03:58,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 22:03:58,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:58,857 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 22:03:58,858 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:58,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:58,865 INFO L82 PathProgramCache]: Analyzing trace with hash 676926397, now seen corresponding path program 1 times [2019-12-18 22:03:58,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:58,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538061757] [2019-12-18 22:03:58,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:59,110 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 22:03:59,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538061757] [2019-12-18 22:03:59,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:59,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:03:59,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043867022] [2019-12-18 22:03:59,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:03:59,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:59,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:03:59,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:03:59,177 INFO L87 Difference]: Start difference. First operand 7504 states. Second operand 3 states. [2019-12-18 22:03:59,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:59,441 INFO L93 Difference]: Finished difference Result 6863 states and 23135 transitions. [2019-12-18 22:03:59,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:03:59,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 22:03:59,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:59,514 INFO L225 Difference]: With dead ends: 6863 [2019-12-18 22:03:59,515 INFO L226 Difference]: Without dead ends: 6460 [2019-12-18 22:03:59,516 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 22:03:59,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6460 states. [2019-12-18 22:03:59,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6460 to 6460. [2019-12-18 22:03:59,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6460 states. [2019-12-18 22:04:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6460 states to 6460 states and 21739 transitions. [2019-12-18 22:04:00,021 INFO L78 Accepts]: Start accepts. Automaton has 6460 states and 21739 transitions. Word has length 5 [2019-12-18 22:04:00,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:00,021 INFO L462 AbstractCegarLoop]: Abstraction has 6460 states and 21739 transitions. [2019-12-18 22:04:00,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:04:00,022 INFO L276 IsEmpty]: Start isEmpty. Operand 6460 states and 21739 transitions. [2019-12-18 22:04:00,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:04:00,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:00,034 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:00,034 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:00,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:00,040 INFO L82 PathProgramCache]: Analyzing trace with hash 982245482, now seen corresponding path program 1 times [2019-12-18 22:04:00,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:00,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551690226] [2019-12-18 22:04:00,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:00,188 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 22:04:00,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551690226] [2019-12-18 22:04:00,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:00,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:04:00,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773820674] [2019-12-18 22:04:00,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:04:00,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:00,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:04:00,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:04:00,191 INFO L87 Difference]: Start difference. First operand 6460 states and 21739 transitions. Second operand 4 states. [2019-12-18 22:04:00,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:00,605 INFO L93 Difference]: Finished difference Result 9760 states and 31457 transitions. [2019-12-18 22:04:00,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:04:00,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:04:00,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:00,693 INFO L225 Difference]: With dead ends: 9760 [2019-12-18 22:04:00,694 INFO L226 Difference]: Without dead ends: 9746 [2019-12-18 22:04:00,697 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 22:04:00,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9746 states. [2019-12-18 22:04:01,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9746 to 8836. [2019-12-18 22:04:01,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8836 states. [2019-12-18 22:04:01,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8836 states to 8836 states and 28954 transitions. [2019-12-18 22:04:01,044 INFO L78 Accepts]: Start accepts. Automaton has 8836 states and 28954 transitions. Word has length 11 [2019-12-18 22:04:01,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:01,044 INFO L462 AbstractCegarLoop]: Abstraction has 8836 states and 28954 transitions. [2019-12-18 22:04:01,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:04:01,044 INFO L276 IsEmpty]: Start isEmpty. Operand 8836 states and 28954 transitions. [2019-12-18 22:04:01,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:04:01,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:01,047 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:01,048 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:01,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:01,048 INFO L82 PathProgramCache]: Analyzing trace with hash -2066710524, now seen corresponding path program 1 times [2019-12-18 22:04:01,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:01,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145967468] [2019-12-18 22:04:01,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:01,096 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 22:04:01,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145967468] [2019-12-18 22:04:01,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:01,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:04:01,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127585490] [2019-12-18 22:04:01,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:04:01,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:01,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:04:01,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:04:01,099 INFO L87 Difference]: Start difference. First operand 8836 states and 28954 transitions. Second operand 3 states. [2019-12-18 22:04:01,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:01,324 INFO L93 Difference]: Finished difference Result 12018 states and 39361 transitions. [2019-12-18 22:04:01,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:04:01,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 22:04:01,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:01,372 INFO L225 Difference]: With dead ends: 12018 [2019-12-18 22:04:01,372 INFO L226 Difference]: Without dead ends: 12018 [2019-12-18 22:04:01,373 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 22:04:01,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12018 states. [2019-12-18 22:04:01,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12018 to 11066. [2019-12-18 22:04:01,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11066 states. [2019-12-18 22:04:01,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11066 states to 11066 states and 36521 transitions. [2019-12-18 22:04:01,743 INFO L78 Accepts]: Start accepts. Automaton has 11066 states and 36521 transitions. Word has length 14 [2019-12-18 22:04:01,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:01,747 INFO L462 AbstractCegarLoop]: Abstraction has 11066 states and 36521 transitions. [2019-12-18 22:04:01,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:04:01,747 INFO L276 IsEmpty]: Start isEmpty. Operand 11066 states and 36521 transitions. [2019-12-18 22:04:01,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:04:01,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:01,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:01,750 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:01,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:01,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1979542058, now seen corresponding path program 1 times [2019-12-18 22:04:01,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:01,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885282337] [2019-12-18 22:04:01,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:01,832 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 22:04:01,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885282337] [2019-12-18 22:04:01,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:01,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:04:01,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688348545] [2019-12-18 22:04:01,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:04:01,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:01,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:04:01,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:04:01,838 INFO L87 Difference]: Start difference. First operand 11066 states and 36521 transitions. Second operand 4 states. [2019-12-18 22:04:02,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:02,166 INFO L93 Difference]: Finished difference Result 13296 states and 42892 transitions. [2019-12-18 22:04:02,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:04:02,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 22:04:02,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:02,216 INFO L225 Difference]: With dead ends: 13296 [2019-12-18 22:04:02,216 INFO L226 Difference]: Without dead ends: 13285 [2019-12-18 22:04:02,216 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 22:04:02,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13285 states. [2019-12-18 22:04:02,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13285 to 12030. [2019-12-18 22:04:02,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12030 states. [2019-12-18 22:04:02,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12030 states to 12030 states and 39340 transitions. [2019-12-18 22:04:02,581 INFO L78 Accepts]: Start accepts. Automaton has 12030 states and 39340 transitions. Word has length 14 [2019-12-18 22:04:02,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:02,581 INFO L462 AbstractCegarLoop]: Abstraction has 12030 states and 39340 transitions. [2019-12-18 22:04:02,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:04:02,582 INFO L276 IsEmpty]: Start isEmpty. Operand 12030 states and 39340 transitions. [2019-12-18 22:04:02,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:04:02,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:02,586 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:02,586 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:02,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:02,586 INFO L82 PathProgramCache]: Analyzing trace with hash 952302064, now seen corresponding path program 1 times [2019-12-18 22:04:02,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:02,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625176857] [2019-12-18 22:04:02,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:02,675 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 22:04:02,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625176857] [2019-12-18 22:04:02,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:02,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:04:02,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487112466] [2019-12-18 22:04:02,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:04:02,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:02,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:04:02,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:04:02,677 INFO L87 Difference]: Start difference. First operand 12030 states and 39340 transitions. Second operand 4 states. [2019-12-18 22:04:02,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:02,988 INFO L93 Difference]: Finished difference Result 14351 states and 46280 transitions. [2019-12-18 22:04:02,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:04:02,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 22:04:02,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:03,024 INFO L225 Difference]: With dead ends: 14351 [2019-12-18 22:04:03,025 INFO L226 Difference]: Without dead ends: 14338 [2019-12-18 22:04:03,025 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 22:04:03,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14338 states. [2019-12-18 22:04:03,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14338 to 12371. [2019-12-18 22:04:03,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12371 states. [2019-12-18 22:04:03,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12371 states to 12371 states and 40477 transitions. [2019-12-18 22:04:03,381 INFO L78 Accepts]: Start accepts. Automaton has 12371 states and 40477 transitions. Word has length 14 [2019-12-18 22:04:03,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:03,382 INFO L462 AbstractCegarLoop]: Abstraction has 12371 states and 40477 transitions. [2019-12-18 22:04:03,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:04:03,382 INFO L276 IsEmpty]: Start isEmpty. Operand 12371 states and 40477 transitions. [2019-12-18 22:04:03,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 22:04:03,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:03,387 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:03,387 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:03,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:03,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1929456170, now seen corresponding path program 1 times [2019-12-18 22:04:03,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:03,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545006579] [2019-12-18 22:04:03,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:03,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:03,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545006579] [2019-12-18 22:04:03,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:03,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:04:03,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115767057] [2019-12-18 22:04:03,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:04:03,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:03,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:04:03,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:04:03,444 INFO L87 Difference]: Start difference. First operand 12371 states and 40477 transitions. Second operand 3 states. [2019-12-18 22:04:03,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:03,493 INFO L93 Difference]: Finished difference Result 12224 states and 39993 transitions. [2019-12-18 22:04:03,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:04:03,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 22:04:03,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:04,125 INFO L225 Difference]: With dead ends: 12224 [2019-12-18 22:04:04,125 INFO L226 Difference]: Without dead ends: 12224 [2019-12-18 22:04:04,126 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 22:04:04,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12224 states. [2019-12-18 22:04:04,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12224 to 12224. [2019-12-18 22:04:04,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12224 states. [2019-12-18 22:04:04,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12224 states to 12224 states and 39993 transitions. [2019-12-18 22:04:04,425 INFO L78 Accepts]: Start accepts. Automaton has 12224 states and 39993 transitions. Word has length 16 [2019-12-18 22:04:04,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:04,425 INFO L462 AbstractCegarLoop]: Abstraction has 12224 states and 39993 transitions. [2019-12-18 22:04:04,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:04:04,425 INFO L276 IsEmpty]: Start isEmpty. Operand 12224 states and 39993 transitions. [2019-12-18 22:04:04,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 22:04:04,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:04,432 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:04,433 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:04,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:04,433 INFO L82 PathProgramCache]: Analyzing trace with hash 324203655, now seen corresponding path program 1 times [2019-12-18 22:04:04,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:04,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863947290] [2019-12-18 22:04:04,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:04,487 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 22:04:04,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863947290] [2019-12-18 22:04:04,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:04,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:04:04,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243456469] [2019-12-18 22:04:04,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:04:04,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:04,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:04:04,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:04:04,489 INFO L87 Difference]: Start difference. First operand 12224 states and 39993 transitions. Second operand 3 states. [2019-12-18 22:04:04,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:04,546 INFO L93 Difference]: Finished difference Result 11575 states and 37288 transitions. [2019-12-18 22:04:04,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:04:04,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-18 22:04:04,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:04,568 INFO L225 Difference]: With dead ends: 11575 [2019-12-18 22:04:04,568 INFO L226 Difference]: Without dead ends: 11575 [2019-12-18 22:04:04,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:04:04,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11575 states. [2019-12-18 22:04:04,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11575 to 11443. [2019-12-18 22:04:04,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11443 states. [2019-12-18 22:04:05,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11443 states to 11443 states and 36904 transitions. [2019-12-18 22:04:05,021 INFO L78 Accepts]: Start accepts. Automaton has 11443 states and 36904 transitions. Word has length 17 [2019-12-18 22:04:05,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:05,021 INFO L462 AbstractCegarLoop]: Abstraction has 11443 states and 36904 transitions. [2019-12-18 22:04:05,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:04:05,021 INFO L276 IsEmpty]: Start isEmpty. Operand 11443 states and 36904 transitions. [2019-12-18 22:04:05,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 22:04:05,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:05,028 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:05,029 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:05,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:05,029 INFO L82 PathProgramCache]: Analyzing trace with hash -2136099962, now seen corresponding path program 1 times [2019-12-18 22:04:05,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:05,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120324610] [2019-12-18 22:04:05,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:05,089 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 22:04:05,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120324610] [2019-12-18 22:04:05,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:05,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:04:05,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772360481] [2019-12-18 22:04:05,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:04:05,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:05,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:04:05,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:04:05,092 INFO L87 Difference]: Start difference. First operand 11443 states and 36904 transitions. Second operand 4 states. [2019-12-18 22:04:05,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:05,129 INFO L93 Difference]: Finished difference Result 2348 states and 6213 transitions. [2019-12-18 22:04:05,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:04:05,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 22:04:05,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:05,133 INFO L225 Difference]: With dead ends: 2348 [2019-12-18 22:04:05,133 INFO L226 Difference]: Without dead ends: 1670 [2019-12-18 22:04:05,133 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 22:04:05,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2019-12-18 22:04:05,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1670. [2019-12-18 22:04:05,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1670 states. [2019-12-18 22:04:05,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 4015 transitions. [2019-12-18 22:04:05,161 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 4015 transitions. Word has length 18 [2019-12-18 22:04:05,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:05,162 INFO L462 AbstractCegarLoop]: Abstraction has 1670 states and 4015 transitions. [2019-12-18 22:04:05,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:04:05,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 4015 transitions. [2019-12-18 22:04:05,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 22:04:05,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:05,165 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] [2019-12-18 22:04:05,165 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:05,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:05,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1556475985, now seen corresponding path program 1 times [2019-12-18 22:04:05,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:05,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020000463] [2019-12-18 22:04:05,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:05,199 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 22:04:05,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020000463] [2019-12-18 22:04:05,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:05,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:04:05,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009424115] [2019-12-18 22:04:05,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:04:05,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:05,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:04:05,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:04:05,201 INFO L87 Difference]: Start difference. First operand 1670 states and 4015 transitions. Second operand 3 states. [2019-12-18 22:04:05,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:05,253 INFO L93 Difference]: Finished difference Result 2134 states and 4852 transitions. [2019-12-18 22:04:05,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:04:05,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 22:04:05,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:05,257 INFO L225 Difference]: With dead ends: 2134 [2019-12-18 22:04:05,257 INFO L226 Difference]: Without dead ends: 2134 [2019-12-18 22:04:05,258 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 22:04:05,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2019-12-18 22:04:05,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 1555. [2019-12-18 22:04:05,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2019-12-18 22:04:05,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 3503 transitions. [2019-12-18 22:04:05,285 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 3503 transitions. Word has length 26 [2019-12-18 22:04:05,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:05,286 INFO L462 AbstractCegarLoop]: Abstraction has 1555 states and 3503 transitions. [2019-12-18 22:04:05,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:04:05,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 3503 transitions. [2019-12-18 22:04:05,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 22:04:05,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:05,289 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] [2019-12-18 22:04:05,289 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:05,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:05,290 INFO L82 PathProgramCache]: Analyzing trace with hash 118725068, now seen corresponding path program 1 times [2019-12-18 22:04:05,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:05,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011550054] [2019-12-18 22:04:05,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:05,378 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 22:04:05,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011550054] [2019-12-18 22:04:05,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:05,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:04:05,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713588972] [2019-12-18 22:04:05,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:04:05,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:05,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:04:05,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:04:05,382 INFO L87 Difference]: Start difference. First operand 1555 states and 3503 transitions. Second operand 5 states. [2019-12-18 22:04:05,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:05,570 INFO L93 Difference]: Finished difference Result 2150 states and 4849 transitions. [2019-12-18 22:04:05,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:04:05,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 22:04:05,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:05,573 INFO L225 Difference]: With dead ends: 2150 [2019-12-18 22:04:05,574 INFO L226 Difference]: Without dead ends: 2148 [2019-12-18 22:04:05,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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 22:04:05,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2019-12-18 22:04:05,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 1647. [2019-12-18 22:04:05,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1647 states. [2019-12-18 22:04:05,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 3725 transitions. [2019-12-18 22:04:05,603 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 3725 transitions. Word has length 26 [2019-12-18 22:04:05,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:05,604 INFO L462 AbstractCegarLoop]: Abstraction has 1647 states and 3725 transitions. [2019-12-18 22:04:05,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:04:05,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 3725 transitions. [2019-12-18 22:04:05,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 22:04:05,607 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:05,607 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] [2019-12-18 22:04:05,607 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:05,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:05,608 INFO L82 PathProgramCache]: Analyzing trace with hash -945954291, now seen corresponding path program 1 times [2019-12-18 22:04:05,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:05,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755258519] [2019-12-18 22:04:05,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:05,672 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 22:04:05,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755258519] [2019-12-18 22:04:05,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:05,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:04:05,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262097464] [2019-12-18 22:04:05,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:04:05,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:05,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:04:05,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:04:05,675 INFO L87 Difference]: Start difference. First operand 1647 states and 3725 transitions. Second operand 5 states. [2019-12-18 22:04:05,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:05,897 INFO L93 Difference]: Finished difference Result 2085 states and 4728 transitions. [2019-12-18 22:04:05,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:04:05,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 22:04:05,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:05,901 INFO L225 Difference]: With dead ends: 2085 [2019-12-18 22:04:05,901 INFO L226 Difference]: Without dead ends: 2083 [2019-12-18 22:04:05,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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 22:04:05,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2019-12-18 22:04:05,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 1574. [2019-12-18 22:04:05,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2019-12-18 22:04:05,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 3550 transitions. [2019-12-18 22:04:05,928 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 3550 transitions. Word has length 27 [2019-12-18 22:04:05,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:05,929 INFO L462 AbstractCegarLoop]: Abstraction has 1574 states and 3550 transitions. [2019-12-18 22:04:05,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:04:05,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 3550 transitions. [2019-12-18 22:04:05,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 22:04:05,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:05,934 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] [2019-12-18 22:04:05,935 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:05,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:05,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1929035231, now seen corresponding path program 1 times [2019-12-18 22:04:05,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:05,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685613360] [2019-12-18 22:04:05,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:06,043 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 22:04:06,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685613360] [2019-12-18 22:04:06,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:06,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:04:06,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139115582] [2019-12-18 22:04:06,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:04:06,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:06,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:04:06,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:04:06,046 INFO L87 Difference]: Start difference. First operand 1574 states and 3550 transitions. Second operand 5 states. [2019-12-18 22:04:06,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:06,097 INFO L93 Difference]: Finished difference Result 781 states and 1674 transitions. [2019-12-18 22:04:06,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:04:06,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 22:04:06,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:06,099 INFO L225 Difference]: With dead ends: 781 [2019-12-18 22:04:06,099 INFO L226 Difference]: Without dead ends: 707 [2019-12-18 22:04:06,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:04:06,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2019-12-18 22:04:06,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2019-12-18 22:04:06,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-12-18 22:04:06,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1503 transitions. [2019-12-18 22:04:06,109 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1503 transitions. Word has length 27 [2019-12-18 22:04:06,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:06,110 INFO L462 AbstractCegarLoop]: Abstraction has 707 states and 1503 transitions. [2019-12-18 22:04:06,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:04:06,110 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1503 transitions. [2019-12-18 22:04:06,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 22:04:06,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:06,113 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] [2019-12-18 22:04:06,113 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:06,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:06,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1133197983, now seen corresponding path program 1 times [2019-12-18 22:04:06,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:06,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005265286] [2019-12-18 22:04:06,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:06,215 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 22:04:06,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005265286] [2019-12-18 22:04:06,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:06,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:04:06,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543427181] [2019-12-18 22:04:06,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:04:06,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:06,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:04:06,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:04:06,217 INFO L87 Difference]: Start difference. First operand 707 states and 1503 transitions. Second operand 4 states. [2019-12-18 22:04:06,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:06,235 INFO L93 Difference]: Finished difference Result 1173 states and 2520 transitions. [2019-12-18 22:04:06,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:04:06,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-18 22:04:06,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:06,239 INFO L225 Difference]: With dead ends: 1173 [2019-12-18 22:04:06,239 INFO L226 Difference]: Without dead ends: 486 [2019-12-18 22:04:06,239 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 22:04:06,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-12-18 22:04:06,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2019-12-18 22:04:06,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2019-12-18 22:04:06,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1050 transitions. [2019-12-18 22:04:06,248 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1050 transitions. Word has length 42 [2019-12-18 22:04:06,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:06,248 INFO L462 AbstractCegarLoop]: Abstraction has 486 states and 1050 transitions. [2019-12-18 22:04:06,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:04:06,249 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1050 transitions. [2019-12-18 22:04:06,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 22:04:06,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:06,251 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] [2019-12-18 22:04:06,251 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:06,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:06,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1118913551, now seen corresponding path program 2 times [2019-12-18 22:04:06,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:06,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426479407] [2019-12-18 22:04:06,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:06,323 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 22:04:06,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426479407] [2019-12-18 22:04:06,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:06,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:04:06,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539712943] [2019-12-18 22:04:06,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:04:06,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:06,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:04:06,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:04:06,325 INFO L87 Difference]: Start difference. First operand 486 states and 1050 transitions. Second operand 7 states. [2019-12-18 22:04:06,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:06,503 INFO L93 Difference]: Finished difference Result 887 states and 1866 transitions. [2019-12-18 22:04:06,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 22:04:06,503 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-18 22:04:06,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:06,504 INFO L225 Difference]: With dead ends: 887 [2019-12-18 22:04:06,504 INFO L226 Difference]: Without dead ends: 593 [2019-12-18 22:04:06,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:04:06,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-12-18 22:04:06,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 527. [2019-12-18 22:04:06,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-12-18 22:04:06,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 1106 transitions. [2019-12-18 22:04:06,513 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 1106 transitions. Word has length 42 [2019-12-18 22:04:06,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:06,513 INFO L462 AbstractCegarLoop]: Abstraction has 527 states and 1106 transitions. [2019-12-18 22:04:06,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:04:06,513 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 1106 transitions. [2019-12-18 22:04:06,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 22:04:06,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:06,515 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] [2019-12-18 22:04:06,515 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:06,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:06,515 INFO L82 PathProgramCache]: Analyzing trace with hash -866328177, now seen corresponding path program 3 times [2019-12-18 22:04:06,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:06,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208725197] [2019-12-18 22:04:06,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:04:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:04:06,606 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:04:06,607 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:04:06,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$w_buff0~0_26) (= 0 v_~y$read_delayed_var~0.base_6) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~__unbuffered_p0_EAX~0_13) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~y$r_buff1_thd1~0_37) (= 0 v_~y$r_buff1_thd0~0_20) (= 0 v_~__unbuffered_cnt~0_15) (= |v_#NULL.offset_6| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1659~0.base_19| 1) |v_#valid_38|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1659~0.base_19|) 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1659~0.base_19|) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd2~0_26 0) (= 0 v_~y$w_buff0_used~0_93) (= v_~y$w_buff1_used~0_54 0) (= v_~x~0_10 0) (= 0 v_~y$w_buff1~0_21) (= v_~y$r_buff0_thd0~0_22 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1659~0.base_19| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1659~0.base_19|) |v_ULTIMATE.start_main_~#t1659~0.offset_17| 0)) |v_#memory_int_11|) (= 0 v_~y$flush_delayed~0_13) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~y~0_22 0) (= 0 v_~weak$$choice0~0_7) (= v_~y$r_buff0_thd1~0_65 0) (= 0 v_~y$r_buff1_thd2~0_17) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1659~0.base_19| 4)) (= 0 v_~z~0_8) (= v_~y$mem_tmp~0_10 0) (= v_~__unbuffered_p1_EBX~0_13 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 |v_ULTIMATE.start_main_~#t1659~0.offset_17|) (= v_~main$tmp_guard1~0_12 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_7|, ULTIMATE.start_main_~#t1660~0.offset=|v_ULTIMATE.start_main_~#t1660~0.offset_17|, ULTIMATE.start_main_~#t1660~0.base=|v_ULTIMATE.start_main_~#t1660~0.base_22|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_37, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_65, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_13|, ~y~0=v_~y~0_22, ULTIMATE.start_main_~#t1659~0.offset=|v_ULTIMATE.start_main_~#t1659~0.offset_17|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_18|, ULTIMATE.start_main_~#t1659~0.base=|v_ULTIMATE.start_main_~#t1659~0.base_19|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_10|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_10|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~y$w_buff1~0=v_~y$w_buff1~0_21, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_22, #valid=|v_#valid_38|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~z~0=v_~z~0_8, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_20, ~x~0=v_~x~0_10, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1660~0.offset, ULTIMATE.start_main_~#t1660~0.base, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1659~0.offset, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1659~0.base, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 22:04:06,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L802-1-->L804: Formula: (and (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1660~0.base_9| 1) |v_#valid_19|) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1660~0.base_9|)) (not (= 0 |v_ULTIMATE.start_main_~#t1660~0.base_9|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1660~0.base_9| 4) |v_#length_9|) (= |v_ULTIMATE.start_main_~#t1660~0.offset_8| 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1660~0.base_9|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1660~0.base_9| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1660~0.base_9|) |v_ULTIMATE.start_main_~#t1660~0.offset_8| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1660~0.offset=|v_ULTIMATE.start_main_~#t1660~0.offset_8|, ULTIMATE.start_main_~#t1660~0.base=|v_ULTIMATE.start_main_~#t1660~0.base_9|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1660~0.offset, ULTIMATE.start_main_~#t1660~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 22:04:06,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L5-->L779: Formula: (and (= v_~y$r_buff0_thd1~0_53 v_~y$r_buff1_thd1~0_28) (= v_~y$r_buff0_thd2~0_21 v_~y$r_buff1_thd2~0_11) (= v_~__unbuffered_p1_EBX~0_5 v_~x~0_5) (= v_~y$r_buff0_thd0~0_17 v_~y$r_buff1_thd0~0_11) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p1_EAX~0_5 v_~z~0_4) (= 1 v_~z~0_4) (= v_~y$r_buff0_thd2~0_20 1)) InVars {P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~x~0=v_~x~0_5} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_11, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_5, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_5, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_20, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~z~0=v_~z~0_4, ~x~0=v_~x~0_5, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 22:04:06,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1724702865 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1724702865 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-1724702865| ~y$w_buff0_used~0_In-1724702865)) (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-1724702865|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1724702865, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1724702865} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1724702865, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1724702865, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1724702865|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 22:04:06,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1020167267 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1020167267 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1020167267 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1020167267 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-1020167267|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-1020167267 |P1Thread1of1ForFork0_#t~ite29_Out-1020167267|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1020167267, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1020167267, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1020167267, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1020167267} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1020167267, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1020167267, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1020167267, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1020167267|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1020167267} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 22:04:06,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L782-->L783: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1710622288 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1710622288 256) 0))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd2~0_Out-1710622288) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In-1710622288 ~y$r_buff0_thd2~0_Out-1710622288)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1710622288, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1710622288} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1710622288, P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1710622288|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1710622288} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 22:04:06,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L742-->L742-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1110209323 256)))) (or (and (= ~y$w_buff1_used~0_In1110209323 |P0Thread1of1ForFork1_#t~ite17_Out1110209323|) (= |P0Thread1of1ForFork1_#t~ite18_Out1110209323| |P0Thread1of1ForFork1_#t~ite17_Out1110209323|) (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In1110209323 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd1~0_In1110209323 256)) .cse0) (= 0 (mod ~y$w_buff0_used~0_In1110209323 256)) (and (= 0 (mod ~y$w_buff1_used~0_In1110209323 256)) .cse0))) .cse1) (and (not .cse1) (= |P0Thread1of1ForFork1_#t~ite17_In1110209323| |P0Thread1of1ForFork1_#t~ite17_Out1110209323|) (= |P0Thread1of1ForFork1_#t~ite18_Out1110209323| ~y$w_buff1_used~0_In1110209323)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1110209323, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1110209323, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1110209323, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_In1110209323|, ~weak$$choice2~0=~weak$$choice2~0_In1110209323, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1110209323} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1110209323, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1110209323, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1110209323, P0Thread1of1ForFork1_#t~ite18=|P0Thread1of1ForFork1_#t~ite18_Out1110209323|, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_Out1110209323|, ~weak$$choice2~0=~weak$$choice2~0_In1110209323, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1110209323} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite18, P0Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-18 22:04:06,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L743-->L744: Formula: (and (= v_~y$r_buff0_thd1~0_47 v_~y$r_buff0_thd1~0_46) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_10|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_9|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 22:04:06,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [599] [599] L746-->L754: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_16 v_~y$mem_tmp~0_4) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-18 22:04:06,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1533578757 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In1533578757 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1533578757 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1533578757 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out1533578757| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out1533578757| ~y$r_buff1_thd2~0_In1533578757) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1533578757, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1533578757, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1533578757, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1533578757} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1533578757, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1533578757, P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1533578757|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1533578757, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1533578757} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 22:04:06,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L783-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 22:04:06,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [581] [581] L808-->L810-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= 0 (mod v_~y$w_buff0_used~0_62 256)) (= (mod v_~y$r_buff0_thd0~0_15 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_62, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_62, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 22:04:06,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L810-2-->L810-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In2093609259 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In2093609259 256)))) (or (and (= ~y~0_In2093609259 |ULTIMATE.start_main_#t~ite34_Out2093609259|) (or .cse0 .cse1)) (and (= ~y$w_buff1~0_In2093609259 |ULTIMATE.start_main_#t~ite34_Out2093609259|) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2093609259, ~y~0=~y~0_In2093609259, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2093609259, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2093609259} OutVars{~y$w_buff1~0=~y$w_buff1~0_In2093609259, ~y~0=~y~0_In2093609259, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2093609259, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out2093609259|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2093609259} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 22:04:06,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [569] [569] L810-4-->L811: Formula: (= v_~y~0_13 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~y~0=v_~y~0_13, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 22:04:06,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1263658078 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1263658078 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite36_Out-1263658078|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1263658078 |ULTIMATE.start_main_#t~ite36_Out-1263658078|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1263658078, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1263658078} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1263658078, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1263658078, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1263658078|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 22:04:06,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In286604292 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In286604292 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In286604292 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In286604292 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out286604292| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite37_Out286604292| ~y$w_buff1_used~0_In286604292) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In286604292, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In286604292, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In286604292, ~y$w_buff1_used~0=~y$w_buff1_used~0_In286604292} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In286604292, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In286604292, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out286604292|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In286604292, ~y$w_buff1_used~0=~y$w_buff1_used~0_In286604292} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 22:04:06,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In754189586 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In754189586 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out754189586| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite38_Out754189586| ~y$r_buff0_thd0~0_In754189586)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In754189586, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In754189586} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In754189586, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In754189586, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out754189586|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 22:04:06,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L814-->L814-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In1458650778 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1458650778 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1458650778 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1458650778 256)))) (or (and (= ~y$r_buff1_thd0~0_In1458650778 |ULTIMATE.start_main_#t~ite39_Out1458650778|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite39_Out1458650778| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1458650778, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1458650778, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1458650778, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1458650778} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1458650778, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1458650778|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1458650778, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1458650778, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1458650778} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 22:04:06,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~__unbuffered_p0_EAX~0_9 0) (= v_~main$tmp_guard1~0_8 0) (= |v_ULTIMATE.start_main_#t~ite39_12| v_~y$r_buff1_thd0~0_15) (= 1 v_~__unbuffered_p1_EAX~0_9) (= 0 v_~__unbuffered_p1_EBX~0_9)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_12|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:04:06,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:04:06 BasicIcfg [2019-12-18 22:04:06,790 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:04:06,792 INFO L168 Benchmark]: Toolchain (without parser) took 13413.75 ms. Allocated memory was 146.3 MB in the beginning and 714.6 MB in the end (delta: 568.3 MB). Free memory was 101.0 MB in the beginning and 565.5 MB in the end (delta: -464.5 MB). Peak memory consumption was 436.7 MB. Max. memory is 7.1 GB. [2019-12-18 22:04:06,794 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 146.3 MB. Free memory is still 121.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 22:04:06,795 INFO L168 Benchmark]: CACSL2BoogieTranslator took 810.65 ms. Allocated memory was 146.3 MB in the beginning and 205.0 MB in the end (delta: 58.7 MB). Free memory was 100.5 MB in the beginning and 158.9 MB in the end (delta: -58.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-12-18 22:04:06,796 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.12 ms. Allocated memory is still 205.0 MB. Free memory was 158.9 MB in the beginning and 156.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 22:04:06,797 INFO L168 Benchmark]: Boogie Preprocessor took 35.36 ms. Allocated memory is still 205.0 MB. Free memory was 156.0 MB in the beginning and 154.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 22:04:06,800 INFO L168 Benchmark]: RCFGBuilder took 755.93 ms. Allocated memory is still 205.0 MB. Free memory was 154.1 MB in the beginning and 112.7 MB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. [2019-12-18 22:04:06,801 INFO L168 Benchmark]: TraceAbstraction took 11741.67 ms. Allocated memory was 205.0 MB in the beginning and 714.6 MB in the end (delta: 509.6 MB). Free memory was 112.7 MB in the beginning and 565.5 MB in the end (delta: -452.8 MB). Peak memory consumption was 389.8 MB. Max. memory is 7.1 GB. [2019-12-18 22:04:06,808 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.19 ms. Allocated memory is still 146.3 MB. Free memory is still 121.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 810.65 ms. Allocated memory was 146.3 MB in the beginning and 205.0 MB in the end (delta: 58.7 MB). Free memory was 100.5 MB in the beginning and 158.9 MB in the end (delta: -58.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.12 ms. Allocated memory is still 205.0 MB. Free memory was 158.9 MB in the beginning and 156.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.36 ms. Allocated memory is still 205.0 MB. Free memory was 156.0 MB in the beginning and 154.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 755.93 ms. Allocated memory is still 205.0 MB. Free memory was 154.1 MB in the beginning and 112.7 MB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11741.67 ms. Allocated memory was 205.0 MB in the beginning and 714.6 MB in the end (delta: 509.6 MB). Free memory was 112.7 MB in the beginning and 565.5 MB in the end (delta: -452.8 MB). Peak memory consumption was 389.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 137 ProgramPointsBefore, 69 ProgramPointsAfterwards, 165 TransitionsBefore, 81 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 19 ChoiceCompositions, 4208 VarBasedMoverChecksPositive, 150 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 41237 CheckedPairsTotal, 97 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1659, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1660, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.3s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1455 SDtfs, 1349 SDslu, 2147 SDs, 0 SdLazy, 889 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12371occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 6871 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 341 NumberOfCodeBlocks, 341 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 285 ConstructedInterpolants, 0 QuantifiedInterpolants, 20852 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...