/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix034_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:13:06,050 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:13:06,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:13:06,065 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:13:06,065 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:13:06,066 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:13:06,067 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:13:06,069 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:13:06,071 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:13:06,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:13:06,073 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:13:06,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:13:06,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:13:06,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:13:06,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:13:06,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:13:06,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:13:06,079 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:13:06,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:13:06,082 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:13:06,084 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:13:06,085 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:13:06,086 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:13:06,087 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:13:06,089 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:13:06,089 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:13:06,090 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:13:06,091 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:13:06,091 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:13:06,092 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:13:06,092 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:13:06,093 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:13:06,094 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:13:06,095 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:13:06,096 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:13:06,096 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:13:06,096 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:13:06,097 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:13:06,097 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:13:06,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:13:06,101 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:13:06,103 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:13:06,128 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:13:06,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:13:06,130 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:13:06,130 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:13:06,131 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:13:06,131 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:13:06,131 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:13:06,131 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:13:06,131 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:13:06,132 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:13:06,133 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:13:06,133 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:13:06,133 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:13:06,133 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:13:06,134 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:13:06,134 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:13:06,134 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:13:06,134 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:13:06,134 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:13:06,135 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:13:06,135 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:13:06,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:13:06,135 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:13:06,136 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:13:06,136 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:13:06,136 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:13:06,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:13:06,136 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:13:06,137 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:13:06,431 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:13:06,455 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:13:06,458 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:13:06,460 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:13:06,460 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:13:06,461 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_pso.opt.i [2019-12-18 17:13:06,533 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15448ab20/41e8b14ec50445f9a04b02baf422d044/FLAG71533ed1a [2019-12-18 17:13:07,071 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:13:07,072 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_pso.opt.i [2019-12-18 17:13:07,092 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15448ab20/41e8b14ec50445f9a04b02baf422d044/FLAG71533ed1a [2019-12-18 17:13:07,420 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15448ab20/41e8b14ec50445f9a04b02baf422d044 [2019-12-18 17:13:07,429 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:13:07,431 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:13:07,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:13:07,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:13:07,436 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:13:07,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:13:07" (1/1) ... [2019-12-18 17:13:07,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e483e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:07, skipping insertion in model container [2019-12-18 17:13:07,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:13:07" (1/1) ... [2019-12-18 17:13:07,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:13:07,513 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:13:08,013 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:13:08,031 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:13:08,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:13:08,187 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:13:08,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:08 WrapperNode [2019-12-18 17:13:08,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:13:08,189 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:13:08,189 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:13:08,189 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:13:08,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:08" (1/1) ... [2019-12-18 17:13:08,217 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:08" (1/1) ... [2019-12-18 17:13:08,249 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:13:08,249 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:13:08,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:13:08,250 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:13:08,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:08" (1/1) ... [2019-12-18 17:13:08,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:08" (1/1) ... [2019-12-18 17:13:08,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:08" (1/1) ... [2019-12-18 17:13:08,263 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:08" (1/1) ... [2019-12-18 17:13:08,272 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:08" (1/1) ... [2019-12-18 17:13:08,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:08" (1/1) ... [2019-12-18 17:13:08,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:08" (1/1) ... [2019-12-18 17:13:08,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:13:08,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:13:08,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:13:08,284 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:13:08,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:13:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:13:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:13:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:13:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:13:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:13:08,365 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:13:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:13:08,366 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:13:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:13:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:13:08,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:13:08,368 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 17:13:09,114 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:13:09,114 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:13:09,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:13:09 BoogieIcfgContainer [2019-12-18 17:13:09,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:13:09,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:13:09,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:13:09,120 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:13:09,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:13:07" (1/3) ... [2019-12-18 17:13:09,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bdf61fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:13:09, skipping insertion in model container [2019-12-18 17:13:09,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:08" (2/3) ... [2019-12-18 17:13:09,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bdf61fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:13:09, skipping insertion in model container [2019-12-18 17:13:09,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:13:09" (3/3) ... [2019-12-18 17:13:09,124 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_pso.opt.i [2019-12-18 17:13:09,135 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:13:09,135 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:13:09,144 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:13:09,145 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:13:09,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,185 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,186 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,214 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,214 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,215 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,215 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,215 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,226 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,227 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,227 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,233 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,234 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:09,253 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 17:13:09,271 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:13:09,272 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:13:09,272 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:13:09,272 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:13:09,272 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:13:09,272 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:13:09,272 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:13:09,273 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:13:09,289 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 165 transitions [2019-12-18 17:13:09,290 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-18 17:13:09,393 INFO L126 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-18 17:13:09,393 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:13:09,410 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 343 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 17:13:09,426 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-18 17:13:09,474 INFO L126 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-18 17:13:09,474 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:13:09,479 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 343 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 17:13:09,492 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-18 17:13:09,494 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:13:13,600 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-18 17:13:13,705 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-18 17:13:14,122 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 17:13:14,225 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 17:13:14,371 INFO L206 etLargeBlockEncoding]: Checked pairs total: 45287 [2019-12-18 17:13:14,372 INFO L214 etLargeBlockEncoding]: Total number of compositions: 103 [2019-12-18 17:13:14,375 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 80 transitions [2019-12-18 17:13:14,695 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6574 states. [2019-12-18 17:13:14,697 INFO L276 IsEmpty]: Start isEmpty. Operand 6574 states. [2019-12-18 17:13:14,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 17:13:14,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:14,704 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 17:13:14,704 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:14,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:14,710 INFO L82 PathProgramCache]: Analyzing trace with hash 679710407, now seen corresponding path program 1 times [2019-12-18 17:13:14,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:14,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16330757] [2019-12-18 17:13:14,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:14,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:13:14,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16330757] [2019-12-18 17:13:14,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:14,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:13:14,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086753684] [2019-12-18 17:13:14,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:13:14,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:14,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:13:14,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:13:14,945 INFO L87 Difference]: Start difference. First operand 6574 states. Second operand 3 states. [2019-12-18 17:13:15,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:15,210 INFO L93 Difference]: Finished difference Result 6414 states and 21820 transitions. [2019-12-18 17:13:15,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:13:15,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 17:13:15,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:15,332 INFO L225 Difference]: With dead ends: 6414 [2019-12-18 17:13:15,332 INFO L226 Difference]: Without dead ends: 6042 [2019-12-18 17:13:15,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:13:15,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2019-12-18 17:13:15,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 6042. [2019-12-18 17:13:15,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6042 states. [2019-12-18 17:13:15,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6042 states to 6042 states and 20517 transitions. [2019-12-18 17:13:15,777 INFO L78 Accepts]: Start accepts. Automaton has 6042 states and 20517 transitions. Word has length 5 [2019-12-18 17:13:15,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:15,777 INFO L462 AbstractCegarLoop]: Abstraction has 6042 states and 20517 transitions. [2019-12-18 17:13:15,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:13:15,778 INFO L276 IsEmpty]: Start isEmpty. Operand 6042 states and 20517 transitions. [2019-12-18 17:13:15,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 17:13:15,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:15,785 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:13:15,786 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:15,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:15,794 INFO L82 PathProgramCache]: Analyzing trace with hash 200851233, now seen corresponding path program 1 times [2019-12-18 17:13:15,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:15,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632097750] [2019-12-18 17:13:15,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:15,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:13:15,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632097750] [2019-12-18 17:13:15,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:15,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:13:15,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229377670] [2019-12-18 17:13:15,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:13:15,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:15,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:13:15,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:13:15,892 INFO L87 Difference]: Start difference. First operand 6042 states and 20517 transitions. Second operand 3 states. [2019-12-18 17:13:15,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:15,930 INFO L93 Difference]: Finished difference Result 1215 states and 3038 transitions. [2019-12-18 17:13:15,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:13:15,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 17:13:15,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:15,938 INFO L225 Difference]: With dead ends: 1215 [2019-12-18 17:13:15,938 INFO L226 Difference]: Without dead ends: 1215 [2019-12-18 17:13:15,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:13:15,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2019-12-18 17:13:16,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1215. [2019-12-18 17:13:16,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1215 states. [2019-12-18 17:13:16,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 3038 transitions. [2019-12-18 17:13:16,049 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 3038 transitions. Word has length 11 [2019-12-18 17:13:16,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:16,049 INFO L462 AbstractCegarLoop]: Abstraction has 1215 states and 3038 transitions. [2019-12-18 17:13:16,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:13:16,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 3038 transitions. [2019-12-18 17:13:16,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 17:13:16,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:16,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:13:16,060 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:16,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:16,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1157318615, now seen corresponding path program 1 times [2019-12-18 17:13:16,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:16,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329820898] [2019-12-18 17:13:16,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:16,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:13:16,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329820898] [2019-12-18 17:13:16,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:16,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:13:16,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294330422] [2019-12-18 17:13:16,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:13:16,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:16,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:13:16,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:13:16,188 INFO L87 Difference]: Start difference. First operand 1215 states and 3038 transitions. Second operand 3 states. [2019-12-18 17:13:16,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:16,278 INFO L93 Difference]: Finished difference Result 1816 states and 4607 transitions. [2019-12-18 17:13:16,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:13:16,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 17:13:16,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:16,289 INFO L225 Difference]: With dead ends: 1816 [2019-12-18 17:13:16,290 INFO L226 Difference]: Without dead ends: 1816 [2019-12-18 17:13:16,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:13:16,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2019-12-18 17:13:16,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1358. [2019-12-18 17:13:16,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2019-12-18 17:13:16,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 3466 transitions. [2019-12-18 17:13:16,337 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 3466 transitions. Word has length 14 [2019-12-18 17:13:16,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:16,337 INFO L462 AbstractCegarLoop]: Abstraction has 1358 states and 3466 transitions. [2019-12-18 17:13:16,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:13:16,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 3466 transitions. [2019-12-18 17:13:16,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 17:13:16,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:16,339 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:13:16,339 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:16,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:16,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1294893453, now seen corresponding path program 1 times [2019-12-18 17:13:16,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:16,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972137252] [2019-12-18 17:13:16,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:13:16,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972137252] [2019-12-18 17:13:16,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:16,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:13:16,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957189765] [2019-12-18 17:13:16,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:13:16,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:16,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:13:16,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:13:16,434 INFO L87 Difference]: Start difference. First operand 1358 states and 3466 transitions. Second operand 4 states. [2019-12-18 17:13:16,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:16,611 INFO L93 Difference]: Finished difference Result 1779 states and 4379 transitions. [2019-12-18 17:13:16,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:13:16,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 17:13:16,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:16,622 INFO L225 Difference]: With dead ends: 1779 [2019-12-18 17:13:16,622 INFO L226 Difference]: Without dead ends: 1779 [2019-12-18 17:13:16,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:13:16,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2019-12-18 17:13:16,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1647. [2019-12-18 17:13:16,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1647 states. [2019-12-18 17:13:16,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 4084 transitions. [2019-12-18 17:13:16,668 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 4084 transitions. Word has length 14 [2019-12-18 17:13:16,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:16,669 INFO L462 AbstractCegarLoop]: Abstraction has 1647 states and 4084 transitions. [2019-12-18 17:13:16,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:13:16,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 4084 transitions. [2019-12-18 17:13:16,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 17:13:16,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:16,670 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:13:16,670 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:16,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:16,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1889466766, now seen corresponding path program 1 times [2019-12-18 17:13:16,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:16,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997970844] [2019-12-18 17:13:16,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:16,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:13:16,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997970844] [2019-12-18 17:13:16,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:16,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:13:16,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977512812] [2019-12-18 17:13:16,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:13:16,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:16,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:13:16,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:13:16,736 INFO L87 Difference]: Start difference. First operand 1647 states and 4084 transitions. Second operand 4 states. [2019-12-18 17:13:16,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:16,894 INFO L93 Difference]: Finished difference Result 2092 states and 5077 transitions. [2019-12-18 17:13:16,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:13:16,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 17:13:16,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:16,906 INFO L225 Difference]: With dead ends: 2092 [2019-12-18 17:13:16,907 INFO L226 Difference]: Without dead ends: 2092 [2019-12-18 17:13:16,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:13:16,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2092 states. [2019-12-18 17:13:16,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2092 to 1708. [2019-12-18 17:13:16,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1708 states. [2019-12-18 17:13:16,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 4235 transitions. [2019-12-18 17:13:16,949 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 4235 transitions. Word has length 14 [2019-12-18 17:13:16,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:16,949 INFO L462 AbstractCegarLoop]: Abstraction has 1708 states and 4235 transitions. [2019-12-18 17:13:16,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:13:16,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 4235 transitions. [2019-12-18 17:13:16,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 17:13:16,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:16,952 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:13:16,953 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:16,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:16,953 INFO L82 PathProgramCache]: Analyzing trace with hash 2125431703, now seen corresponding path program 1 times [2019-12-18 17:13:16,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:16,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563029333] [2019-12-18 17:13:16,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:17,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:13:17,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563029333] [2019-12-18 17:13:17,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:17,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:13:17,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764145854] [2019-12-18 17:13:17,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:13:17,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:17,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:13:17,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:13:17,068 INFO L87 Difference]: Start difference. First operand 1708 states and 4235 transitions. Second operand 5 states. [2019-12-18 17:13:17,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:17,428 INFO L93 Difference]: Finished difference Result 2525 states and 6119 transitions. [2019-12-18 17:13:17,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:13:17,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 17:13:17,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:17,446 INFO L225 Difference]: With dead ends: 2525 [2019-12-18 17:13:17,446 INFO L226 Difference]: Without dead ends: 2525 [2019-12-18 17:13:17,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:13:17,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2525 states. [2019-12-18 17:13:17,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2525 to 2074. [2019-12-18 17:13:17,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2074 states. [2019-12-18 17:13:17,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 5075 transitions. [2019-12-18 17:13:17,540 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 5075 transitions. Word has length 26 [2019-12-18 17:13:17,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:17,540 INFO L462 AbstractCegarLoop]: Abstraction has 2074 states and 5075 transitions. [2019-12-18 17:13:17,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:13:17,541 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 5075 transitions. [2019-12-18 17:13:17,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 17:13:17,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:17,544 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 17:13:17,545 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:17,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:17,545 INFO L82 PathProgramCache]: Analyzing trace with hash -2116463787, now seen corresponding path program 1 times [2019-12-18 17:13:17,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:17,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287472416] [2019-12-18 17:13:17,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:17,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:13:17,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287472416] [2019-12-18 17:13:17,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:17,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:13:17,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118104249] [2019-12-18 17:13:17,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:13:17,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:17,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:13:17,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:13:17,586 INFO L87 Difference]: Start difference. First operand 2074 states and 5075 transitions. Second operand 3 states. [2019-12-18 17:13:17,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:17,632 INFO L93 Difference]: Finished difference Result 2628 states and 6059 transitions. [2019-12-18 17:13:17,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:13:17,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 17:13:17,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:17,644 INFO L225 Difference]: With dead ends: 2628 [2019-12-18 17:13:17,644 INFO L226 Difference]: Without dead ends: 2628 [2019-12-18 17:13:17,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:13:17,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2628 states. [2019-12-18 17:13:17,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2628 to 1998. [2019-12-18 17:13:17,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-18 17:13:17,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 4533 transitions. [2019-12-18 17:13:17,695 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 4533 transitions. Word has length 26 [2019-12-18 17:13:17,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:17,695 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 4533 transitions. [2019-12-18 17:13:17,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:13:17,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 4533 transitions. [2019-12-18 17:13:17,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 17:13:17,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:17,699 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 17:13:17,699 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:17,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:17,700 INFO L82 PathProgramCache]: Analyzing trace with hash 474142059, now seen corresponding path program 1 times [2019-12-18 17:13:17,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:17,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998416106] [2019-12-18 17:13:17,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:17,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:13:17,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998416106] [2019-12-18 17:13:17,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:17,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:13:17,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811900722] [2019-12-18 17:13:17,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:13:17,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:17,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:13:17,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:13:17,739 INFO L87 Difference]: Start difference. First operand 1998 states and 4533 transitions. Second operand 4 states. [2019-12-18 17:13:17,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:17,758 INFO L93 Difference]: Finished difference Result 1020 states and 2119 transitions. [2019-12-18 17:13:17,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:13:17,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-18 17:13:17,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:17,762 INFO L225 Difference]: With dead ends: 1020 [2019-12-18 17:13:17,762 INFO L226 Difference]: Without dead ends: 1020 [2019-12-18 17:13:17,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:13:17,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2019-12-18 17:13:17,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 916. [2019-12-18 17:13:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-12-18 17:13:17,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1920 transitions. [2019-12-18 17:13:17,782 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1920 transitions. Word has length 26 [2019-12-18 17:13:17,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:17,782 INFO L462 AbstractCegarLoop]: Abstraction has 916 states and 1920 transitions. [2019-12-18 17:13:17,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:13:17,783 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1920 transitions. [2019-12-18 17:13:17,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 17:13:17,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:17,785 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] [2019-12-18 17:13:17,786 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:17,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:17,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1317237189, now seen corresponding path program 1 times [2019-12-18 17:13:17,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:17,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273052357] [2019-12-18 17:13:17,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:17,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:13:17,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273052357] [2019-12-18 17:13:17,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:17,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:13:17,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723895726] [2019-12-18 17:13:17,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:13:17,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:17,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:13:17,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:13:17,882 INFO L87 Difference]: Start difference. First operand 916 states and 1920 transitions. Second operand 7 states. [2019-12-18 17:13:18,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:18,165 INFO L93 Difference]: Finished difference Result 2427 states and 4936 transitions. [2019-12-18 17:13:18,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 17:13:18,165 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-18 17:13:18,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:18,170 INFO L225 Difference]: With dead ends: 2427 [2019-12-18 17:13:18,170 INFO L226 Difference]: Without dead ends: 1586 [2019-12-18 17:13:18,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 17:13:18,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2019-12-18 17:13:18,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 999. [2019-12-18 17:13:18,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 999 states. [2019-12-18 17:13:18,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 2081 transitions. [2019-12-18 17:13:18,200 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 2081 transitions. Word has length 41 [2019-12-18 17:13:18,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:18,201 INFO L462 AbstractCegarLoop]: Abstraction has 999 states and 2081 transitions. [2019-12-18 17:13:18,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:13:18,201 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 2081 transitions. [2019-12-18 17:13:18,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 17:13:18,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:18,204 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] [2019-12-18 17:13:18,205 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:18,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:18,205 INFO L82 PathProgramCache]: Analyzing trace with hash 2142063769, now seen corresponding path program 2 times [2019-12-18 17:13:18,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:18,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208008624] [2019-12-18 17:13:18,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:18,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:13:18,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208008624] [2019-12-18 17:13:18,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:18,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:13:18,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609860573] [2019-12-18 17:13:18,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:13:18,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:18,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:13:18,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:13:18,263 INFO L87 Difference]: Start difference. First operand 999 states and 2081 transitions. Second operand 4 states. [2019-12-18 17:13:18,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:18,281 INFO L93 Difference]: Finished difference Result 1698 states and 3532 transitions. [2019-12-18 17:13:18,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:13:18,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-18 17:13:18,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:18,284 INFO L225 Difference]: With dead ends: 1698 [2019-12-18 17:13:18,285 INFO L226 Difference]: Without dead ends: 727 [2019-12-18 17:13:18,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:13:18,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-12-18 17:13:18,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2019-12-18 17:13:18,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-12-18 17:13:18,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1499 transitions. [2019-12-18 17:13:18,299 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1499 transitions. Word has length 41 [2019-12-18 17:13:18,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:18,300 INFO L462 AbstractCegarLoop]: Abstraction has 727 states and 1499 transitions. [2019-12-18 17:13:18,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:13:18,300 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1499 transitions. [2019-12-18 17:13:18,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 17:13:18,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:18,302 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] [2019-12-18 17:13:18,303 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:18,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:18,303 INFO L82 PathProgramCache]: Analyzing trace with hash 845117651, now seen corresponding path program 3 times [2019-12-18 17:13:18,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:18,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913808032] [2019-12-18 17:13:18,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:18,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:13:18,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913808032] [2019-12-18 17:13:18,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:18,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:13:18,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106561402] [2019-12-18 17:13:18,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:13:18,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:18,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:13:18,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:13:18,397 INFO L87 Difference]: Start difference. First operand 727 states and 1499 transitions. Second operand 7 states. [2019-12-18 17:13:18,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:18,593 INFO L93 Difference]: Finished difference Result 1196 states and 2405 transitions. [2019-12-18 17:13:18,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 17:13:18,594 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-18 17:13:18,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:18,596 INFO L225 Difference]: With dead ends: 1196 [2019-12-18 17:13:18,596 INFO L226 Difference]: Without dead ends: 768 [2019-12-18 17:13:18,597 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 17:13:18,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2019-12-18 17:13:18,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 715. [2019-12-18 17:13:18,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-12-18 17:13:18,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1473 transitions. [2019-12-18 17:13:18,612 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1473 transitions. Word has length 41 [2019-12-18 17:13:18,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:18,612 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 1473 transitions. [2019-12-18 17:13:18,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:13:18,612 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1473 transitions. [2019-12-18 17:13:18,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 17:13:18,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:18,615 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] [2019-12-18 17:13:18,615 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:18,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:18,615 INFO L82 PathProgramCache]: Analyzing trace with hash -624248203, now seen corresponding path program 4 times [2019-12-18 17:13:18,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:18,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358862085] [2019-12-18 17:13:18,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:18,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:13:18,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358862085] [2019-12-18 17:13:18,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:18,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:13:18,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650052333] [2019-12-18 17:13:18,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:13:18,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:18,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:13:18,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:13:18,727 INFO L87 Difference]: Start difference. First operand 715 states and 1473 transitions. Second operand 6 states. [2019-12-18 17:13:19,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:19,140 INFO L93 Difference]: Finished difference Result 840 states and 1706 transitions. [2019-12-18 17:13:19,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:13:19,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 17:13:19,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:19,144 INFO L225 Difference]: With dead ends: 840 [2019-12-18 17:13:19,144 INFO L226 Difference]: Without dead ends: 840 [2019-12-18 17:13:19,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:13:19,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2019-12-18 17:13:19,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 745. [2019-12-18 17:13:19,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-12-18 17:13:19,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1528 transitions. [2019-12-18 17:13:19,159 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1528 transitions. Word has length 41 [2019-12-18 17:13:19,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:19,159 INFO L462 AbstractCegarLoop]: Abstraction has 745 states and 1528 transitions. [2019-12-18 17:13:19,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:13:19,160 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1528 transitions. [2019-12-18 17:13:19,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 17:13:19,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:19,162 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] [2019-12-18 17:13:19,162 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:19,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:19,163 INFO L82 PathProgramCache]: Analyzing trace with hash -723073613, now seen corresponding path program 5 times [2019-12-18 17:13:19,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:19,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342044416] [2019-12-18 17:13:19,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:19,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:13:19,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342044416] [2019-12-18 17:13:19,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:19,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:13:19,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748431192] [2019-12-18 17:13:19,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:13:19,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:19,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:13:19,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:13:19,220 INFO L87 Difference]: Start difference. First operand 745 states and 1528 transitions. Second operand 3 states. [2019-12-18 17:13:19,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:19,235 INFO L93 Difference]: Finished difference Result 743 states and 1523 transitions. [2019-12-18 17:13:19,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:13:19,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 17:13:19,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:19,237 INFO L225 Difference]: With dead ends: 743 [2019-12-18 17:13:19,237 INFO L226 Difference]: Without dead ends: 743 [2019-12-18 17:13:19,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:13:19,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-12-18 17:13:19,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 607. [2019-12-18 17:13:19,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-12-18 17:13:19,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 1271 transitions. [2019-12-18 17:13:19,251 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 1271 transitions. Word has length 41 [2019-12-18 17:13:19,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:19,251 INFO L462 AbstractCegarLoop]: Abstraction has 607 states and 1271 transitions. [2019-12-18 17:13:19,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:13:19,251 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 1271 transitions. [2019-12-18 17:13:19,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 17:13:19,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:19,253 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 17:13:19,254 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:19,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:19,254 INFO L82 PathProgramCache]: Analyzing trace with hash 416077471, now seen corresponding path program 1 times [2019-12-18 17:13:19,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:19,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897387750] [2019-12-18 17:13:19,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:13:19,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:13:19,363 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:13:19,363 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:13:19,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= v_~x$r_buff1_thd1~0_310 0) (= 0 v_~weak$$choice0~0_10) (= 0 v_~x$w_buff1~0_306) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t903~0.base_31|) (= 0 v_~__unbuffered_p1_EBX~0_149) (= v_~z~0_67 0) (= 0 v_~__unbuffered_cnt~0_92) (= 0 |v_ULTIMATE.start_main_~#t903~0.offset_23|) (= 0 v_~x$r_buff1_thd2~0_200) (= (select .cse0 |v_ULTIMATE.start_main_~#t903~0.base_31|) 0) (= v_~x$r_buff1_thd0~0_197 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t903~0.base_31| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t903~0.base_31|) |v_ULTIMATE.start_main_~#t903~0.offset_23| 0)) |v_#memory_int_17|) (= 0 v_~x$read_delayed_var~0.base_7) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t903~0.base_31| 4) |v_#length_17|) (= 0 v_~x$read_delayed~0_6) (= v_~x$flush_delayed~0_43 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~main$tmp_guard0~0_20 0) (= v_~x$r_buff0_thd0~0_141 0) (= v_~weak$$choice2~0_165 0) (= v_~x$r_buff0_thd1~0_354 0) (= |v_#NULL.offset_5| 0) (= 0 v_~x$r_buff0_thd2~0_271) (= 0 v_~x~0_132) (= 0 v_~x$w_buff0~0_467) (= v_~x$mem_tmp~0_11 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t903~0.base_31| 1) |v_#valid_54|) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard1~0_24 0) (= 0 v_~__unbuffered_p0_EAX~0_51) (= 0 v_~x$w_buff1_used~0_505) (= v_~__unbuffered_p1_EAX~0_149 0) (= v_~y~0_138 0) (= 0 |v_#NULL.base_5|) (= 0 v_~x$w_buff0_used~0_795))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_467, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_354, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_20|, ~x$flush_delayed~0=v_~x$flush_delayed~0_43, ULTIMATE.start_main_~#t904~0.base=|v_ULTIMATE.start_main_~#t904~0.base_28|, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_310, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_149, ULTIMATE.start_main_~#t903~0.offset=|v_ULTIMATE.start_main_~#t903~0.offset_23|, #length=|v_#length_17|, ~y~0=v_~y~0_138, ULTIMATE.start_main_~#t903~0.base=|v_ULTIMATE.start_main_~#t903~0.base_31|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_149, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_50|, ~x$w_buff1~0=v_~x$w_buff1~0_306, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_32|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_160|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_505, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_200, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_36|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_60|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_197, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_271, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_42|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_795, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t904~0.offset=|v_ULTIMATE.start_main_~#t904~0.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, ~z~0=v_~z~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_165, ~x~0=v_~x~0_132, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, ULTIMATE.start_main_~#t904~0.base, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t903~0.offset, #length, ~y~0, ULTIMATE.start_main_~#t903~0.base, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t904~0.offset, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 17:13:19,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L800-1-->L802: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t904~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t904~0.base_12|) |v_ULTIMATE.start_main_~#t904~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t904~0.base_12| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t904~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t904~0.offset_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t904~0.base_12| 4)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t904~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t904~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t904~0.base=|v_ULTIMATE.start_main_~#t904~0.base_12|, ULTIMATE.start_main_~#t904~0.offset=|v_ULTIMATE.start_main_~#t904~0.offset_11|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t904~0.base, ULTIMATE.start_main_~#t904~0.offset, #length] because there is no mapped edge [2019-12-18 17:13:19,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [578] [578] P1ENTRY-->L5-3: Formula: (and (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_21|) (= v_~x$w_buff0~0_50 v_~x$w_buff1~0_30) (= v_P1Thread1of1ForFork0_~arg.base_21 |v_P1Thread1of1ForFork0_#in~arg.base_21|) (= 1 v_~x$w_buff0_used~0_94) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_23 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_21|) (= 1 v_~x$w_buff0~0_49) (= v_~x$w_buff1_used~0_53 v_~x$w_buff0_used~0_95) (= (mod v_~x$w_buff1_used~0_53 256) 0) (= |v_P1Thread1of1ForFork0_#in~arg.offset_21| v_P1Thread1of1ForFork0_~arg.offset_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_21|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_21|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_95} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_49, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_23, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_21, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_21|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_21|, ~x$w_buff1~0=v_~x$w_buff1~0_30, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_21|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 17:13:19,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1148611779 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1148611779 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-1148611779|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-1148611779| ~x$w_buff0_used~0_In-1148611779)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1148611779, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1148611779} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1148611779, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1148611779|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1148611779} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 17:13:19,374 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In254171260 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In254171260 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In254171260 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In254171260 256)))) (or (and (= ~x$w_buff1_used~0_In254171260 |P1Thread1of1ForFork0_#t~ite29_Out254171260|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out254171260|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In254171260, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In254171260, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In254171260, ~x$w_buff0_used~0=~x$w_buff0_used~0_In254171260} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In254171260, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In254171260, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In254171260, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out254171260|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In254171260} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 17:13:19,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1894072313 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1894072313 256) 0))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out1894072313 0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_Out1894072313 ~x$r_buff0_thd2~0_In1894072313)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1894072313, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1894072313} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1894072313|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1894072313, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1894072313} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 17:13:19,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In478298979 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In478298979 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In478298979 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In478298979 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out478298979|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd2~0_In478298979 |P1Thread1of1ForFork0_#t~ite31_Out478298979|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In478298979, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In478298979, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In478298979, ~x$w_buff0_used~0=~x$w_buff0_used~0_In478298979} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out478298979|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In478298979, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In478298979, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In478298979, ~x$w_buff0_used~0=~x$w_buff0_used~0_In478298979} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 17:13:19,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_114 |v_P1Thread1of1ForFork0_#t~ite31_36|) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_35|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_114, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 17:13:19,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [588] [588] L741-->L742: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~x$r_buff0_thd1~0_67 v_~x$r_buff0_thd1~0_66)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_66, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-18 17:13:19,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L744-->L752: Formula: (and (= v_~x$mem_tmp~0_6 v_~x~0_51) (not (= 0 (mod v_~x$flush_delayed~0_22 256))) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35) (= v_~x$flush_delayed~0_21 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_22, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_29|, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_51} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 17:13:19,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [600] [600] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 2 v_~__unbuffered_cnt~0_12)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 17:13:19,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L808-2-->L808-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1517834149 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1517834149 256) 0))) (or (and (or .cse0 .cse1) (= ~x~0_In-1517834149 |ULTIMATE.start_main_#t~ite34_Out-1517834149|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite34_Out-1517834149| ~x$w_buff1~0_In-1517834149)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1517834149, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1517834149, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1517834149, ~x~0=~x~0_In-1517834149} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1517834149, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1517834149, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1517834149, ~x~0=~x~0_In-1517834149, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1517834149|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 17:13:19,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L808-4-->L809: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite34_9|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_9|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 17:13:19,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In257952608 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In257952608 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out257952608| 0)) (and (= ~x$w_buff0_used~0_In257952608 |ULTIMATE.start_main_#t~ite36_Out257952608|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In257952608, ~x$w_buff0_used~0=~x$w_buff0_used~0_In257952608} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In257952608, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out257952608|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In257952608} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 17:13:19,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In2134260704 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In2134260704 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In2134260704 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In2134260704 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite37_Out2134260704| 0)) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In2134260704 |ULTIMATE.start_main_#t~ite37_Out2134260704|) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2134260704, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2134260704, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2134260704, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2134260704} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2134260704, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2134260704, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out2134260704|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2134260704, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2134260704} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 17:13:19,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1904602109 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1904602109 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out1904602109| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In1904602109 |ULTIMATE.start_main_#t~ite38_Out1904602109|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1904602109, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1904602109} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1904602109, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1904602109|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1904602109} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 17:13:19,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1472476564 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In1472476564 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1472476564 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1472476564 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In1472476564 |ULTIMATE.start_main_#t~ite39_Out1472476564|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite39_Out1472476564|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1472476564, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1472476564, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1472476564, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1472476564} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1472476564, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1472476564|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1472476564, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1472476564, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1472476564} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 17:13:19,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= v_~x$r_buff1_thd0~0_183 |v_ULTIMATE.start_main_#t~ite39_36|) (= 0 v_~__unbuffered_p1_EBX~0_136) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~__unbuffered_p1_EAX~0_136 1) (= 0 v_~__unbuffered_p0_EAX~0_38)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_136, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_36|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_136, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_35|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:13:19,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:13:19 BasicIcfg [2019-12-18 17:13:19,476 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:13:19,477 INFO L168 Benchmark]: Toolchain (without parser) took 12047.22 ms. Allocated memory was 144.7 MB in the beginning and 394.8 MB in the end (delta: 250.1 MB). Free memory was 99.3 MB in the beginning and 256.3 MB in the end (delta: -157.0 MB). Peak memory consumption was 93.1 MB. Max. memory is 7.1 GB. [2019-12-18 17:13:19,478 INFO L168 Benchmark]: CDTParser took 0.73 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 17:13:19,479 INFO L168 Benchmark]: CACSL2BoogieTranslator took 756.09 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 99.1 MB in the beginning and 156.2 MB in the end (delta: -57.0 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. [2019-12-18 17:13:19,479 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.72 ms. Allocated memory is still 201.9 MB. Free memory was 156.2 MB in the beginning and 153.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:13:19,480 INFO L168 Benchmark]: Boogie Preprocessor took 33.84 ms. Allocated memory is still 201.9 MB. Free memory was 153.5 MB in the beginning and 151.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:13:19,480 INFO L168 Benchmark]: RCFGBuilder took 832.13 ms. Allocated memory is still 201.9 MB. Free memory was 151.5 MB in the beginning and 110.6 MB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:13:19,481 INFO L168 Benchmark]: TraceAbstraction took 10359.22 ms. Allocated memory was 201.9 MB in the beginning and 394.8 MB in the end (delta: 192.9 MB). Free memory was 110.0 MB in the beginning and 256.3 MB in the end (delta: -146.4 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:13:19,485 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.73 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 756.09 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 99.1 MB in the beginning and 156.2 MB in the end (delta: -57.0 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.72 ms. Allocated memory is still 201.9 MB. Free memory was 156.2 MB in the beginning and 153.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.84 ms. Allocated memory is still 201.9 MB. Free memory was 153.5 MB in the beginning and 151.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 832.13 ms. Allocated memory is still 201.9 MB. Free memory was 151.5 MB in the beginning and 110.6 MB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10359.22 ms. Allocated memory was 201.9 MB in the beginning and 394.8 MB in the end (delta: 192.9 MB). Free memory was 110.0 MB in the beginning and 256.3 MB in the end (delta: -146.4 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 137 ProgramPointsBefore, 67 ProgramPointsAfterwards, 165 TransitionsBefore, 80 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 18 ChoiceCompositions, 4487 VarBasedMoverChecksPositive, 218 VarBasedMoverChecksNegative, 83 SemBasedMoverChecksPositive, 190 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 45287 CheckedPairsTotal, 103 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t903, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t904, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L762] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L763] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L764] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L765] 2 x$r_buff0_thd2 = (_Bool)1 [L768] 2 y = 1 [L771] 2 __unbuffered_p1_EAX = y [L774] 2 __unbuffered_p1_EBX = z 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L729] 1 z = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x 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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L736] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __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 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L737] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __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 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L738] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __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 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L739] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __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 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L740] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L742] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __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 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.0s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1527 SDtfs, 1265 SDslu, 2941 SDs, 0 SdLazy, 1300 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6574occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 3030 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 383 NumberOfCodeBlocks, 383 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 328 ConstructedInterpolants, 0 QuantifiedInterpolants, 32423 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...