/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/safe004_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:29:28,075 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:29:28,078 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:29:28,096 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:29:28,096 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:29:28,099 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:29:28,101 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:29:28,111 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:29:28,114 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:29:28,117 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:29:28,119 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:29:28,121 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:29:28,121 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:29:28,123 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:29:28,125 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:29:28,127 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:29:28,128 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:29:28,129 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:29:28,130 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:29:28,135 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:29:28,139 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:29:28,143 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:29:28,144 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:29:28,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:29:28,147 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:29:28,147 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:29:28,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:29:28,149 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:29:28,150 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:29:28,151 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:29:28,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:29:28,152 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:29:28,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:29:28,155 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:29:28,157 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:29:28,157 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:29:28,158 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:29:28,158 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:29:28,159 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:29:28,159 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:29:28,161 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:29:28,161 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:29:28,188 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:29:28,188 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:29:28,189 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:29:28,189 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:29:28,190 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:29:28,190 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:29:28,190 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:29:28,190 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:29:28,190 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:29:28,191 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:29:28,191 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:29:28,191 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:29:28,191 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:29:28,191 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:29:28,192 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:29:28,192 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:29:28,192 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:29:28,192 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:29:28,192 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:29:28,193 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:29:28,193 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:29:28,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:29:28,193 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:29:28,193 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:29:28,194 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:29:28,194 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:29:28,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:29:28,194 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:29:28,194 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:29:28,195 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:29:28,449 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:29:28,468 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:29:28,471 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:29:28,473 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:29:28,473 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:29:28,474 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_pso.opt.i [2019-12-18 14:29:28,548 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12822b221/ce45510c7f184e9781f41064fab3ac29/FLAG9934ae64f [2019-12-18 14:29:29,166 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:29:29,167 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_pso.opt.i [2019-12-18 14:29:29,182 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12822b221/ce45510c7f184e9781f41064fab3ac29/FLAG9934ae64f [2019-12-18 14:29:29,376 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12822b221/ce45510c7f184e9781f41064fab3ac29 [2019-12-18 14:29:29,389 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:29:29,391 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:29:29,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:29:29,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:29:29,400 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:29:29,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:29:29" (1/1) ... [2019-12-18 14:29:29,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3899c684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:29:29, skipping insertion in model container [2019-12-18 14:29:29,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:29:29" (1/1) ... [2019-12-18 14:29:29,414 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:29:29,484 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:29:30,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:29:30,126 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:29:30,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:29:30,269 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:29:30,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:29:30 WrapperNode [2019-12-18 14:29:30,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:29:30,270 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:29:30,270 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:29:30,271 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:29:30,280 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:29:30" (1/1) ... [2019-12-18 14:29:30,303 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:29:30" (1/1) ... [2019-12-18 14:29:30,342 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:29:30,342 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:29:30,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:29:30,342 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:29:30,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:29:30" (1/1) ... [2019-12-18 14:29:30,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:29:30" (1/1) ... [2019-12-18 14:29:30,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:29:30" (1/1) ... [2019-12-18 14:29:30,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:29:30" (1/1) ... [2019-12-18 14:29:30,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:29:30" (1/1) ... [2019-12-18 14:29:30,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:29:30" (1/1) ... [2019-12-18 14:29:30,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:29:30" (1/1) ... [2019-12-18 14:29:30,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:29:30,407 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:29:30,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:29:30,407 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:29:30,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:29:30" (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:29:30,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:29:30,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:29:30,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:29:30,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:29:30,475 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:29:30,475 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:29:30,476 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:29:30,476 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:29:30,477 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:29:30,477 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:29:30,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:29:30,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:29:30,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:29:30,480 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:29:31,279 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:29:31,279 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:29:31,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:29:31 BoogieIcfgContainer [2019-12-18 14:29:31,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:29:31,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:29:31,283 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:29:31,286 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:29:31,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:29:29" (1/3) ... [2019-12-18 14:29:31,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532bcf00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:29:31, skipping insertion in model container [2019-12-18 14:29:31,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:29:30" (2/3) ... [2019-12-18 14:29:31,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532bcf00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:29:31, skipping insertion in model container [2019-12-18 14:29:31,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:29:31" (3/3) ... [2019-12-18 14:29:31,290 INFO L109 eAbstractionObserver]: Analyzing ICFG safe004_pso.opt.i [2019-12-18 14:29:31,301 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:29:31,301 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:29:31,310 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:29:31,311 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:29:31,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,350 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,350 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,375 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,375 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,376 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,376 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,376 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,383 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,383 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,393 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,394 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,396 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,397 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,397 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,401 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,402 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:29:31,418 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 14:29:31,437 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:29:31,437 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:29:31,437 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:29:31,437 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:29:31,437 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:29:31,437 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:29:31,438 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:29:31,438 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:29:31,454 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-18 14:29:31,456 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 14:29:31,559 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 14:29:31,559 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:29:31,581 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 14:29:31,606 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 14:29:31,698 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 14:29:31,699 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:29:31,706 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 14:29:31,726 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-18 14:29:31,728 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:29:32,047 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2019-12-18 14:29:36,551 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-18 14:29:36,884 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 14:29:36,998 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 14:29:37,024 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78277 [2019-12-18 14:29:37,024 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 14:29:37,028 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 106 transitions [2019-12-18 14:29:53,645 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 107408 states. [2019-12-18 14:29:53,647 INFO L276 IsEmpty]: Start isEmpty. Operand 107408 states. [2019-12-18 14:29:53,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:29:53,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:29:53,653 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:29:53,654 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:29:53,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:29:53,658 INFO L82 PathProgramCache]: Analyzing trace with hash 809703812, now seen corresponding path program 1 times [2019-12-18 14:29:53,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:29:53,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909821472] [2019-12-18 14:29:53,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:29:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:29:53,874 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:29:53,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909821472] [2019-12-18 14:29:53,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:29:53,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:29:53,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931843145] [2019-12-18 14:29:53,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:29:53,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:29:53,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:29:53,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:29:53,895 INFO L87 Difference]: Start difference. First operand 107408 states. Second operand 3 states. [2019-12-18 14:29:54,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:29:54,947 INFO L93 Difference]: Finished difference Result 107108 states and 460900 transitions. [2019-12-18 14:29:54,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:29:54,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:29:54,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:29:58,694 INFO L225 Difference]: With dead ends: 107108 [2019-12-18 14:29:58,695 INFO L226 Difference]: Without dead ends: 104924 [2019-12-18 14:29:58,696 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:30:02,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104924 states. [2019-12-18 14:30:04,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104924 to 104924. [2019-12-18 14:30:04,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104924 states. [2019-12-18 14:30:05,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104924 states to 104924 states and 451982 transitions. [2019-12-18 14:30:05,348 INFO L78 Accepts]: Start accepts. Automaton has 104924 states and 451982 transitions. Word has length 5 [2019-12-18 14:30:05,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:05,348 INFO L462 AbstractCegarLoop]: Abstraction has 104924 states and 451982 transitions. [2019-12-18 14:30:05,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:30:05,349 INFO L276 IsEmpty]: Start isEmpty. Operand 104924 states and 451982 transitions. [2019-12-18 14:30:05,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:30:05,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:05,352 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:30:05,352 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:05,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:05,353 INFO L82 PathProgramCache]: Analyzing trace with hash 2105056515, now seen corresponding path program 1 times [2019-12-18 14:30:05,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:05,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10492588] [2019-12-18 14:30:05,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:05,476 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:30:05,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10492588] [2019-12-18 14:30:05,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:05,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:30:05,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155905943] [2019-12-18 14:30:05,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:30:05,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:05,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:30:05,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:30:05,480 INFO L87 Difference]: Start difference. First operand 104924 states and 451982 transitions. Second operand 4 states. [2019-12-18 14:30:10,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:10,501 INFO L93 Difference]: Finished difference Result 168606 states and 697152 transitions. [2019-12-18 14:30:10,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:30:10,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:30:10,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:11,108 INFO L225 Difference]: With dead ends: 168606 [2019-12-18 14:30:11,108 INFO L226 Difference]: Without dead ends: 168557 [2019-12-18 14:30:11,109 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:30:15,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168557 states. [2019-12-18 14:30:19,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168557 to 152629. [2019-12-18 14:30:19,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152629 states. [2019-12-18 14:30:20,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152629 states to 152629 states and 638547 transitions. [2019-12-18 14:30:20,304 INFO L78 Accepts]: Start accepts. Automaton has 152629 states and 638547 transitions. Word has length 11 [2019-12-18 14:30:20,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:20,304 INFO L462 AbstractCegarLoop]: Abstraction has 152629 states and 638547 transitions. [2019-12-18 14:30:20,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:30:20,304 INFO L276 IsEmpty]: Start isEmpty. Operand 152629 states and 638547 transitions. [2019-12-18 14:30:20,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:30:20,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:20,317 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:30:20,319 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:20,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:20,319 INFO L82 PathProgramCache]: Analyzing trace with hash 2027270657, now seen corresponding path program 1 times [2019-12-18 14:30:20,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:20,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963686371] [2019-12-18 14:30:20,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:20,471 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:30:20,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963686371] [2019-12-18 14:30:20,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:20,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:30:20,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035869838] [2019-12-18 14:30:20,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:30:20,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:20,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:30:20,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:30:20,474 INFO L87 Difference]: Start difference. First operand 152629 states and 638547 transitions. Second operand 4 states. [2019-12-18 14:30:27,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:27,345 INFO L93 Difference]: Finished difference Result 217678 states and 889823 transitions. [2019-12-18 14:30:27,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:30:27,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:30:27,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:27,949 INFO L225 Difference]: With dead ends: 217678 [2019-12-18 14:30:27,949 INFO L226 Difference]: Without dead ends: 217615 [2019-12-18 14:30:27,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:30:33,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217615 states. [2019-12-18 14:30:40,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217615 to 183279. [2019-12-18 14:30:40,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183279 states. [2019-12-18 14:30:40,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183279 states to 183279 states and 761454 transitions. [2019-12-18 14:30:40,685 INFO L78 Accepts]: Start accepts. Automaton has 183279 states and 761454 transitions. Word has length 13 [2019-12-18 14:30:40,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:40,686 INFO L462 AbstractCegarLoop]: Abstraction has 183279 states and 761454 transitions. [2019-12-18 14:30:40,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:30:40,687 INFO L276 IsEmpty]: Start isEmpty. Operand 183279 states and 761454 transitions. [2019-12-18 14:30:40,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:30:40,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:40,690 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:30:40,691 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:40,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:40,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1789207667, now seen corresponding path program 1 times [2019-12-18 14:30:40,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:40,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882345685] [2019-12-18 14:30:40,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:40,761 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:30:40,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882345685] [2019-12-18 14:30:40,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:40,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:30:40,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897016000] [2019-12-18 14:30:40,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:30:40,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:40,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:30:40,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:30:40,763 INFO L87 Difference]: Start difference. First operand 183279 states and 761454 transitions. Second operand 3 states. [2019-12-18 14:30:42,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:42,096 INFO L93 Difference]: Finished difference Result 36985 states and 120640 transitions. [2019-12-18 14:30:42,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:30:42,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 14:30:42,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:42,155 INFO L225 Difference]: With dead ends: 36985 [2019-12-18 14:30:42,155 INFO L226 Difference]: Without dead ends: 36985 [2019-12-18 14:30:42,155 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:30:42,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36985 states. [2019-12-18 14:30:42,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36985 to 36985. [2019-12-18 14:30:42,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36985 states. [2019-12-18 14:30:42,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36985 states to 36985 states and 120640 transitions. [2019-12-18 14:30:42,740 INFO L78 Accepts]: Start accepts. Automaton has 36985 states and 120640 transitions. Word has length 13 [2019-12-18 14:30:42,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:42,741 INFO L462 AbstractCegarLoop]: Abstraction has 36985 states and 120640 transitions. [2019-12-18 14:30:42,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:30:42,741 INFO L276 IsEmpty]: Start isEmpty. Operand 36985 states and 120640 transitions. [2019-12-18 14:30:42,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 14:30:42,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:42,744 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:30:42,744 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:42,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:42,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1405830784, now seen corresponding path program 1 times [2019-12-18 14:30:42,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:42,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422146608] [2019-12-18 14:30:42,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:42,886 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:30:42,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422146608] [2019-12-18 14:30:42,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:42,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:30:42,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580840353] [2019-12-18 14:30:42,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:30:42,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:42,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:30:42,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:30:42,889 INFO L87 Difference]: Start difference. First operand 36985 states and 120640 transitions. Second operand 5 states. [2019-12-18 14:30:43,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:43,752 INFO L93 Difference]: Finished difference Result 50257 states and 160609 transitions. [2019-12-18 14:30:43,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:30:43,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 14:30:43,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:43,845 INFO L225 Difference]: With dead ends: 50257 [2019-12-18 14:30:43,845 INFO L226 Difference]: Without dead ends: 50244 [2019-12-18 14:30:43,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:30:44,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50244 states. [2019-12-18 14:30:47,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50244 to 37328. [2019-12-18 14:30:47,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37328 states. [2019-12-18 14:30:47,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37328 states to 37328 states and 121606 transitions. [2019-12-18 14:30:47,320 INFO L78 Accepts]: Start accepts. Automaton has 37328 states and 121606 transitions. Word has length 19 [2019-12-18 14:30:47,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:47,320 INFO L462 AbstractCegarLoop]: Abstraction has 37328 states and 121606 transitions. [2019-12-18 14:30:47,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:30:47,320 INFO L276 IsEmpty]: Start isEmpty. Operand 37328 states and 121606 transitions. [2019-12-18 14:30:47,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:30:47,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:47,331 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:30:47,331 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:47,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:47,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1721998258, now seen corresponding path program 1 times [2019-12-18 14:30:47,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:47,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170584962] [2019-12-18 14:30:47,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:47,407 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:30:47,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170584962] [2019-12-18 14:30:47,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:47,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:30:47,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275823939] [2019-12-18 14:30:47,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:30:47,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:47,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:30:47,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:30:47,412 INFO L87 Difference]: Start difference. First operand 37328 states and 121606 transitions. Second operand 4 states. [2019-12-18 14:30:47,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:47,453 INFO L93 Difference]: Finished difference Result 7104 states and 19431 transitions. [2019-12-18 14:30:47,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:30:47,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 14:30:47,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:47,468 INFO L225 Difference]: With dead ends: 7104 [2019-12-18 14:30:47,468 INFO L226 Difference]: Without dead ends: 7104 [2019-12-18 14:30:47,469 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:30:47,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7104 states. [2019-12-18 14:30:47,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7104 to 6992. [2019-12-18 14:30:47,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6992 states. [2019-12-18 14:30:47,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6992 states to 6992 states and 19111 transitions. [2019-12-18 14:30:47,556 INFO L78 Accepts]: Start accepts. Automaton has 6992 states and 19111 transitions. Word has length 25 [2019-12-18 14:30:47,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:47,556 INFO L462 AbstractCegarLoop]: Abstraction has 6992 states and 19111 transitions. [2019-12-18 14:30:47,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:30:47,556 INFO L276 IsEmpty]: Start isEmpty. Operand 6992 states and 19111 transitions. [2019-12-18 14:30:47,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 14:30:47,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:47,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:30:47,567 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:47,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:47,567 INFO L82 PathProgramCache]: Analyzing trace with hash 2138974623, now seen corresponding path program 1 times [2019-12-18 14:30:47,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:47,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726295736] [2019-12-18 14:30:47,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:47,637 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:30:47,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726295736] [2019-12-18 14:30:47,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:47,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:30:47,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333001717] [2019-12-18 14:30:47,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:30:47,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:47,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:30:47,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:30:47,640 INFO L87 Difference]: Start difference. First operand 6992 states and 19111 transitions. Second operand 5 states. [2019-12-18 14:30:47,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:47,678 INFO L93 Difference]: Finished difference Result 5024 states and 14421 transitions. [2019-12-18 14:30:47,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:30:47,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 14:30:47,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:47,686 INFO L225 Difference]: With dead ends: 5024 [2019-12-18 14:30:47,686 INFO L226 Difference]: Without dead ends: 5024 [2019-12-18 14:30:47,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:30:47,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5024 states. [2019-12-18 14:30:47,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5024 to 4660. [2019-12-18 14:30:47,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2019-12-18 14:30:47,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 13437 transitions. [2019-12-18 14:30:47,775 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 13437 transitions. Word has length 37 [2019-12-18 14:30:47,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:47,776 INFO L462 AbstractCegarLoop]: Abstraction has 4660 states and 13437 transitions. [2019-12-18 14:30:47,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:30:47,776 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 13437 transitions. [2019-12-18 14:30:47,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:30:47,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:47,784 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:30:47,784 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:47,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:47,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1030638940, now seen corresponding path program 1 times [2019-12-18 14:30:47,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:47,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350643390] [2019-12-18 14:30:47,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:47,854 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:30:47,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350643390] [2019-12-18 14:30:47,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:47,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:30:47,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038280137] [2019-12-18 14:30:47,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:30:47,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:47,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:30:47,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:30:47,856 INFO L87 Difference]: Start difference. First operand 4660 states and 13437 transitions. Second operand 3 states. [2019-12-18 14:30:47,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:47,913 INFO L93 Difference]: Finished difference Result 4669 states and 13450 transitions. [2019-12-18 14:30:47,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:30:47,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:30:47,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:47,921 INFO L225 Difference]: With dead ends: 4669 [2019-12-18 14:30:47,922 INFO L226 Difference]: Without dead ends: 4669 [2019-12-18 14:30:47,922 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:30:47,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-18 14:30:47,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-18 14:30:47,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-18 14:30:48,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13446 transitions. [2019-12-18 14:30:48,008 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13446 transitions. Word has length 65 [2019-12-18 14:30:48,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:48,009 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13446 transitions. [2019-12-18 14:30:48,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:30:48,009 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13446 transitions. [2019-12-18 14:30:48,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:30:48,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:48,019 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:30:48,019 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:48,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:48,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1902070617, now seen corresponding path program 1 times [2019-12-18 14:30:48,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:48,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572464007] [2019-12-18 14:30:48,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:48,099 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:30:48,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572464007] [2019-12-18 14:30:48,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:48,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:30:48,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542808989] [2019-12-18 14:30:48,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:30:48,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:48,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:30:48,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:30:48,104 INFO L87 Difference]: Start difference. First operand 4665 states and 13446 transitions. Second operand 3 states. [2019-12-18 14:30:48,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:48,165 INFO L93 Difference]: Finished difference Result 4669 states and 13441 transitions. [2019-12-18 14:30:48,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:30:48,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:30:48,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:48,174 INFO L225 Difference]: With dead ends: 4669 [2019-12-18 14:30:48,174 INFO L226 Difference]: Without dead ends: 4669 [2019-12-18 14:30:48,174 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:30:48,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-18 14:30:48,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-18 14:30:48,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-18 14:30:48,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13437 transitions. [2019-12-18 14:30:48,274 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13437 transitions. Word has length 65 [2019-12-18 14:30:48,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:48,275 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13437 transitions. [2019-12-18 14:30:48,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:30:48,275 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13437 transitions. [2019-12-18 14:30:48,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:30:48,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:48,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, 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:30:48,287 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:48,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:48,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1892358751, now seen corresponding path program 1 times [2019-12-18 14:30:48,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:48,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953055286] [2019-12-18 14:30:48,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:48,449 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:30:48,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953055286] [2019-12-18 14:30:48,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:48,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:30:48,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715437889] [2019-12-18 14:30:48,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:30:48,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:48,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:30:48,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:30:48,453 INFO L87 Difference]: Start difference. First operand 4665 states and 13437 transitions. Second operand 3 states. [2019-12-18 14:30:48,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:48,481 INFO L93 Difference]: Finished difference Result 4665 states and 13233 transitions. [2019-12-18 14:30:48,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:30:48,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:30:48,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:48,488 INFO L225 Difference]: With dead ends: 4665 [2019-12-18 14:30:48,489 INFO L226 Difference]: Without dead ends: 4665 [2019-12-18 14:30:48,489 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:30:48,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4665 states. [2019-12-18 14:30:48,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4665 to 4665. [2019-12-18 14:30:48,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-18 14:30:48,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13233 transitions. [2019-12-18 14:30:48,567 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13233 transitions. Word has length 65 [2019-12-18 14:30:48,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:48,567 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13233 transitions. [2019-12-18 14:30:48,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:30:48,567 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13233 transitions. [2019-12-18 14:30:48,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:30:48,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:48,573 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:30:48,573 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:48,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:48,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1887448171, now seen corresponding path program 1 times [2019-12-18 14:30:48,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:48,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226933350] [2019-12-18 14:30:48,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:48,671 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:30:48,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226933350] [2019-12-18 14:30:48,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:48,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:30:48,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859628639] [2019-12-18 14:30:48,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:30:48,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:48,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:30:48,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:30:48,674 INFO L87 Difference]: Start difference. First operand 4665 states and 13233 transitions. Second operand 5 states. [2019-12-18 14:30:49,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:49,037 INFO L93 Difference]: Finished difference Result 6995 states and 19609 transitions. [2019-12-18 14:30:49,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:30:49,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-18 14:30:49,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:49,051 INFO L225 Difference]: With dead ends: 6995 [2019-12-18 14:30:49,051 INFO L226 Difference]: Without dead ends: 6995 [2019-12-18 14:30:49,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:30:49,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6995 states. [2019-12-18 14:30:49,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6995 to 4949. [2019-12-18 14:30:49,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4949 states. [2019-12-18 14:30:49,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4949 states to 4949 states and 14078 transitions. [2019-12-18 14:30:49,181 INFO L78 Accepts]: Start accepts. Automaton has 4949 states and 14078 transitions. Word has length 66 [2019-12-18 14:30:49,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:49,182 INFO L462 AbstractCegarLoop]: Abstraction has 4949 states and 14078 transitions. [2019-12-18 14:30:49,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:30:49,182 INFO L276 IsEmpty]: Start isEmpty. Operand 4949 states and 14078 transitions. [2019-12-18 14:30:49,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:30:49,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:49,191 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:30:49,192 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:49,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:49,192 INFO L82 PathProgramCache]: Analyzing trace with hash 284491425, now seen corresponding path program 2 times [2019-12-18 14:30:49,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:49,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849917204] [2019-12-18 14:30:49,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:49,290 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:30:49,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849917204] [2019-12-18 14:30:49,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:49,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:30:49,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972027657] [2019-12-18 14:30:49,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:30:49,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:49,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:30:49,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:30:49,292 INFO L87 Difference]: Start difference. First operand 4949 states and 14078 transitions. Second operand 6 states. [2019-12-18 14:30:49,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:49,713 INFO L93 Difference]: Finished difference Result 6941 states and 19455 transitions. [2019-12-18 14:30:49,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:30:49,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 14:30:49,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:49,722 INFO L225 Difference]: With dead ends: 6941 [2019-12-18 14:30:49,723 INFO L226 Difference]: Without dead ends: 6941 [2019-12-18 14:30:49,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:30:49,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6941 states. [2019-12-18 14:30:49,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6941 to 5572. [2019-12-18 14:30:49,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5572 states. [2019-12-18 14:30:49,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5572 states to 5572 states and 15823 transitions. [2019-12-18 14:30:49,807 INFO L78 Accepts]: Start accepts. Automaton has 5572 states and 15823 transitions. Word has length 66 [2019-12-18 14:30:49,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:49,807 INFO L462 AbstractCegarLoop]: Abstraction has 5572 states and 15823 transitions. [2019-12-18 14:30:49,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:30:49,807 INFO L276 IsEmpty]: Start isEmpty. Operand 5572 states and 15823 transitions. [2019-12-18 14:30:49,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:30:49,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:49,815 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:30:49,815 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:49,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:49,815 INFO L82 PathProgramCache]: Analyzing trace with hash -2082058241, now seen corresponding path program 3 times [2019-12-18 14:30:49,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:49,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280671836] [2019-12-18 14:30:49,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:50,083 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:30:50,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280671836] [2019-12-18 14:30:50,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:50,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:30:50,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122165490] [2019-12-18 14:30:50,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:30:50,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:50,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:30:50,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:30:50,085 INFO L87 Difference]: Start difference. First operand 5572 states and 15823 transitions. Second operand 6 states. [2019-12-18 14:30:50,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:50,500 INFO L93 Difference]: Finished difference Result 7758 states and 21651 transitions. [2019-12-18 14:30:50,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:30:50,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 14:30:50,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:50,511 INFO L225 Difference]: With dead ends: 7758 [2019-12-18 14:30:50,511 INFO L226 Difference]: Without dead ends: 7758 [2019-12-18 14:30:50,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:30:50,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7758 states. [2019-12-18 14:30:50,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7758 to 6183. [2019-12-18 14:30:50,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6183 states. [2019-12-18 14:30:50,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6183 states to 6183 states and 17414 transitions. [2019-12-18 14:30:50,620 INFO L78 Accepts]: Start accepts. Automaton has 6183 states and 17414 transitions. Word has length 66 [2019-12-18 14:30:50,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:50,620 INFO L462 AbstractCegarLoop]: Abstraction has 6183 states and 17414 transitions. [2019-12-18 14:30:50,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:30:50,620 INFO L276 IsEmpty]: Start isEmpty. Operand 6183 states and 17414 transitions. [2019-12-18 14:30:50,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:30:50,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:50,629 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:30:50,629 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:50,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:50,630 INFO L82 PathProgramCache]: Analyzing trace with hash 504707035, now seen corresponding path program 4 times [2019-12-18 14:30:50,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:50,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886097737] [2019-12-18 14:30:50,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:50,757 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:30:50,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886097737] [2019-12-18 14:30:50,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:50,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:30:50,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846657892] [2019-12-18 14:30:50,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:30:50,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:50,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:30:50,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:30:50,759 INFO L87 Difference]: Start difference. First operand 6183 states and 17414 transitions. Second operand 7 states. [2019-12-18 14:30:50,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:50,996 INFO L93 Difference]: Finished difference Result 20902 states and 59110 transitions. [2019-12-18 14:30:50,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:30:50,997 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 14:30:50,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:51,020 INFO L225 Difference]: With dead ends: 20902 [2019-12-18 14:30:51,021 INFO L226 Difference]: Without dead ends: 12484 [2019-12-18 14:30:51,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:30:51,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12484 states. [2019-12-18 14:30:51,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12484 to 6183. [2019-12-18 14:30:51,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6183 states. [2019-12-18 14:30:51,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6183 states to 6183 states and 17345 transitions. [2019-12-18 14:30:51,247 INFO L78 Accepts]: Start accepts. Automaton has 6183 states and 17345 transitions. Word has length 66 [2019-12-18 14:30:51,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:51,247 INFO L462 AbstractCegarLoop]: Abstraction has 6183 states and 17345 transitions. [2019-12-18 14:30:51,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:30:51,248 INFO L276 IsEmpty]: Start isEmpty. Operand 6183 states and 17345 transitions. [2019-12-18 14:30:51,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:30:51,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:51,260 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:30:51,261 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:51,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:51,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1405133371, now seen corresponding path program 5 times [2019-12-18 14:30:51,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:51,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891661361] [2019-12-18 14:30:51,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:51,362 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:30:51,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891661361] [2019-12-18 14:30:51,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:51,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:30:51,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878833651] [2019-12-18 14:30:51,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:30:51,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:51,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:30:51,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:30:51,364 INFO L87 Difference]: Start difference. First operand 6183 states and 17345 transitions. Second operand 7 states. [2019-12-18 14:30:52,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:52,068 INFO L93 Difference]: Finished difference Result 8824 states and 24459 transitions. [2019-12-18 14:30:52,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 14:30:52,068 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 14:30:52,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:52,080 INFO L225 Difference]: With dead ends: 8824 [2019-12-18 14:30:52,080 INFO L226 Difference]: Without dead ends: 8824 [2019-12-18 14:30:52,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:30:52,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8824 states. [2019-12-18 14:30:52,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8824 to 6015. [2019-12-18 14:30:52,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6015 states. [2019-12-18 14:30:52,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6015 states to 6015 states and 16893 transitions. [2019-12-18 14:30:52,182 INFO L78 Accepts]: Start accepts. Automaton has 6015 states and 16893 transitions. Word has length 66 [2019-12-18 14:30:52,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:52,182 INFO L462 AbstractCegarLoop]: Abstraction has 6015 states and 16893 transitions. [2019-12-18 14:30:52,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:30:52,182 INFO L276 IsEmpty]: Start isEmpty. Operand 6015 states and 16893 transitions. [2019-12-18 14:30:52,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:30:52,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:52,190 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:30:52,190 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:52,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:52,190 INFO L82 PathProgramCache]: Analyzing trace with hash 501840945, now seen corresponding path program 6 times [2019-12-18 14:30:52,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:52,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836748315] [2019-12-18 14:30:52,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:52,240 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:30:52,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836748315] [2019-12-18 14:30:52,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:52,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:30:52,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278924520] [2019-12-18 14:30:52,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:30:52,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:52,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:30:52,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:30:52,245 INFO L87 Difference]: Start difference. First operand 6015 states and 16893 transitions. Second operand 3 states. [2019-12-18 14:30:52,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:52,270 INFO L93 Difference]: Finished difference Result 5465 states and 15148 transitions. [2019-12-18 14:30:52,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:30:52,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 14:30:52,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:52,278 INFO L225 Difference]: With dead ends: 5465 [2019-12-18 14:30:52,278 INFO L226 Difference]: Without dead ends: 5465 [2019-12-18 14:30:52,279 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:30:52,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5465 states. [2019-12-18 14:30:52,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5465 to 5465. [2019-12-18 14:30:52,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5465 states. [2019-12-18 14:30:52,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5465 states to 5465 states and 15148 transitions. [2019-12-18 14:30:52,370 INFO L78 Accepts]: Start accepts. Automaton has 5465 states and 15148 transitions. Word has length 66 [2019-12-18 14:30:52,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:52,370 INFO L462 AbstractCegarLoop]: Abstraction has 5465 states and 15148 transitions. [2019-12-18 14:30:52,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:30:52,370 INFO L276 IsEmpty]: Start isEmpty. Operand 5465 states and 15148 transitions. [2019-12-18 14:30:52,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:30:52,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:52,378 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:30:52,378 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:52,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:52,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1603018859, now seen corresponding path program 1 times [2019-12-18 14:30:52,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:52,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82950935] [2019-12-18 14:30:52,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:52,488 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:30:52,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82950935] [2019-12-18 14:30:52,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:52,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:30:52,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951893164] [2019-12-18 14:30:52,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:30:52,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:52,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:30:52,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:30:52,490 INFO L87 Difference]: Start difference. First operand 5465 states and 15148 transitions. Second operand 6 states. [2019-12-18 14:30:52,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:52,588 INFO L93 Difference]: Finished difference Result 9376 states and 25973 transitions. [2019-12-18 14:30:52,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:30:52,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-18 14:30:52,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:52,595 INFO L225 Difference]: With dead ends: 9376 [2019-12-18 14:30:52,595 INFO L226 Difference]: Without dead ends: 4140 [2019-12-18 14:30:52,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:30:52,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4140 states. [2019-12-18 14:30:52,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4140 to 3504. [2019-12-18 14:30:52,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3504 states. [2019-12-18 14:30:52,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3504 states to 3504 states and 9592 transitions. [2019-12-18 14:30:52,643 INFO L78 Accepts]: Start accepts. Automaton has 3504 states and 9592 transitions. Word has length 67 [2019-12-18 14:30:52,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:52,643 INFO L462 AbstractCegarLoop]: Abstraction has 3504 states and 9592 transitions. [2019-12-18 14:30:52,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:30:52,643 INFO L276 IsEmpty]: Start isEmpty. Operand 3504 states and 9592 transitions. [2019-12-18 14:30:52,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:30:52,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:52,647 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:30:52,647 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:52,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:52,648 INFO L82 PathProgramCache]: Analyzing trace with hash -378425991, now seen corresponding path program 2 times [2019-12-18 14:30:52,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:52,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262656033] [2019-12-18 14:30:52,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:52,836 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:30:52,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262656033] [2019-12-18 14:30:52,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:52,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:30:52,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840767451] [2019-12-18 14:30:52,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:30:52,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:52,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:30:52,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:30:52,841 INFO L87 Difference]: Start difference. First operand 3504 states and 9592 transitions. Second operand 10 states. [2019-12-18 14:30:53,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:53,783 INFO L93 Difference]: Finished difference Result 6629 states and 17838 transitions. [2019-12-18 14:30:53,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 14:30:53,784 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 14:30:53,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:53,793 INFO L225 Difference]: With dead ends: 6629 [2019-12-18 14:30:53,793 INFO L226 Difference]: Without dead ends: 6629 [2019-12-18 14:30:53,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:30:53,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6629 states. [2019-12-18 14:30:53,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6629 to 3581. [2019-12-18 14:30:53,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3581 states. [2019-12-18 14:30:53,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3581 states to 3581 states and 9770 transitions. [2019-12-18 14:30:53,989 INFO L78 Accepts]: Start accepts. Automaton has 3581 states and 9770 transitions. Word has length 67 [2019-12-18 14:30:53,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:53,989 INFO L462 AbstractCegarLoop]: Abstraction has 3581 states and 9770 transitions. [2019-12-18 14:30:53,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:30:53,990 INFO L276 IsEmpty]: Start isEmpty. Operand 3581 states and 9770 transitions. [2019-12-18 14:30:53,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:30:53,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:53,993 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:30:53,993 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:53,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:53,994 INFO L82 PathProgramCache]: Analyzing trace with hash 2109267181, now seen corresponding path program 3 times [2019-12-18 14:30:53,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:53,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129947601] [2019-12-18 14:30:53,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:54,136 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:30:54,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129947601] [2019-12-18 14:30:54,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:54,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:30:54,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798078991] [2019-12-18 14:30:54,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:30:54,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:54,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:30:54,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:30:54,138 INFO L87 Difference]: Start difference. First operand 3581 states and 9770 transitions. Second operand 7 states. [2019-12-18 14:30:54,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:54,237 INFO L93 Difference]: Finished difference Result 6782 states and 18592 transitions. [2019-12-18 14:30:54,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:30:54,237 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-18 14:30:54,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:54,242 INFO L225 Difference]: With dead ends: 6782 [2019-12-18 14:30:54,243 INFO L226 Difference]: Without dead ends: 3242 [2019-12-18 14:30:54,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:30:54,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3242 states. [2019-12-18 14:30:54,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3242 to 2774. [2019-12-18 14:30:54,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2774 states. [2019-12-18 14:30:54,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 7553 transitions. [2019-12-18 14:30:54,310 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 7553 transitions. Word has length 67 [2019-12-18 14:30:54,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:54,310 INFO L462 AbstractCegarLoop]: Abstraction has 2774 states and 7553 transitions. [2019-12-18 14:30:54,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:30:54,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 7553 transitions. [2019-12-18 14:30:54,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:30:54,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:54,316 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:30:54,317 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:54,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:54,317 INFO L82 PathProgramCache]: Analyzing trace with hash 905212147, now seen corresponding path program 4 times [2019-12-18 14:30:54,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:54,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101166221] [2019-12-18 14:30:54,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:54,726 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:30:54,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101166221] [2019-12-18 14:30:54,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:54,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 14:30:54,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45083030] [2019-12-18 14:30:54,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 14:30:54,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:54,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 14:30:54,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:30:54,729 INFO L87 Difference]: Start difference. First operand 2774 states and 7553 transitions. Second operand 14 states. [2019-12-18 14:30:57,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:57,013 INFO L93 Difference]: Finished difference Result 6877 states and 18444 transitions. [2019-12-18 14:30:57,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 14:30:57,013 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-18 14:30:57,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:57,022 INFO L225 Difference]: With dead ends: 6877 [2019-12-18 14:30:57,022 INFO L226 Difference]: Without dead ends: 6877 [2019-12-18 14:30:57,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=303, Invalid=1029, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 14:30:57,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6877 states. [2019-12-18 14:30:57,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6877 to 2868. [2019-12-18 14:30:57,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2868 states. [2019-12-18 14:30:57,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2868 states to 2868 states and 7825 transitions. [2019-12-18 14:30:57,081 INFO L78 Accepts]: Start accepts. Automaton has 2868 states and 7825 transitions. Word has length 67 [2019-12-18 14:30:57,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:57,081 INFO L462 AbstractCegarLoop]: Abstraction has 2868 states and 7825 transitions. [2019-12-18 14:30:57,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 14:30:57,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2868 states and 7825 transitions. [2019-12-18 14:30:57,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:30:57,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:57,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:30:57,084 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:57,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:57,085 INFO L82 PathProgramCache]: Analyzing trace with hash -902061977, now seen corresponding path program 5 times [2019-12-18 14:30:57,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:57,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141461252] [2019-12-18 14:30:57,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:57,134 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:30:57,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141461252] [2019-12-18 14:30:57,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:57,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:30:57,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725596157] [2019-12-18 14:30:57,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:30:57,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:57,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:30:57,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:30:57,136 INFO L87 Difference]: Start difference. First operand 2868 states and 7825 transitions. Second operand 3 states. [2019-12-18 14:30:57,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:57,172 INFO L93 Difference]: Finished difference Result 2868 states and 7824 transitions. [2019-12-18 14:30:57,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:30:57,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 14:30:57,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:57,177 INFO L225 Difference]: With dead ends: 2868 [2019-12-18 14:30:57,177 INFO L226 Difference]: Without dead ends: 2868 [2019-12-18 14:30:57,177 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:30:57,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2868 states. [2019-12-18 14:30:57,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2868 to 1828. [2019-12-18 14:30:57,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1828 states. [2019-12-18 14:30:57,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 5006 transitions. [2019-12-18 14:30:57,214 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 5006 transitions. Word has length 67 [2019-12-18 14:30:57,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:57,215 INFO L462 AbstractCegarLoop]: Abstraction has 1828 states and 5006 transitions. [2019-12-18 14:30:57,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:30:57,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 5006 transitions. [2019-12-18 14:30:57,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:30:57,216 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:57,217 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:30:57,217 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:57,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:57,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1259160564, now seen corresponding path program 1 times [2019-12-18 14:30:57,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:57,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015842052] [2019-12-18 14:30:57,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:30:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:30:57,331 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:30:57,331 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:30:57,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1882~0.base_20| 4) |v_#length_25|) (= 0 v_~x~0_194) (= 0 v_~x$r_buff0_thd2~0_213) (= 0 v_~weak$$choice0~0_14) (= v_~x$mem_tmp~0_19 0) (= 0 v_~x$w_buff0~0_268) (= (store .cse0 |v_ULTIMATE.start_main_~#t1882~0.base_20| 1) |v_#valid_53|) (= |v_ULTIMATE.start_main_~#t1882~0.offset_17| 0) (= 0 v_~x$r_buff1_thd2~0_212) (= v_~x$r_buff1_thd0~0_297 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1882~0.base_20|) 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd1~0_187 0) (= v_~__unbuffered_p2_EBX~0_22 0) (= v_~x$r_buff0_thd0~0_372 0) (= 0 v_~x$read_delayed~0_6) (= v_~__unbuffered_cnt~0_155 0) (= 0 v_~x$w_buff1~0_230) (= 0 |v_#NULL.base_4|) (= 0 v_~x$r_buff1_thd3~0_195) (= 0 v_~x$r_buff0_thd3~0_123) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1882~0.base_20| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1882~0.base_20|) |v_ULTIMATE.start_main_~#t1882~0.offset_17| 0)) |v_#memory_int_21|) (= |v_#NULL.offset_4| 0) (= 0 v_~x$w_buff1_used~0_504) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~x$r_buff0_thd1~0_120 0) (= 0 v_~__unbuffered_p2_EAX~0_22) (= v_~x$flush_delayed~0_34 0) (= v_~main$tmp_guard0~0_24 0) (= v_~weak$$choice2~0_110 0) (= v_~y~0_136 0) (= 0 v_~x$w_buff0_used~0_807) (= v_~main$tmp_guard1~0_22 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1882~0.base_20|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ~x$w_buff0~0=v_~x$w_buff0~0_268, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ~x$flush_delayed~0=v_~x$flush_delayed~0_34, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_39|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_45|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_187, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_123, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_50|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_32|, ULTIMATE.start_main_~#t1883~0.offset=|v_ULTIMATE.start_main_~#t1883~0.offset_17|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_372, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_37|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_42|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_504, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_212, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_48|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_111|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~x~0=v_~x~0_194, ULTIMATE.start_main_~#t1882~0.base=|v_ULTIMATE.start_main_~#t1882~0.base_20|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_120, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_33|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_29|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_195, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_125|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_25|, ULTIMATE.start_main_~#t1884~0.offset=|v_ULTIMATE.start_main_~#t1884~0.offset_16|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~y~0=v_~y~0_136, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_48|, ULTIMATE.start_main_~#t1883~0.base=|v_ULTIMATE.start_main_~#t1883~0.base_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_main_~#t1882~0.offset=|v_ULTIMATE.start_main_~#t1882~0.offset_17|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_297, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_213, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_38|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_807, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t1884~0.base=|v_ULTIMATE.start_main_~#t1884~0.base_20|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_110, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t1883~0.offset, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1882~0.base, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t1884~0.offset, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1883~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1882~0.offset, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1884~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 14:30:57,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L805-1-->L807: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1883~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1883~0.base_11|) (= |v_ULTIMATE.start_main_~#t1883~0.offset_10| 0) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1883~0.base_11|) 0) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1883~0.base_11| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1883~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1883~0.base_11|) |v_ULTIMATE.start_main_~#t1883~0.offset_10| 1)) |v_#memory_int_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1883~0.base_11| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1883~0.offset=|v_ULTIMATE.start_main_~#t1883~0.offset_10|, ULTIMATE.start_main_~#t1883~0.base=|v_ULTIMATE.start_main_~#t1883~0.base_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, ULTIMATE.start_main_~#t1883~0.offset, ULTIMATE.start_main_~#t1883~0.base, #length] because there is no mapped edge [2019-12-18 14:30:57,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1884~0.base_9|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1884~0.base_9|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1884~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1884~0.base_9|) |v_ULTIMATE.start_main_~#t1884~0.offset_8| 2))) (= 0 |v_ULTIMATE.start_main_~#t1884~0.offset_8|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1884~0.base_9| 1) |v_#valid_27|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1884~0.base_9|) 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1884~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1884~0.base=|v_ULTIMATE.start_main_~#t1884~0.base_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1884~0.offset=|v_ULTIMATE.start_main_~#t1884~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1884~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1884~0.offset] because there is no mapped edge [2019-12-18 14:30:57,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_11| v_P1Thread1of1ForFork1_~arg.offset_11) (= 1 v_~x$w_buff0_used~0_98) (= 2 v_~x$w_buff0~0_31) (= v_P1Thread1of1ForFork1_~arg.base_11 |v_P1Thread1of1ForFork1_#in~arg.base_11|) (= v_~x$w_buff1_used~0_55 v_~x$w_buff0_used~0_99) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 0 (mod v_~x$w_buff1_used~0_55 256)) (= v_~x$w_buff0~0_32 v_~x$w_buff1~0_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13, ~x$w_buff0~0=v_~x$w_buff0~0_31, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_11, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_11, ~x$w_buff1~0=v_~x$w_buff1~0_21, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 14:30:57,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In-325839519 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-325839519 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-325839519| ~x$w_buff1~0_In-325839519)) (and (or .cse0 .cse1) (= ~x~0_In-325839519 |P2Thread1of1ForFork2_#t~ite15_Out-325839519|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-325839519, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-325839519, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-325839519, ~x~0=~x~0_In-325839519} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-325839519|, ~x$w_buff1~0=~x$w_buff1~0_In-325839519, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-325839519, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-325839519, ~x~0=~x~0_In-325839519} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 14:30:57,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L782-4-->L783: Formula: (= v_~x~0_20 |v_P2Thread1of1ForFork2_#t~ite15_12|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_12|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_11|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-18 14:30:57,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In435554485 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In435554485 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite17_Out435554485| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out435554485| ~x$w_buff0_used~0_In435554485) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In435554485, ~x$w_buff0_used~0=~x$w_buff0_used~0_In435554485} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In435554485, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out435554485|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In435554485} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 14:30:57,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-922952628 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-922952628 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-922952628 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd3~0_In-922952628 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite18_Out-922952628|)) (and (= ~x$w_buff1_used~0_In-922952628 |P2Thread1of1ForFork2_#t~ite18_Out-922952628|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-922952628, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-922952628, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-922952628, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-922952628} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-922952628, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-922952628, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-922952628, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-922952628|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-922952628} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 14:30:57,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L733-2-->L733-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out-872988990| |P0Thread1of1ForFork0_#t~ite3_Out-872988990|)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-872988990 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-872988990 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~x~0_In-872988990 |P0Thread1of1ForFork0_#t~ite3_Out-872988990|)) (and .cse0 (not .cse1) (not .cse2) (= ~x$w_buff1~0_In-872988990 |P0Thread1of1ForFork0_#t~ite3_Out-872988990|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-872988990, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-872988990, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-872988990, ~x~0=~x~0_In-872988990} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-872988990|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-872988990|, ~x$w_buff1~0=~x$w_buff1~0_In-872988990, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-872988990, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-872988990, ~x~0=~x~0_In-872988990} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 14:30:57,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L734-->L734-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In147313274 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In147313274 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out147313274| ~x$w_buff0_used~0_In147313274) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out147313274| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In147313274, ~x$w_buff0_used~0=~x$w_buff0_used~0_In147313274} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out147313274|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In147313274, ~x$w_buff0_used~0=~x$w_buff0_used~0_In147313274} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 14:30:57,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L735-->L735-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1208034613 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In1208034613 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd1~0_In1208034613 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1208034613 256) 0))) (or (and (= ~x$w_buff1_used~0_In1208034613 |P0Thread1of1ForFork0_#t~ite6_Out1208034613|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1208034613|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1208034613, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1208034613, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1208034613, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1208034613} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1208034613|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1208034613, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1208034613, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1208034613, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1208034613} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 14:30:57,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In25147076 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In25147076 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out25147076| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite19_Out25147076| ~x$r_buff0_thd3~0_In25147076)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In25147076, ~x$w_buff0_used~0=~x$w_buff0_used~0_In25147076} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In25147076, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out25147076|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In25147076} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 14:30:57,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-300761640 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-300761640 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In-300761640 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-300761640 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out-300761640| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite20_Out-300761640| ~x$r_buff1_thd3~0_In-300761640)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-300761640, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-300761640, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-300761640, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-300761640} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-300761640|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-300761640, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-300761640, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-300761640, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-300761640} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 14:30:57,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= |v_P2Thread1of1ForFork2_#t~ite20_54| v_~x$r_buff1_thd3~0_147)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_54|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_53|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_147, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 14:30:57,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L736-->L736-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1639097275 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In1639097275 256) 0))) (or (and (= ~x$r_buff0_thd1~0_In1639097275 |P0Thread1of1ForFork0_#t~ite7_Out1639097275|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out1639097275|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1639097275, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1639097275} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1639097275, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1639097275|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1639097275} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 14:30:57,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L737-->L737-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd1~0_In-1107819959 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1107819959 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1107819959 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-1107819959 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1107819959|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$r_buff1_thd1~0_In-1107819959 |P0Thread1of1ForFork0_#t~ite8_Out-1107819959|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1107819959, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1107819959, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1107819959, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1107819959} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1107819959, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1107819959|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1107819959, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1107819959, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1107819959} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 14:30:57,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L737-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_61 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_61} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 14:30:57,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In790421024 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In790421024 256)))) (or (and (= ~x$w_buff0_used~0_In790421024 |P1Thread1of1ForFork1_#t~ite11_Out790421024|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out790421024| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In790421024, ~x$w_buff0_used~0=~x$w_buff0_used~0_In790421024} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out790421024|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In790421024, ~x$w_buff0_used~0=~x$w_buff0_used~0_In790421024} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 14:30:57,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L764-->L764-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In-1708144852 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1708144852 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1708144852 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1708144852 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-1708144852| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1708144852 |P1Thread1of1ForFork1_#t~ite12_Out-1708144852|) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1708144852, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1708144852, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1708144852, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1708144852} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1708144852, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1708144852, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1708144852|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1708144852, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1708144852} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 14:30:57,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L766: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1300280397 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1300280397 256) 0))) (or (and (= 0 ~x$r_buff0_thd2~0_Out1300280397) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In1300280397 ~x$r_buff0_thd2~0_Out1300280397)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1300280397, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1300280397} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1300280397|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1300280397, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1300280397} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 14:30:57,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L766-->L766-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1901269752 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In1901269752 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1901269752 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1901269752 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out1901269752| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite14_Out1901269752| ~x$r_buff1_thd2~0_In1901269752)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1901269752, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1901269752, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1901269752, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1901269752} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1901269752, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1901269752, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1901269752, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1901269752|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1901269752} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 14:30:57,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_162 |v_P1Thread1of1ForFork1_#t~ite14_42|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_162, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_41|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 14:30:57,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 14:30:57,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L815-2-->L815-5: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In713063235 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In713063235 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite25_Out713063235| |ULTIMATE.start_main_#t~ite24_Out713063235|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite24_Out713063235| ~x$w_buff1~0_In713063235) .cse1 (not .cse2)) (and (or .cse0 .cse2) (= ~x~0_In713063235 |ULTIMATE.start_main_#t~ite24_Out713063235|) .cse1))) InVars {~x$w_buff1~0=~x$w_buff1~0_In713063235, ~x$w_buff1_used~0=~x$w_buff1_used~0_In713063235, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In713063235, ~x~0=~x~0_In713063235} OutVars{~x$w_buff1~0=~x$w_buff1~0_In713063235, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out713063235|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out713063235|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In713063235, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In713063235, ~x~0=~x~0_In713063235} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 14:30:57,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1080184849 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1080184849 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite26_Out1080184849|) (not .cse1)) (and (= ~x$w_buff0_used~0_In1080184849 |ULTIMATE.start_main_#t~ite26_Out1080184849|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1080184849, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1080184849} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1080184849, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1080184849|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1080184849} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 14:30:57,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L817-->L817-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1816006528 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-1816006528 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1816006528 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1816006528 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite27_Out-1816006528| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite27_Out-1816006528| ~x$w_buff1_used~0_In-1816006528) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1816006528, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1816006528, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1816006528, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1816006528} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1816006528, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1816006528, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1816006528|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1816006528, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1816006528} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 14:30:57,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1551771647 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1551771647 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In1551771647 |ULTIMATE.start_main_#t~ite28_Out1551771647|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite28_Out1551771647| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1551771647, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1551771647} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1551771647, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1551771647|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1551771647} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 14:30:57,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-1766402908 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-1766402908 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1766402908 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1766402908 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite29_Out-1766402908| 0)) (and (= |ULTIMATE.start_main_#t~ite29_Out-1766402908| ~x$r_buff1_thd0~0_In-1766402908) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1766402908, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1766402908, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1766402908, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1766402908} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1766402908, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1766402908|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1766402908, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1766402908, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1766402908} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 14:30:57,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L831-->L832: Formula: (and (= v_~x$r_buff0_thd0~0_112 v_~x$r_buff0_thd0~0_111) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_112, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_111, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 14:30:57,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L834-->L837-1: Formula: (and (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= (mod v_~x$flush_delayed~0_23 256) 0)) (= v_~x$mem_tmp~0_13 v_~x~0_153) (= v_~x$flush_delayed~0_22 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_13} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ~x$flush_delayed~0=v_~x$flush_delayed~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~x~0=v_~x~0_153, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:30:57,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 14:30:57,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:30:57 BasicIcfg [2019-12-18 14:30:57,460 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:30:57,462 INFO L168 Benchmark]: Toolchain (without parser) took 88071.59 ms. Allocated memory was 146.3 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 102.6 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 14:30:57,463 INFO L168 Benchmark]: CDTParser took 1.49 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 14:30:57,463 INFO L168 Benchmark]: CACSL2BoogieTranslator took 873.75 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.2 MB in the beginning and 156.9 MB in the end (delta: -54.7 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:30:57,464 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.69 ms. Allocated memory is still 203.4 MB. Free memory was 156.9 MB in the beginning and 153.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 14:30:57,464 INFO L168 Benchmark]: Boogie Preprocessor took 64.18 ms. Allocated memory is still 203.4 MB. Free memory was 153.7 MB in the beginning and 151.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 14:30:57,465 INFO L168 Benchmark]: RCFGBuilder took 874.55 ms. Allocated memory is still 203.4 MB. Free memory was 151.1 MB in the beginning and 101.5 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:30:57,466 INFO L168 Benchmark]: TraceAbstraction took 86178.02 ms. Allocated memory was 203.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 101.5 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 14:30:57,469 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.49 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 873.75 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.2 MB in the beginning and 156.9 MB in the end (delta: -54.7 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.69 ms. Allocated memory is still 203.4 MB. Free memory was 156.9 MB in the beginning and 153.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.18 ms. Allocated memory is still 203.4 MB. Free memory was 153.7 MB in the beginning and 151.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 874.55 ms. Allocated memory is still 203.4 MB. Free memory was 151.1 MB in the beginning and 101.5 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 86178.02 ms. Allocated memory was 203.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 101.5 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 174 ProgramPointsBefore, 94 ProgramPointsAfterwards, 211 TransitionsBefore, 106 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 29 ChoiceCompositions, 6159 VarBasedMoverChecksPositive, 253 VarBasedMoverChecksNegative, 78 SemBasedMoverChecksPositive, 250 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 78277 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t1882, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L807] FCALL, FORK 0 pthread_create(&t1883, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L809] FCALL, FORK 0 pthread_create(&t1884, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L756] 2 x$r_buff0_thd2 = (_Bool)1 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L727] 1 y = 2 [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L733] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L784] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L785] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L762] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L763] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L764] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L815] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L816] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L817] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L818] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L819] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 x$flush_delayed = weak$$choice2 [L825] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L827] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L828] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L828] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L829] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L830] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L832] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 85.8s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 26.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3204 SDtfs, 3022 SDslu, 6907 SDs, 0 SdLazy, 4780 SolverSat, 203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 50 SyntacticMatches, 18 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183279occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 34.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 86965 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1117 NumberOfCodeBlocks, 1117 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1028 ConstructedInterpolants, 0 QuantifiedInterpolants, 199737 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...