/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi003_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:10:18,328 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:10:18,330 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:10:18,342 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:10:18,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:10:18,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:10:18,345 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:10:18,346 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:10:18,348 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:10:18,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:10:18,350 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:10:18,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:10:18,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:10:18,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:10:18,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:10:18,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:10:18,355 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:10:18,356 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:10:18,358 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:10:18,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:10:18,361 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:10:18,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:10:18,363 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:10:18,364 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:10:18,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:10:18,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:10:18,366 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:10:18,367 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:10:18,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:10:18,369 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:10:18,369 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:10:18,371 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:10:18,372 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:10:18,372 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:10:18,373 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:10:18,374 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:10:18,374 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:10:18,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:10:18,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:10:18,376 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:10:18,376 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:10:18,377 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:10:18,391 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:10:18,391 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:10:18,392 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:10:18,393 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:10:18,393 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:10:18,393 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:10:18,393 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:10:18,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:10:18,394 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:10:18,394 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:10:18,394 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:10:18,394 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:10:18,394 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:10:18,394 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:10:18,395 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:10:18,395 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:10:18,395 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:10:18,395 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:10:18,395 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:10:18,396 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:10:18,396 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:10:18,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:10:18,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:10:18,396 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:10:18,397 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:10:18,397 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:10:18,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:10:18,397 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:10:18,397 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:10:18,397 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:10:18,654 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:10:18,671 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:10:18,675 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:10:18,677 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:10:18,677 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:10:18,678 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_rmo.oepc.i [2019-12-18 14:10:18,749 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72b72e29e/4e3c9de487a14af798bb68d284bcb93b/FLAG55573521b [2019-12-18 14:10:19,290 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:10:19,291 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_rmo.oepc.i [2019-12-18 14:10:19,311 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72b72e29e/4e3c9de487a14af798bb68d284bcb93b/FLAG55573521b [2019-12-18 14:10:19,616 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72b72e29e/4e3c9de487a14af798bb68d284bcb93b [2019-12-18 14:10:19,625 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:10:19,627 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:10:19,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:10:19,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:10:19,631 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:10:19,632 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:10:19" (1/1) ... [2019-12-18 14:10:19,635 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2983cbdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:19, skipping insertion in model container [2019-12-18 14:10:19,635 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:10:19" (1/1) ... [2019-12-18 14:10:19,644 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:10:19,706 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:10:20,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:10:20,216 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:10:20,279 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:10:20,349 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:10:20,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:20 WrapperNode [2019-12-18 14:10:20,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:10:20,351 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:10:20,351 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:10:20,351 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:10:20,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:20" (1/1) ... [2019-12-18 14:10:20,379 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:20" (1/1) ... [2019-12-18 14:10:20,410 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:10:20,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:10:20,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:10:20,410 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:10:20,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:20" (1/1) ... [2019-12-18 14:10:20,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:20" (1/1) ... [2019-12-18 14:10:20,425 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:20" (1/1) ... [2019-12-18 14:10:20,426 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:20" (1/1) ... [2019-12-18 14:10:20,435 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:20" (1/1) ... [2019-12-18 14:10:20,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:20" (1/1) ... [2019-12-18 14:10:20,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:20" (1/1) ... [2019-12-18 14:10:20,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:10:20,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:10:20,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:10:20,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:10:20,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:20" (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 14:10:20,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:10:20,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:10:20,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:10:20,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:10:20,513 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:10:20,514 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:10:20,514 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:10:20,514 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:10:20,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:10:20,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:10:20,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:10:20,516 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 14:10:21,180 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:10:21,180 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:10:21,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:10:21 BoogieIcfgContainer [2019-12-18 14:10:21,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:10:21,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:10:21,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:10:21,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:10:21,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:10:19" (1/3) ... [2019-12-18 14:10:21,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a71584b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:10:21, skipping insertion in model container [2019-12-18 14:10:21,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:20" (2/3) ... [2019-12-18 14:10:21,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a71584b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:10:21, skipping insertion in model container [2019-12-18 14:10:21,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:10:21" (3/3) ... [2019-12-18 14:10:21,196 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_rmo.oepc.i [2019-12-18 14:10:21,206 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:10:21,206 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:10:21,221 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:10:21,222 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:10:21,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,280 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,281 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,304 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,304 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,304 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,305 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,305 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,315 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,316 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,316 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,322 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,323 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:21,343 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 14:10:21,363 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:10:21,363 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:10:21,363 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:10:21,363 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:10:21,364 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:10:21,364 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:10:21,364 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:10:21,364 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:10:21,380 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 164 transitions [2019-12-18 14:10:21,383 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-12-18 14:10:21,473 INFO L126 PetriNetUnfolder]: 35/162 cut-off events. [2019-12-18 14:10:21,473 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:10:21,487 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 344 event pairs. 6/131 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 14:10:21,504 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-12-18 14:10:21,550 INFO L126 PetriNetUnfolder]: 35/162 cut-off events. [2019-12-18 14:10:21,553 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:10:21,559 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 344 event pairs. 6/131 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 14:10:21,576 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-18 14:10:21,578 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:10:26,212 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 14:10:26,323 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 14:10:26,379 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39492 [2019-12-18 14:10:26,380 INFO L214 etLargeBlockEncoding]: Total number of compositions: 102 [2019-12-18 14:10:26,383 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 65 places, 75 transitions [2019-12-18 14:10:26,685 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6150 states. [2019-12-18 14:10:26,687 INFO L276 IsEmpty]: Start isEmpty. Operand 6150 states. [2019-12-18 14:10:26,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:10:26,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:26,695 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:10:26,695 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:26,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:26,700 INFO L82 PathProgramCache]: Analyzing trace with hash 681495893, now seen corresponding path program 1 times [2019-12-18 14:10:26,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:26,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563682674] [2019-12-18 14:10:26,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:26,923 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 14:10:26,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563682674] [2019-12-18 14:10:26,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:26,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:10:26,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710613835] [2019-12-18 14:10:26,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:10:26,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:26,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:10:26,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:10:26,948 INFO L87 Difference]: Start difference. First operand 6150 states. Second operand 3 states. [2019-12-18 14:10:27,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:27,156 INFO L93 Difference]: Finished difference Result 5990 states and 20128 transitions. [2019-12-18 14:10:27,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:10:27,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:10:27,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:27,227 INFO L225 Difference]: With dead ends: 5990 [2019-12-18 14:10:27,227 INFO L226 Difference]: Without dead ends: 5642 [2019-12-18 14:10:27,229 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 14:10:27,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2019-12-18 14:10:27,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5642. [2019-12-18 14:10:27,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5642 states. [2019-12-18 14:10:27,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 18923 transitions. [2019-12-18 14:10:27,623 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 18923 transitions. Word has length 5 [2019-12-18 14:10:27,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:27,624 INFO L462 AbstractCegarLoop]: Abstraction has 5642 states and 18923 transitions. [2019-12-18 14:10:27,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:10:27,624 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 18923 transitions. [2019-12-18 14:10:27,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:10:27,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:27,628 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:27,628 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:27,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:27,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1994037290, now seen corresponding path program 1 times [2019-12-18 14:10:27,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:27,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981999120] [2019-12-18 14:10:27,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:27,727 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 14:10:27,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981999120] [2019-12-18 14:10:27,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:27,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:10:27,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977111865] [2019-12-18 14:10:27,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:10:27,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:27,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:10:27,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:10:27,732 INFO L87 Difference]: Start difference. First operand 5642 states and 18923 transitions. Second operand 3 states. [2019-12-18 14:10:27,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:27,769 INFO L93 Difference]: Finished difference Result 1157 states and 2862 transitions. [2019-12-18 14:10:27,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:10:27,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 14:10:27,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:27,777 INFO L225 Difference]: With dead ends: 1157 [2019-12-18 14:10:27,777 INFO L226 Difference]: Without dead ends: 1157 [2019-12-18 14:10:27,778 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 14:10:27,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2019-12-18 14:10:27,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1157. [2019-12-18 14:10:27,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2019-12-18 14:10:27,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 2862 transitions. [2019-12-18 14:10:27,813 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 2862 transitions. Word has length 11 [2019-12-18 14:10:27,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:27,814 INFO L462 AbstractCegarLoop]: Abstraction has 1157 states and 2862 transitions. [2019-12-18 14:10:27,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:10:27,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 2862 transitions. [2019-12-18 14:10:27,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:10:27,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:27,823 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:27,823 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:27,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:27,824 INFO L82 PathProgramCache]: Analyzing trace with hash 638913215, now seen corresponding path program 1 times [2019-12-18 14:10:27,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:27,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574828902] [2019-12-18 14:10:27,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:27,924 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 14:10:27,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574828902] [2019-12-18 14:10:27,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:27,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:10:27,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065655301] [2019-12-18 14:10:27,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:10:27,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:27,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:10:27,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:10:27,928 INFO L87 Difference]: Start difference. First operand 1157 states and 2862 transitions. Second operand 3 states. [2019-12-18 14:10:28,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:28,014 INFO L93 Difference]: Finished difference Result 1787 states and 4461 transitions. [2019-12-18 14:10:28,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:10:28,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 14:10:28,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:28,027 INFO L225 Difference]: With dead ends: 1787 [2019-12-18 14:10:28,027 INFO L226 Difference]: Without dead ends: 1787 [2019-12-18 14:10:28,027 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 14:10:28,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2019-12-18 14:10:28,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1271. [2019-12-18 14:10:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1271 states. [2019-12-18 14:10:28,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 3173 transitions. [2019-12-18 14:10:28,085 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 3173 transitions. Word has length 14 [2019-12-18 14:10:28,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:28,086 INFO L462 AbstractCegarLoop]: Abstraction has 1271 states and 3173 transitions. [2019-12-18 14:10:28,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:10:28,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 3173 transitions. [2019-12-18 14:10:28,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:10:28,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:28,088 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:28,089 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:28,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:28,089 INFO L82 PathProgramCache]: Analyzing trace with hash 775445368, now seen corresponding path program 1 times [2019-12-18 14:10:28,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:28,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214684598] [2019-12-18 14:10:28,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:28,223 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 14:10:28,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214684598] [2019-12-18 14:10:28,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:28,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:10:28,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21108633] [2019-12-18 14:10:28,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:10:28,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:28,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:10:28,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:10:28,230 INFO L87 Difference]: Start difference. First operand 1271 states and 3173 transitions. Second operand 4 states. [2019-12-18 14:10:28,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:28,453 INFO L93 Difference]: Finished difference Result 1720 states and 4173 transitions. [2019-12-18 14:10:28,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:10:28,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 14:10:28,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:28,463 INFO L225 Difference]: With dead ends: 1720 [2019-12-18 14:10:28,463 INFO L226 Difference]: Without dead ends: 1720 [2019-12-18 14:10:28,464 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 14:10:28,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2019-12-18 14:10:28,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1552. [2019-12-18 14:10:28,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1552 states. [2019-12-18 14:10:28,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 3797 transitions. [2019-12-18 14:10:28,512 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 3797 transitions. Word has length 14 [2019-12-18 14:10:28,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:28,512 INFO L462 AbstractCegarLoop]: Abstraction has 1552 states and 3797 transitions. [2019-12-18 14:10:28,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:10:28,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 3797 transitions. [2019-12-18 14:10:28,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:10:28,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:28,514 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:28,515 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:28,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:28,515 INFO L82 PathProgramCache]: Analyzing trace with hash -289899718, now seen corresponding path program 1 times [2019-12-18 14:10:28,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:28,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681588557] [2019-12-18 14:10:28,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:28,577 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 14:10:28,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681588557] [2019-12-18 14:10:28,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:28,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:10:28,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968787969] [2019-12-18 14:10:28,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:10:28,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:28,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:10:28,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:10:28,580 INFO L87 Difference]: Start difference. First operand 1552 states and 3797 transitions. Second operand 4 states. [2019-12-18 14:10:28,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:28,765 INFO L93 Difference]: Finished difference Result 1981 states and 4771 transitions. [2019-12-18 14:10:28,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:10:28,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 14:10:28,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:28,783 INFO L225 Difference]: With dead ends: 1981 [2019-12-18 14:10:28,783 INFO L226 Difference]: Without dead ends: 1981 [2019-12-18 14:10:28,784 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 14:10:28,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-12-18 14:10:28,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1581. [2019-12-18 14:10:28,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2019-12-18 14:10:28,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 3869 transitions. [2019-12-18 14:10:28,826 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 3869 transitions. Word has length 14 [2019-12-18 14:10:28,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:28,827 INFO L462 AbstractCegarLoop]: Abstraction has 1581 states and 3869 transitions. [2019-12-18 14:10:28,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:10:28,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 3869 transitions. [2019-12-18 14:10:28,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 14:10:28,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:28,829 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 14:10:28,830 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:28,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:28,830 INFO L82 PathProgramCache]: Analyzing trace with hash -719161205, now seen corresponding path program 1 times [2019-12-18 14:10:28,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:28,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502599510] [2019-12-18 14:10:28,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:28,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:28,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:10:28,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502599510] [2019-12-18 14:10:28,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:28,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:10:28,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014939511] [2019-12-18 14:10:28,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:10:28,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:28,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:10:28,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:10:28,887 INFO L87 Difference]: Start difference. First operand 1581 states and 3869 transitions. Second operand 4 states. [2019-12-18 14:10:28,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:28,906 INFO L93 Difference]: Finished difference Result 702 states and 1600 transitions. [2019-12-18 14:10:28,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:10:28,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-18 14:10:28,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:28,910 INFO L225 Difference]: With dead ends: 702 [2019-12-18 14:10:28,911 INFO L226 Difference]: Without dead ends: 702 [2019-12-18 14:10:28,911 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 14:10:28,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-12-18 14:10:28,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 670. [2019-12-18 14:10:28,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-12-18 14:10:28,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1532 transitions. [2019-12-18 14:10:28,926 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1532 transitions. Word has length 26 [2019-12-18 14:10:28,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:28,927 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 1532 transitions. [2019-12-18 14:10:28,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:10:28,927 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1532 transitions. [2019-12-18 14:10:28,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:10:28,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:28,929 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 14:10:28,929 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:28,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:28,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1430443939, now seen corresponding path program 1 times [2019-12-18 14:10:28,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:28,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886467423] [2019-12-18 14:10:28,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:29,018 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 14:10:29,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886467423] [2019-12-18 14:10:29,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:29,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:10:29,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500325666] [2019-12-18 14:10:29,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:10:29,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:29,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:10:29,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:10:29,021 INFO L87 Difference]: Start difference. First operand 670 states and 1532 transitions. Second operand 6 states. [2019-12-18 14:10:29,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:29,249 INFO L93 Difference]: Finished difference Result 1768 states and 3997 transitions. [2019-12-18 14:10:29,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:10:29,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 14:10:29,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:29,256 INFO L225 Difference]: With dead ends: 1768 [2019-12-18 14:10:29,256 INFO L226 Difference]: Without dead ends: 1174 [2019-12-18 14:10:29,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:10:29,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2019-12-18 14:10:29,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 749. [2019-12-18 14:10:29,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-12-18 14:10:29,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1716 transitions. [2019-12-18 14:10:29,280 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1716 transitions. Word has length 41 [2019-12-18 14:10:29,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:29,283 INFO L462 AbstractCegarLoop]: Abstraction has 749 states and 1716 transitions. [2019-12-18 14:10:29,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:10:29,283 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1716 transitions. [2019-12-18 14:10:29,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:10:29,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:29,287 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 14:10:29,288 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:29,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:29,288 INFO L82 PathProgramCache]: Analyzing trace with hash -367672255, now seen corresponding path program 2 times [2019-12-18 14:10:29,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:29,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47213460] [2019-12-18 14:10:29,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:29,388 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 14:10:29,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47213460] [2019-12-18 14:10:29,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:29,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:10:29,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941435770] [2019-12-18 14:10:29,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:10:29,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:29,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:10:29,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:10:29,391 INFO L87 Difference]: Start difference. First operand 749 states and 1716 transitions. Second operand 3 states. [2019-12-18 14:10:29,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:29,404 INFO L93 Difference]: Finished difference Result 1153 states and 2657 transitions. [2019-12-18 14:10:29,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:10:29,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 14:10:29,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:29,409 INFO L225 Difference]: With dead ends: 1153 [2019-12-18 14:10:29,409 INFO L226 Difference]: Without dead ends: 424 [2019-12-18 14:10:29,410 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 14:10:29,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-12-18 14:10:29,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2019-12-18 14:10:29,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-12-18 14:10:29,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 974 transitions. [2019-12-18 14:10:29,421 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 974 transitions. Word has length 41 [2019-12-18 14:10:29,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:29,421 INFO L462 AbstractCegarLoop]: Abstraction has 424 states and 974 transitions. [2019-12-18 14:10:29,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:10:29,421 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 974 transitions. [2019-12-18 14:10:29,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:10:29,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:29,424 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 14:10:29,425 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:29,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:29,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1769242661, now seen corresponding path program 3 times [2019-12-18 14:10:29,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:29,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923089783] [2019-12-18 14:10:29,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:29,599 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 14:10:29,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923089783] [2019-12-18 14:10:29,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:29,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:10:29,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781632539] [2019-12-18 14:10:29,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 14:10:29,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:29,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 14:10:29,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:10:29,603 INFO L87 Difference]: Start difference. First operand 424 states and 974 transitions. Second operand 8 states. [2019-12-18 14:10:30,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:30,152 INFO L93 Difference]: Finished difference Result 714 states and 1499 transitions. [2019-12-18 14:10:30,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:10:30,152 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-12-18 14:10:30,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:30,157 INFO L225 Difference]: With dead ends: 714 [2019-12-18 14:10:30,157 INFO L226 Difference]: Without dead ends: 714 [2019-12-18 14:10:30,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:10:30,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-12-18 14:10:30,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 539. [2019-12-18 14:10:30,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-12-18 14:10:30,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 1139 transitions. [2019-12-18 14:10:30,174 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 1139 transitions. Word has length 41 [2019-12-18 14:10:30,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:30,175 INFO L462 AbstractCegarLoop]: Abstraction has 539 states and 1139 transitions. [2019-12-18 14:10:30,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 14:10:30,175 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 1139 transitions. [2019-12-18 14:10:30,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:10:30,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:30,177 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 14:10:30,177 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:30,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:30,177 INFO L82 PathProgramCache]: Analyzing trace with hash 888874829, now seen corresponding path program 4 times [2019-12-18 14:10:30,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:30,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386632995] [2019-12-18 14:10:30,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:30,291 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 14:10:30,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386632995] [2019-12-18 14:10:30,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:30,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:10:30,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690103312] [2019-12-18 14:10:30,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:10:30,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:30,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:10:30,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:10:30,293 INFO L87 Difference]: Start difference. First operand 539 states and 1139 transitions. Second operand 7 states. [2019-12-18 14:10:30,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:30,473 INFO L93 Difference]: Finished difference Result 1307 states and 2699 transitions. [2019-12-18 14:10:30,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:10:30,474 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-18 14:10:30,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:30,484 INFO L225 Difference]: With dead ends: 1307 [2019-12-18 14:10:30,485 INFO L226 Difference]: Without dead ends: 976 [2019-12-18 14:10:30,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:10:30,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-12-18 14:10:30,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 538. [2019-12-18 14:10:30,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-12-18 14:10:30,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1139 transitions. [2019-12-18 14:10:30,510 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 1139 transitions. Word has length 41 [2019-12-18 14:10:30,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:30,510 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 1139 transitions. [2019-12-18 14:10:30,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:10:30,510 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1139 transitions. [2019-12-18 14:10:30,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:10:30,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:30,513 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 14:10:30,514 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:30,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:30,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1585763671, now seen corresponding path program 5 times [2019-12-18 14:10:30,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:30,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602210255] [2019-12-18 14:10:30,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:30,634 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 14:10:30,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602210255] [2019-12-18 14:10:30,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:30,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:10:30,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830096455] [2019-12-18 14:10:30,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:10:30,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:30,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:10:30,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:10:30,637 INFO L87 Difference]: Start difference. First operand 538 states and 1139 transitions. Second operand 6 states. [2019-12-18 14:10:31,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:31,011 INFO L93 Difference]: Finished difference Result 810 states and 1687 transitions. [2019-12-18 14:10:31,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:10:31,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 14:10:31,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:31,016 INFO L225 Difference]: With dead ends: 810 [2019-12-18 14:10:31,016 INFO L226 Difference]: Without dead ends: 810 [2019-12-18 14:10:31,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 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 14:10:31,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2019-12-18 14:10:31,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 554. [2019-12-18 14:10:31,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-12-18 14:10:31,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 1171 transitions. [2019-12-18 14:10:31,031 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 1171 transitions. Word has length 41 [2019-12-18 14:10:31,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:31,031 INFO L462 AbstractCegarLoop]: Abstraction has 554 states and 1171 transitions. [2019-12-18 14:10:31,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:10:31,031 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 1171 transitions. [2019-12-18 14:10:31,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:10:31,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:31,033 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 14:10:31,033 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:31,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:31,034 INFO L82 PathProgramCache]: Analyzing trace with hash -101907359, now seen corresponding path program 6 times [2019-12-18 14:10:31,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:31,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369922186] [2019-12-18 14:10:31,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:31,097 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 14:10:31,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369922186] [2019-12-18 14:10:31,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:31,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:10:31,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586229363] [2019-12-18 14:10:31,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:10:31,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:31,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:10:31,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:10:31,099 INFO L87 Difference]: Start difference. First operand 554 states and 1171 transitions. Second operand 3 states. [2019-12-18 14:10:31,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:31,111 INFO L93 Difference]: Finished difference Result 552 states and 1166 transitions. [2019-12-18 14:10:31,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:10:31,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 14:10:31,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:31,117 INFO L225 Difference]: With dead ends: 552 [2019-12-18 14:10:31,117 INFO L226 Difference]: Without dead ends: 552 [2019-12-18 14:10:31,118 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 14:10:31,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-12-18 14:10:31,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 461. [2019-12-18 14:10:31,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-12-18 14:10:31,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 989 transitions. [2019-12-18 14:10:31,137 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 989 transitions. Word has length 41 [2019-12-18 14:10:31,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:31,138 INFO L462 AbstractCegarLoop]: Abstraction has 461 states and 989 transitions. [2019-12-18 14:10:31,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:10:31,138 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 989 transitions. [2019-12-18 14:10:31,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 14:10:31,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:31,139 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 14:10:31,139 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:31,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:31,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1127216463, now seen corresponding path program 1 times [2019-12-18 14:10:31,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:31,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904958320] [2019-12-18 14:10:31,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:10:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:10:31,286 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:10:31,286 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:10:31,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$w_buff1_used~0_374) (= v_~__unbuffered_p1_EBX~0_96 0) (= v_~x$r_buff0_thd1~0_280 0) (= 0 v_~x~0_123) (= v_~x$flush_delayed~0_46 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1641~0.base_35| 4)) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff0_used~0_610) (= v_~x$r_buff0_thd0~0_130 0) (= 0 v_~x$r_buff1_thd2~0_113) (= v_~y~0_101 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1641~0.base_35|)) (= v_~weak$$choice2~0_130 0) (= v_~x$r_buff1_thd0~0_131 0) (= 0 v_~x$w_buff0~0_392) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1641~0.base_35|) (= 0 v_~x$read_delayed_var~0.base_7) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1641~0.base_35| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1641~0.base_35|) |v_ULTIMATE.start_main_~#t1641~0.offset_24| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p0_EAX~0_68) (= 0 v_~x$w_buff1~0_230) (= 0 |v_#NULL.base_6|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1641~0.base_35| 1) |v_#valid_59|) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_15 0) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~x$r_buff0_thd2~0_177) (= 0 v_~__unbuffered_p1_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_91) (= v_~x$r_buff1_thd1~0_230 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= |v_ULTIMATE.start_main_~#t1641~0.offset_24| 0) (= 0 v_~weak$$choice0~0_13) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_392, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_280, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_46, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_230, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ULTIMATE.start_main_~#t1641~0.offset=|v_ULTIMATE.start_main_~#t1641~0.offset_24|, ULTIMATE.start_main_~#t1642~0.base=|v_ULTIMATE.start_main_~#t1642~0.base_35|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_95, #length=|v_#length_17|, ~y~0=v_~y~0_101, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ULTIMATE.start_main_~#t1641~0.base=|v_ULTIMATE.start_main_~#t1641~0.base_35|, ULTIMATE.start_main_~#t1642~0.offset=|v_ULTIMATE.start_main_~#t1642~0.offset_24|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_87|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_113|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_374, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_131, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_177, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~x~0=v_~x~0_123, ~x$read_delayed~0=v_~x$read_delayed~0_7} 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, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t1641~0.offset, ULTIMATE.start_main_~#t1642~0.base, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t1641~0.base, ULTIMATE.start_main_~#t1642~0.offset, ~__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, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 14:10:31,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L800-1-->L802: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1642~0.base_10| 4) |v_#length_9|) (not (= |v_ULTIMATE.start_main_~#t1642~0.base_10| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1642~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1642~0.base_10|) |v_ULTIMATE.start_main_~#t1642~0.offset_9| 1))) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1642~0.base_10| 1)) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1642~0.base_10|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1642~0.base_10|) (= |v_ULTIMATE.start_main_~#t1642~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_3|, ULTIMATE.start_main_~#t1642~0.offset=|v_ULTIMATE.start_main_~#t1642~0.offset_9|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1642~0.base=|v_ULTIMATE.start_main_~#t1642~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1642~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1642~0.base] because there is no mapped edge [2019-12-18 14:10:31,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L5-->L777: Formula: (and (= ~x$r_buff0_thd2~0_In-849759924 ~x$r_buff1_thd2~0_Out-849759924) (= ~x$r_buff0_thd2~0_Out-849759924 1) (= ~y~0_Out-849759924 ~__unbuffered_p1_EBX~0_Out-849759924) (= ~x$r_buff1_thd0~0_Out-849759924 ~x$r_buff0_thd0~0_In-849759924) (= ~__unbuffered_p1_EAX~0_Out-849759924 ~y~0_Out-849759924) (= ~y~0_Out-849759924 1) (not (= 0 P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-849759924)) (= ~x$r_buff0_thd1~0_In-849759924 ~x$r_buff1_thd1~0_Out-849759924)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-849759924, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-849759924, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-849759924, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-849759924} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-849759924, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-849759924, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-849759924, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-849759924, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-849759924, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-849759924, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-849759924, ~y~0=~y~0_Out-849759924, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-849759924, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-849759924} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 14:10:31,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [579] [579] L741-->L742: Formula: (and (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_48) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_17} 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_48, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17} 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 14:10:31,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L742-->L742-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In433281235 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite23_In433281235| |P0Thread1of1ForFork1_#t~ite23_Out433281235|) (= |P0Thread1of1ForFork1_#t~ite22_In433281235| |P0Thread1of1ForFork1_#t~ite22_Out433281235|) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite24_Out433281235| ~x$r_buff1_thd1~0_In433281235)) (let ((.cse1 (not (= 0 (mod ~x$r_buff0_thd1~0_In433281235 256))))) (and (not (= (mod ~x$w_buff0_used~0_In433281235 256) 0)) (or (not (= (mod ~x$w_buff1_used~0_In433281235 256) 0)) .cse1) (= |P0Thread1of1ForFork1_#t~ite24_Out433281235| |P0Thread1of1ForFork1_#t~ite23_Out433281235|) (= |P0Thread1of1ForFork1_#t~ite23_Out433281235| |P0Thread1of1ForFork1_#t~ite22_Out433281235|) .cse0 (= |P0Thread1of1ForFork1_#t~ite22_Out433281235| 0) (or (not (= (mod ~x$r_buff1_thd1~0_In433281235 256) 0)) .cse1))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In433281235, ~x$w_buff1_used~0=~x$w_buff1_used~0_In433281235, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In433281235, ~weak$$choice2~0=~weak$$choice2~0_In433281235, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_In433281235|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In433281235, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_In433281235|} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In433281235, ~x$w_buff1_used~0=~x$w_buff1_used~0_In433281235, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In433281235, ~weak$$choice2~0=~weak$$choice2~0_In433281235, P0Thread1of1ForFork1_#t~ite24=|P0Thread1of1ForFork1_#t~ite24_Out433281235|, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_Out433281235|, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_Out433281235|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In433281235} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite24, P0Thread1of1ForFork1_#t~ite23, P0Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-18 14:10:31,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [613] [613] L744-->L752: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x$mem_tmp~0_6 v_~x~0_38) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_23|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_38} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 14:10:31,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1218770617 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1218770617 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out1218770617| ~x$w_buff0_used~0_In1218770617)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out1218770617| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1218770617, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1218770617} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1218770617, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1218770617|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1218770617} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 14:10:31,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In2044333317 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In2044333317 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In2044333317 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In2044333317 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out2044333317| ~x$w_buff1_used~0_In2044333317)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out2044333317|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2044333317, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2044333317, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2044333317, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2044333317} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In2044333317, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2044333317, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2044333317, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out2044333317|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2044333317} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 14:10:31,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1406225912 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1406225912 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-1406225912)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In-1406225912 ~x$r_buff0_thd2~0_Out-1406225912)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1406225912, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1406225912} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1406225912|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1406225912, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1406225912} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 14:10:31,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L781-->L781-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In688589467 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In688589467 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In688589467 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In688589467 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out688589467| ~x$r_buff1_thd2~0_In688589467) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork0_#t~ite31_Out688589467| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In688589467, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In688589467, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In688589467, ~x$w_buff0_used~0=~x$w_buff0_used~0_In688589467} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out688589467|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In688589467, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In688589467, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In688589467, ~x$w_buff0_used~0=~x$w_buff0_used~0_In688589467} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 14:10:31,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L781-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd2~0_57 |v_P1Thread1of1ForFork0_#t~ite31_34|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, 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 14:10:31,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] 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 14:10:31,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L808-2-->L808-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-1092603951 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1092603951 256)))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-1092603951 |ULTIMATE.start_main_#t~ite34_Out-1092603951|)) (and (or .cse0 .cse1) (= ~x~0_In-1092603951 |ULTIMATE.start_main_#t~ite34_Out-1092603951|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1092603951, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1092603951, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1092603951, ~x~0=~x~0_In-1092603951} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1092603951, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1092603951, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1092603951, ~x~0=~x~0_In-1092603951, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1092603951|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 14:10:31,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] 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 14:10:31,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1189325346 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1189325346 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out1189325346| ~x$w_buff0_used~0_In1189325346)) (and (= |ULTIMATE.start_main_#t~ite36_Out1189325346| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1189325346, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1189325346} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1189325346, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1189325346|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1189325346} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 14:10:31,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L810-->L810-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In1472992694 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In1472992694 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1472992694 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1472992694 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1472992694 |ULTIMATE.start_main_#t~ite37_Out1472992694|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite37_Out1472992694| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1472992694, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1472992694, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1472992694, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1472992694} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1472992694, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1472992694, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1472992694|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1472992694, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1472992694} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 14:10:31,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1422285263 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1422285263 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In1422285263 |ULTIMATE.start_main_#t~ite38_Out1422285263|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite38_Out1422285263|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1422285263, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1422285263} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1422285263, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1422285263|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1422285263} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 14:10:31,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1088790523 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1088790523 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1088790523 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-1088790523 256) 0))) (or (and (= ~x$r_buff1_thd0~0_In-1088790523 |ULTIMATE.start_main_#t~ite39_Out-1088790523|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-1088790523|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1088790523, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1088790523, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1088790523, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1088790523} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1088790523, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1088790523|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1088790523, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1088790523, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1088790523} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 14:10:31,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y~0_42 2) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~__unbuffered_p0_EAX~0_30) (= 1 v_~__unbuffered_p1_EAX~0_39) (= v_~__unbuffered_p1_EBX~0_40 1) (= v_~x$r_buff1_thd0~0_72 |v_ULTIMATE.start_main_#t~ite39_40|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_40|, ~y~0=v_~y~0_42} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y~0=v_~y~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} 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 14:10:31,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:10:31 BasicIcfg [2019-12-18 14:10:31,428 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:10:31,434 INFO L168 Benchmark]: Toolchain (without parser) took 11804.29 ms. Allocated memory was 137.9 MB in the beginning and 383.3 MB in the end (delta: 245.4 MB). Free memory was 101.0 MB in the beginning and 94.9 MB in the end (delta: 6.1 MB). Peak memory consumption was 251.4 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:31,437 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 14:10:31,438 INFO L168 Benchmark]: CACSL2BoogieTranslator took 722.51 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 100.6 MB in the beginning and 155.8 MB in the end (delta: -55.2 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:31,438 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.25 ms. Allocated memory is still 201.3 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:31,442 INFO L168 Benchmark]: Boogie Preprocessor took 36.76 ms. Allocated memory is still 201.3 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:31,443 INFO L168 Benchmark]: RCFGBuilder took 735.18 ms. Allocated memory is still 201.3 MB. Free memory was 151.1 MB in the beginning and 110.3 MB in the end (delta: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:31,444 INFO L168 Benchmark]: TraceAbstraction took 10245.19 ms. Allocated memory was 201.3 MB in the beginning and 383.3 MB in the end (delta: 181.9 MB). Free memory was 109.7 MB in the beginning and 94.9 MB in the end (delta: 14.7 MB). Peak memory consumption was 196.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:31,453 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 722.51 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 100.6 MB in the beginning and 155.8 MB in the end (delta: -55.2 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.25 ms. Allocated memory is still 201.3 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.76 ms. Allocated memory is still 201.3 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 735.18 ms. Allocated memory is still 201.3 MB. Free memory was 151.1 MB in the beginning and 110.3 MB in the end (delta: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10245.19 ms. Allocated memory was 201.3 MB in the beginning and 383.3 MB in the end (delta: 181.9 MB). Free memory was 109.7 MB in the beginning and 94.9 MB in the end (delta: 14.7 MB). Peak memory consumption was 196.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.9s, 136 ProgramPointsBefore, 65 ProgramPointsAfterwards, 164 TransitionsBefore, 75 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 21 ChoiceCompositions, 4335 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 167 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 39492 CheckedPairsTotal, 102 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(&t1641, ((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] [L802] FCALL, FORK 0 pthread_create(&t1642, ((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] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L727] 1 y = 2 [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=1, 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=2] [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=1, 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=2] [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) [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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [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=1, 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=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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))=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=2] [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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [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] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=2] [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) [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 [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=1, 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=2] [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, 130 locations, 2 error locations. Result: UNSAFE, OverallTime: 9.9s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1370 SDtfs, 1145 SDslu, 2682 SDs, 0 SdLazy, 1376 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 19 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6150occurred 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.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 2501 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 372 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 35182 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...