/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:45:33,213 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:45:33,216 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:45:33,228 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:45:33,228 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:45:33,229 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:45:33,231 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:45:33,233 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:45:33,234 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:45:33,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:45:33,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:45:33,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:45:33,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:45:33,239 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:45:33,240 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:45:33,241 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:45:33,242 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:45:33,243 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:45:33,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:45:33,247 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:45:33,249 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:45:33,250 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:45:33,251 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:45:33,252 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:45:33,254 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:45:33,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:45:33,255 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:45:33,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:45:33,256 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:45:33,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:45:33,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:45:33,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:45:33,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:45:33,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:45:33,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:45:33,262 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:45:33,262 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:45:33,263 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:45:33,263 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:45:33,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:45:33,265 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:45:33,265 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 16:45:33,279 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:45:33,280 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:45:33,281 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:45:33,281 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:45:33,281 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:45:33,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:45:33,282 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:45:33,282 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:45:33,282 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:45:33,282 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:45:33,283 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:45:33,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:45:33,283 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:45:33,283 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:45:33,283 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:45:33,283 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:45:33,284 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:45:33,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:45:33,284 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:45:33,284 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:45:33,285 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:45:33,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:45:33,285 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:45:33,285 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:45:33,286 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:45:33,286 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:45:33,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:45:33,286 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:45:33,286 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:45:33,584 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:45:33,609 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:45:33,613 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:45:33,615 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:45:33,615 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:45:33,616 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_power.opt.i [2019-12-18 16:45:33,691 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05fdbed56/4f62cb88d3bb44b49ba83c93d9525b39/FLAG39ff8233d [2019-12-18 16:45:34,256 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:45:34,257 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_power.opt.i [2019-12-18 16:45:34,280 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05fdbed56/4f62cb88d3bb44b49ba83c93d9525b39/FLAG39ff8233d [2019-12-18 16:45:34,516 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05fdbed56/4f62cb88d3bb44b49ba83c93d9525b39 [2019-12-18 16:45:34,527 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:45:34,530 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:45:34,533 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:45:34,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:45:34,537 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:45:34,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:45:34" (1/1) ... [2019-12-18 16:45:34,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56d482f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:45:34, skipping insertion in model container [2019-12-18 16:45:34,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:45:34" (1/1) ... [2019-12-18 16:45:34,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:45:34,625 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:45:35,214 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:45:35,227 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:45:35,290 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:45:35,368 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:45:35,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:45:35 WrapperNode [2019-12-18 16:45:35,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:45:35,369 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:45:35,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:45:35,369 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:45:35,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:45:35" (1/1) ... [2019-12-18 16:45:35,397 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:45:35" (1/1) ... [2019-12-18 16:45:35,434 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:45:35,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:45:35,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:45:35,434 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:45:35,443 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:45:35" (1/1) ... [2019-12-18 16:45:35,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:45:35" (1/1) ... [2019-12-18 16:45:35,448 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:45:35" (1/1) ... [2019-12-18 16:45:35,449 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:45:35" (1/1) ... [2019-12-18 16:45:35,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:45:35" (1/1) ... [2019-12-18 16:45:35,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:45:35" (1/1) ... [2019-12-18 16:45:35,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:45:35" (1/1) ... [2019-12-18 16:45:35,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:45:35,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:45:35,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:45:35,489 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:45:35,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:45:35" (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 16:45:35,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:45:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:45:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:45:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:45:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:45:35,541 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:45:35,542 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:45:35,542 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:45:35,542 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 16:45:35,542 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 16:45:35,542 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 16:45:35,543 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 16:45:35,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:45:35,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:45:35,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:45:35,549 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 16:45:36,328 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:45:36,329 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:45:36,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:45:36 BoogieIcfgContainer [2019-12-18 16:45:36,331 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:45:36,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:45:36,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:45:36,340 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:45:36,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:45:34" (1/3) ... [2019-12-18 16:45:36,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a611c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:45:36, skipping insertion in model container [2019-12-18 16:45:36,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:45:35" (2/3) ... [2019-12-18 16:45:36,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a611c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:45:36, skipping insertion in model container [2019-12-18 16:45:36,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:45:36" (3/3) ... [2019-12-18 16:45:36,346 INFO L109 eAbstractionObserver]: Analyzing ICFG mix023_power.opt.i [2019-12-18 16:45:36,357 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:45:36,358 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:45:36,369 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:45:36,371 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:45:36,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,417 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,417 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,420 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,420 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,445 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,445 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,446 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,446 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,446 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,470 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,470 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,470 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,470 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,471 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,471 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,471 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,471 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,471 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,472 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,472 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,472 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,472 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,472 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,473 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,473 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,473 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,473 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,474 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,474 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,474 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,474 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,474 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,475 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,475 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,475 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,475 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,476 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,476 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,476 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,479 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,480 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,480 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,480 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,480 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,481 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,481 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,481 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,481 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,481 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,484 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,484 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,489 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,492 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,496 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,496 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,497 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:36,513 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 16:45:36,532 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:45:36,532 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:45:36,532 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:45:36,532 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:45:36,532 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:45:36,533 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:45:36,533 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:45:36,533 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:45:36,548 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-18 16:45:36,550 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 16:45:36,641 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 16:45:36,641 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:45:36,662 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 442 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 16:45:36,693 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 16:45:36,762 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 16:45:36,762 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:45:36,774 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 442 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 16:45:36,802 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-18 16:45:36,803 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:45:42,433 WARN L192 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 16:45:42,581 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 16:45:42,703 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66461 [2019-12-18 16:45:42,704 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-18 16:45:42,708 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 95 transitions [2019-12-18 16:46:16,498 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 160898 states. [2019-12-18 16:46:16,500 INFO L276 IsEmpty]: Start isEmpty. Operand 160898 states. [2019-12-18 16:46:16,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 16:46:16,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:46:16,511 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:46:16,512 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:46:16,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:46:16,518 INFO L82 PathProgramCache]: Analyzing trace with hash 406431864, now seen corresponding path program 1 times [2019-12-18 16:46:16,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:46:16,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497742325] [2019-12-18 16:46:16,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:46:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:46:16,789 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 16:46:16,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497742325] [2019-12-18 16:46:16,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:46:16,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:46:16,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569546279] [2019-12-18 16:46:16,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:46:16,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:46:16,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:46:16,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:46:16,818 INFO L87 Difference]: Start difference. First operand 160898 states. Second operand 3 states. [2019-12-18 16:46:20,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:46:20,981 INFO L93 Difference]: Finished difference Result 158998 states and 767616 transitions. [2019-12-18 16:46:20,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:46:20,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 16:46:20,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:46:21,967 INFO L225 Difference]: With dead ends: 158998 [2019-12-18 16:46:21,967 INFO L226 Difference]: Without dead ends: 149254 [2019-12-18 16:46:21,971 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 16:46:30,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149254 states. [2019-12-18 16:46:33,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149254 to 149254. [2019-12-18 16:46:33,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149254 states. [2019-12-18 16:46:39,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149254 states to 149254 states and 719596 transitions. [2019-12-18 16:46:39,262 INFO L78 Accepts]: Start accepts. Automaton has 149254 states and 719596 transitions. Word has length 7 [2019-12-18 16:46:39,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:46:39,263 INFO L462 AbstractCegarLoop]: Abstraction has 149254 states and 719596 transitions. [2019-12-18 16:46:39,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:46:39,263 INFO L276 IsEmpty]: Start isEmpty. Operand 149254 states and 719596 transitions. [2019-12-18 16:46:39,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 16:46:39,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:46:39,275 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:46:39,275 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:46:39,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:46:39,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1843730986, now seen corresponding path program 1 times [2019-12-18 16:46:39,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:46:39,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193263573] [2019-12-18 16:46:39,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:46:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:46:39,355 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 16:46:39,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193263573] [2019-12-18 16:46:39,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:46:39,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:46:39,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684537409] [2019-12-18 16:46:39,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:46:39,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:46:39,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:46:39,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:46:39,359 INFO L87 Difference]: Start difference. First operand 149254 states and 719596 transitions. Second operand 3 states. [2019-12-18 16:46:39,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:46:39,935 INFO L93 Difference]: Finished difference Result 94546 states and 411602 transitions. [2019-12-18 16:46:39,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:46:39,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 16:46:39,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:46:40,298 INFO L225 Difference]: With dead ends: 94546 [2019-12-18 16:46:40,298 INFO L226 Difference]: Without dead ends: 94546 [2019-12-18 16:46:40,299 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 16:46:44,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94546 states. [2019-12-18 16:46:50,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94546 to 94546. [2019-12-18 16:46:50,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94546 states. [2019-12-18 16:46:51,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94546 states to 94546 states and 411602 transitions. [2019-12-18 16:46:51,277 INFO L78 Accepts]: Start accepts. Automaton has 94546 states and 411602 transitions. Word has length 15 [2019-12-18 16:46:51,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:46:51,277 INFO L462 AbstractCegarLoop]: Abstraction has 94546 states and 411602 transitions. [2019-12-18 16:46:51,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:46:51,277 INFO L276 IsEmpty]: Start isEmpty. Operand 94546 states and 411602 transitions. [2019-12-18 16:46:51,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 16:46:51,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:46:51,280 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:46:51,281 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:46:51,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:46:51,281 INFO L82 PathProgramCache]: Analyzing trace with hash -425966823, now seen corresponding path program 1 times [2019-12-18 16:46:51,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:46:51,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997701231] [2019-12-18 16:46:51,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:46:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:46:51,370 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 16:46:51,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997701231] [2019-12-18 16:46:51,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:46:51,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:46:51,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075355035] [2019-12-18 16:46:51,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:46:51,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:46:51,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:46:51,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:46:51,372 INFO L87 Difference]: Start difference. First operand 94546 states and 411602 transitions. Second operand 4 states. [2019-12-18 16:46:52,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:46:52,366 INFO L93 Difference]: Finished difference Result 144639 states and 604914 transitions. [2019-12-18 16:46:52,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:46:52,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 16:46:52,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:46:52,972 INFO L225 Difference]: With dead ends: 144639 [2019-12-18 16:46:52,972 INFO L226 Difference]: Without dead ends: 144527 [2019-12-18 16:46:52,973 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 16:46:56,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144527 states. [2019-12-18 16:47:06,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144527 to 133390. [2019-12-18 16:47:06,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133390 states. [2019-12-18 16:47:06,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133390 states to 133390 states and 563187 transitions. [2019-12-18 16:47:06,959 INFO L78 Accepts]: Start accepts. Automaton has 133390 states and 563187 transitions. Word has length 15 [2019-12-18 16:47:06,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:47:06,959 INFO L462 AbstractCegarLoop]: Abstraction has 133390 states and 563187 transitions. [2019-12-18 16:47:06,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:47:06,960 INFO L276 IsEmpty]: Start isEmpty. Operand 133390 states and 563187 transitions. [2019-12-18 16:47:06,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:47:06,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:47:06,963 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:47:06,964 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:47:06,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:47:06,964 INFO L82 PathProgramCache]: Analyzing trace with hash -35287386, now seen corresponding path program 1 times [2019-12-18 16:47:06,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:47:06,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237285962] [2019-12-18 16:47:06,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:47:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:47:07,032 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 16:47:07,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237285962] [2019-12-18 16:47:07,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:47:07,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:47:07,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16594288] [2019-12-18 16:47:07,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:47:07,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:47:07,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:47:07,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:47:07,035 INFO L87 Difference]: Start difference. First operand 133390 states and 563187 transitions. Second operand 4 states. [2019-12-18 16:47:08,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:47:08,011 INFO L93 Difference]: Finished difference Result 37161 states and 133398 transitions. [2019-12-18 16:47:08,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:47:08,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 16:47:08,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:47:08,114 INFO L225 Difference]: With dead ends: 37161 [2019-12-18 16:47:08,115 INFO L226 Difference]: Without dead ends: 37161 [2019-12-18 16:47:08,115 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 16:47:08,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37161 states. [2019-12-18 16:47:08,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37161 to 37161. [2019-12-18 16:47:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37161 states. [2019-12-18 16:47:08,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37161 states to 37161 states and 133398 transitions. [2019-12-18 16:47:08,889 INFO L78 Accepts]: Start accepts. Automaton has 37161 states and 133398 transitions. Word has length 16 [2019-12-18 16:47:08,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:47:08,889 INFO L462 AbstractCegarLoop]: Abstraction has 37161 states and 133398 transitions. [2019-12-18 16:47:08,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:47:08,889 INFO L276 IsEmpty]: Start isEmpty. Operand 37161 states and 133398 transitions. [2019-12-18 16:47:08,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:47:08,893 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:47:08,893 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:47:08,893 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:47:08,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:47:08,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1700714978, now seen corresponding path program 1 times [2019-12-18 16:47:08,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:47:08,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537458117] [2019-12-18 16:47:08,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:47:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:47:08,992 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 16:47:08,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537458117] [2019-12-18 16:47:08,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:47:08,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:47:08,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62804092] [2019-12-18 16:47:08,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:47:08,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:47:08,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:47:08,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:47:08,995 INFO L87 Difference]: Start difference. First operand 37161 states and 133398 transitions. Second operand 5 states. [2019-12-18 16:47:09,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:47:09,559 INFO L93 Difference]: Finished difference Result 54896 states and 192989 transitions. [2019-12-18 16:47:09,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:47:09,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 16:47:09,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:47:09,670 INFO L225 Difference]: With dead ends: 54896 [2019-12-18 16:47:09,670 INFO L226 Difference]: Without dead ends: 54878 [2019-12-18 16:47:09,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:47:12,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54878 states. [2019-12-18 16:47:13,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54878 to 43369. [2019-12-18 16:47:13,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43369 states. [2019-12-18 16:47:13,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43369 states to 43369 states and 154803 transitions. [2019-12-18 16:47:13,168 INFO L78 Accepts]: Start accepts. Automaton has 43369 states and 154803 transitions. Word has length 16 [2019-12-18 16:47:13,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:47:13,169 INFO L462 AbstractCegarLoop]: Abstraction has 43369 states and 154803 transitions. [2019-12-18 16:47:13,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:47:13,169 INFO L276 IsEmpty]: Start isEmpty. Operand 43369 states and 154803 transitions. [2019-12-18 16:47:13,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 16:47:13,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:47:13,186 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] [2019-12-18 16:47:13,187 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:47:13,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:47:13,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1135187325, now seen corresponding path program 1 times [2019-12-18 16:47:13,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:47:13,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708563696] [2019-12-18 16:47:13,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:47:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:47:13,321 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 16:47:13,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708563696] [2019-12-18 16:47:13,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:47:13,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:47:13,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431602406] [2019-12-18 16:47:13,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:47:13,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:47:13,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:47:13,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:47:13,323 INFO L87 Difference]: Start difference. First operand 43369 states and 154803 transitions. Second operand 6 states. [2019-12-18 16:47:14,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:47:14,401 INFO L93 Difference]: Finished difference Result 65283 states and 226759 transitions. [2019-12-18 16:47:14,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:47:14,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 16:47:14,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:47:14,534 INFO L225 Difference]: With dead ends: 65283 [2019-12-18 16:47:14,534 INFO L226 Difference]: Without dead ends: 65253 [2019-12-18 16:47:14,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 16:47:15,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65253 states. [2019-12-18 16:47:15,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65253 to 43597. [2019-12-18 16:47:15,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43597 states. [2019-12-18 16:47:15,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43597 states to 43597 states and 154758 transitions. [2019-12-18 16:47:15,869 INFO L78 Accepts]: Start accepts. Automaton has 43597 states and 154758 transitions. Word has length 24 [2019-12-18 16:47:15,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:47:15,869 INFO L462 AbstractCegarLoop]: Abstraction has 43597 states and 154758 transitions. [2019-12-18 16:47:15,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:47:15,870 INFO L276 IsEmpty]: Start isEmpty. Operand 43597 states and 154758 transitions. [2019-12-18 16:47:15,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 16:47:15,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:47:15,892 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] [2019-12-18 16:47:15,892 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:47:15,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:47:15,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1458605799, now seen corresponding path program 1 times [2019-12-18 16:47:15,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:47:15,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118888525] [2019-12-18 16:47:15,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:47:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:47:15,977 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 16:47:15,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118888525] [2019-12-18 16:47:15,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:47:15,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:47:15,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386374326] [2019-12-18 16:47:15,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:47:15,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:47:15,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:47:15,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:47:15,980 INFO L87 Difference]: Start difference. First operand 43597 states and 154758 transitions. Second operand 5 states. [2019-12-18 16:47:16,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:47:16,114 INFO L93 Difference]: Finished difference Result 23301 states and 83755 transitions. [2019-12-18 16:47:16,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:47:16,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 16:47:16,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:47:16,156 INFO L225 Difference]: With dead ends: 23301 [2019-12-18 16:47:16,157 INFO L226 Difference]: Without dead ends: 23301 [2019-12-18 16:47:16,157 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 16:47:16,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23301 states. [2019-12-18 16:47:17,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23301 to 22997. [2019-12-18 16:47:17,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22997 states. [2019-12-18 16:47:17,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22997 states to 22997 states and 82723 transitions. [2019-12-18 16:47:17,063 INFO L78 Accepts]: Start accepts. Automaton has 22997 states and 82723 transitions. Word has length 28 [2019-12-18 16:47:17,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:47:17,063 INFO L462 AbstractCegarLoop]: Abstraction has 22997 states and 82723 transitions. [2019-12-18 16:47:17,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:47:17,063 INFO L276 IsEmpty]: Start isEmpty. Operand 22997 states and 82723 transitions. [2019-12-18 16:47:17,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 16:47:17,104 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:47:17,104 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:47:17,104 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:47:17,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:47:17,105 INFO L82 PathProgramCache]: Analyzing trace with hash 289915716, now seen corresponding path program 1 times [2019-12-18 16:47:17,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:47:17,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79953269] [2019-12-18 16:47:17,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:47:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:47:17,180 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 16:47:17,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79953269] [2019-12-18 16:47:17,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:47:17,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:47:17,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055053679] [2019-12-18 16:47:17,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:47:17,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:47:17,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:47:17,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:47:17,183 INFO L87 Difference]: Start difference. First operand 22997 states and 82723 transitions. Second operand 3 states. [2019-12-18 16:47:17,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:47:17,358 INFO L93 Difference]: Finished difference Result 34696 states and 119073 transitions. [2019-12-18 16:47:17,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:47:17,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-18 16:47:17,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:47:17,399 INFO L225 Difference]: With dead ends: 34696 [2019-12-18 16:47:17,399 INFO L226 Difference]: Without dead ends: 23444 [2019-12-18 16:47:17,400 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 16:47:17,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23444 states. [2019-12-18 16:47:17,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23444 to 23042. [2019-12-18 16:47:17,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23042 states. [2019-12-18 16:47:17,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23042 states to 23042 states and 72359 transitions. [2019-12-18 16:47:17,768 INFO L78 Accepts]: Start accepts. Automaton has 23042 states and 72359 transitions. Word has length 42 [2019-12-18 16:47:17,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:47:17,768 INFO L462 AbstractCegarLoop]: Abstraction has 23042 states and 72359 transitions. [2019-12-18 16:47:17,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:47:17,768 INFO L276 IsEmpty]: Start isEmpty. Operand 23042 states and 72359 transitions. [2019-12-18 16:47:17,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 16:47:17,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:47:17,805 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] [2019-12-18 16:47:17,805 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:47:17,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:47:17,806 INFO L82 PathProgramCache]: Analyzing trace with hash 9371836, now seen corresponding path program 1 times [2019-12-18 16:47:17,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:47:17,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804377144] [2019-12-18 16:47:17,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:47:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:47:17,892 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 16:47:17,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804377144] [2019-12-18 16:47:17,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:47:17,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:47:17,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650576071] [2019-12-18 16:47:17,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:47:17,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:47:17,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:47:17,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:47:17,895 INFO L87 Difference]: Start difference. First operand 23042 states and 72359 transitions. Second operand 6 states. [2019-12-18 16:47:18,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:47:18,062 INFO L93 Difference]: Finished difference Result 21758 states and 69087 transitions. [2019-12-18 16:47:18,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:47:18,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-18 16:47:18,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:47:18,090 INFO L225 Difference]: With dead ends: 21758 [2019-12-18 16:47:18,090 INFO L226 Difference]: Without dead ends: 11194 [2019-12-18 16:47:18,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:47:18,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11194 states. [2019-12-18 16:47:18,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11194 to 10798. [2019-12-18 16:47:18,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10798 states. [2019-12-18 16:47:18,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10798 states to 10798 states and 34133 transitions. [2019-12-18 16:47:18,358 INFO L78 Accepts]: Start accepts. Automaton has 10798 states and 34133 transitions. Word has length 43 [2019-12-18 16:47:18,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:47:18,358 INFO L462 AbstractCegarLoop]: Abstraction has 10798 states and 34133 transitions. [2019-12-18 16:47:18,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:47:18,359 INFO L276 IsEmpty]: Start isEmpty. Operand 10798 states and 34133 transitions. [2019-12-18 16:47:18,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 16:47:18,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:47:18,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] [2019-12-18 16:47:18,378 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:47:18,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:47:18,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1454862528, now seen corresponding path program 1 times [2019-12-18 16:47:18,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:47:18,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236088069] [2019-12-18 16:47:18,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:47:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:47:18,472 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 16:47:18,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236088069] [2019-12-18 16:47:18,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:47:18,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:47:18,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266949956] [2019-12-18 16:47:18,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:47:18,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:47:18,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:47:18,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:47:18,476 INFO L87 Difference]: Start difference. First operand 10798 states and 34133 transitions. Second operand 3 states. [2019-12-18 16:47:18,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:47:18,572 INFO L93 Difference]: Finished difference Result 14554 states and 45133 transitions. [2019-12-18 16:47:18,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:47:18,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 16:47:18,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:47:18,600 INFO L225 Difference]: With dead ends: 14554 [2019-12-18 16:47:18,601 INFO L226 Difference]: Without dead ends: 14554 [2019-12-18 16:47:18,601 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 16:47:18,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14554 states. [2019-12-18 16:47:18,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14554 to 11851. [2019-12-18 16:47:18,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11851 states. [2019-12-18 16:47:19,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11851 states to 11851 states and 37349 transitions. [2019-12-18 16:47:19,121 INFO L78 Accepts]: Start accepts. Automaton has 11851 states and 37349 transitions. Word has length 57 [2019-12-18 16:47:19,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:47:19,121 INFO L462 AbstractCegarLoop]: Abstraction has 11851 states and 37349 transitions. [2019-12-18 16:47:19,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:47:19,121 INFO L276 IsEmpty]: Start isEmpty. Operand 11851 states and 37349 transitions. [2019-12-18 16:47:19,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 16:47:19,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:47:19,134 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] [2019-12-18 16:47:19,134 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:47:19,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:47:19,135 INFO L82 PathProgramCache]: Analyzing trace with hash -880753033, now seen corresponding path program 1 times [2019-12-18 16:47:19,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:47:19,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168016617] [2019-12-18 16:47:19,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:47:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:47:19,206 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 16:47:19,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168016617] [2019-12-18 16:47:19,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:47:19,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:47:19,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339101260] [2019-12-18 16:47:19,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:47:19,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:47:19,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:47:19,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:47:19,209 INFO L87 Difference]: Start difference. First operand 11851 states and 37349 transitions. Second operand 4 states. [2019-12-18 16:47:19,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:47:19,310 INFO L93 Difference]: Finished difference Result 21477 states and 67702 transitions. [2019-12-18 16:47:19,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:47:19,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-18 16:47:19,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:47:19,334 INFO L225 Difference]: With dead ends: 21477 [2019-12-18 16:47:19,334 INFO L226 Difference]: Without dead ends: 9937 [2019-12-18 16:47:19,335 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 16:47:19,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9937 states. [2019-12-18 16:47:19,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9937 to 9937. [2019-12-18 16:47:19,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9937 states. [2019-12-18 16:47:19,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9937 states to 9937 states and 31212 transitions. [2019-12-18 16:47:19,571 INFO L78 Accepts]: Start accepts. Automaton has 9937 states and 31212 transitions. Word has length 57 [2019-12-18 16:47:19,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:47:19,572 INFO L462 AbstractCegarLoop]: Abstraction has 9937 states and 31212 transitions. [2019-12-18 16:47:19,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:47:19,572 INFO L276 IsEmpty]: Start isEmpty. Operand 9937 states and 31212 transitions. [2019-12-18 16:47:19,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 16:47:19,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:47:19,585 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] [2019-12-18 16:47:19,585 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:47:19,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:47:19,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1310347391, now seen corresponding path program 2 times [2019-12-18 16:47:19,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:47:19,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995207015] [2019-12-18 16:47:19,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:47:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:47:19,674 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 16:47:19,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995207015] [2019-12-18 16:47:19,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:47:19,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:47:19,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648128780] [2019-12-18 16:47:19,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:47:19,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:47:19,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:47:19,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:47:19,676 INFO L87 Difference]: Start difference. First operand 9937 states and 31212 transitions. Second operand 7 states. [2019-12-18 16:47:20,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:47:20,060 INFO L93 Difference]: Finished difference Result 26843 states and 84141 transitions. [2019-12-18 16:47:20,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:47:20,060 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 16:47:20,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:47:20,092 INFO L225 Difference]: With dead ends: 26843 [2019-12-18 16:47:20,093 INFO L226 Difference]: Without dead ends: 20587 [2019-12-18 16:47:20,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 16:47:20,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20587 states. [2019-12-18 16:47:20,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20587 to 12177. [2019-12-18 16:47:20,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12177 states. [2019-12-18 16:47:20,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 38516 transitions. [2019-12-18 16:47:20,346 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 38516 transitions. Word has length 57 [2019-12-18 16:47:20,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:47:20,346 INFO L462 AbstractCegarLoop]: Abstraction has 12177 states and 38516 transitions. [2019-12-18 16:47:20,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:47:20,346 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 38516 transitions. [2019-12-18 16:47:20,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 16:47:20,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:47:20,367 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] [2019-12-18 16:47:20,367 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:47:20,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:47:20,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1030628791, now seen corresponding path program 3 times [2019-12-18 16:47:20,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:47:20,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561485658] [2019-12-18 16:47:20,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:47:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:47:20,462 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 16:47:20,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561485658] [2019-12-18 16:47:20,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:47:20,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:47:20,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693490179] [2019-12-18 16:47:20,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:47:20,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:47:20,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:47:20,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:47:20,465 INFO L87 Difference]: Start difference. First operand 12177 states and 38516 transitions. Second operand 7 states. [2019-12-18 16:47:20,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:47:20,862 INFO L93 Difference]: Finished difference Result 33666 states and 104259 transitions. [2019-12-18 16:47:20,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:47:20,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 16:47:20,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:47:20,897 INFO L225 Difference]: With dead ends: 33666 [2019-12-18 16:47:20,897 INFO L226 Difference]: Without dead ends: 24086 [2019-12-18 16:47:20,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 16:47:20,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24086 states. [2019-12-18 16:47:21,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24086 to 15349. [2019-12-18 16:47:21,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15349 states. [2019-12-18 16:47:21,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15349 states to 15349 states and 48528 transitions. [2019-12-18 16:47:21,212 INFO L78 Accepts]: Start accepts. Automaton has 15349 states and 48528 transitions. Word has length 57 [2019-12-18 16:47:21,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:47:21,213 INFO L462 AbstractCegarLoop]: Abstraction has 15349 states and 48528 transitions. [2019-12-18 16:47:21,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:47:21,213 INFO L276 IsEmpty]: Start isEmpty. Operand 15349 states and 48528 transitions. [2019-12-18 16:47:21,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 16:47:21,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:47:21,235 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] [2019-12-18 16:47:21,236 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:47:21,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:47:21,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1587000503, now seen corresponding path program 4 times [2019-12-18 16:47:21,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:47:21,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544734451] [2019-12-18 16:47:21,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:47:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:47:21,372 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 16:47:21,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544734451] [2019-12-18 16:47:21,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:47:21,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:47:21,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504815401] [2019-12-18 16:47:21,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:47:21,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:47:21,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:47:21,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:47:21,374 INFO L87 Difference]: Start difference. First operand 15349 states and 48528 transitions. Second operand 8 states. [2019-12-18 16:47:22,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:47:22,693 INFO L93 Difference]: Finished difference Result 34932 states and 106981 transitions. [2019-12-18 16:47:22,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 16:47:22,694 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-18 16:47:22,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:47:22,740 INFO L225 Difference]: With dead ends: 34932 [2019-12-18 16:47:22,740 INFO L226 Difference]: Without dead ends: 32668 [2019-12-18 16:47:22,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-18 16:47:22,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32668 states. [2019-12-18 16:47:23,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32668 to 15407. [2019-12-18 16:47:23,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15407 states. [2019-12-18 16:47:23,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15407 states to 15407 states and 48800 transitions. [2019-12-18 16:47:23,122 INFO L78 Accepts]: Start accepts. Automaton has 15407 states and 48800 transitions. Word has length 57 [2019-12-18 16:47:23,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:47:23,122 INFO L462 AbstractCegarLoop]: Abstraction has 15407 states and 48800 transitions. [2019-12-18 16:47:23,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:47:23,122 INFO L276 IsEmpty]: Start isEmpty. Operand 15407 states and 48800 transitions. [2019-12-18 16:47:23,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 16:47:23,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:47:23,140 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] [2019-12-18 16:47:23,140 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:47:23,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:47:23,140 INFO L82 PathProgramCache]: Analyzing trace with hash -979581959, now seen corresponding path program 5 times [2019-12-18 16:47:23,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:47:23,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354967785] [2019-12-18 16:47:23,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:47:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:47:23,238 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 16:47:23,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354967785] [2019-12-18 16:47:23,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:47:23,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:47:23,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450098906] [2019-12-18 16:47:23,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:47:23,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:47:23,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:47:23,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:47:23,240 INFO L87 Difference]: Start difference. First operand 15407 states and 48800 transitions. Second operand 9 states. [2019-12-18 16:47:24,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:47:24,708 INFO L93 Difference]: Finished difference Result 48430 states and 148036 transitions. [2019-12-18 16:47:24,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 16:47:24,709 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 16:47:24,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:47:24,786 INFO L225 Difference]: With dead ends: 48430 [2019-12-18 16:47:24,786 INFO L226 Difference]: Without dead ends: 46166 [2019-12-18 16:47:24,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2019-12-18 16:47:24,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46166 states. [2019-12-18 16:47:25,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46166 to 15428. [2019-12-18 16:47:25,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15428 states. [2019-12-18 16:47:25,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15428 states to 15428 states and 48880 transitions. [2019-12-18 16:47:25,699 INFO L78 Accepts]: Start accepts. Automaton has 15428 states and 48880 transitions. Word has length 57 [2019-12-18 16:47:25,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:47:25,699 INFO L462 AbstractCegarLoop]: Abstraction has 15428 states and 48880 transitions. [2019-12-18 16:47:25,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:47:25,700 INFO L276 IsEmpty]: Start isEmpty. Operand 15428 states and 48880 transitions. [2019-12-18 16:47:25,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 16:47:25,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:47:25,717 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] [2019-12-18 16:47:25,717 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:47:25,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:47:25,717 INFO L82 PathProgramCache]: Analyzing trace with hash -2032569873, now seen corresponding path program 6 times [2019-12-18 16:47:25,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:47:25,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490437799] [2019-12-18 16:47:25,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:47:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:47:25,814 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 16:47:25,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490437799] [2019-12-18 16:47:25,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:47:25,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:47:25,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122580600] [2019-12-18 16:47:25,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:47:25,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:47:25,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:47:25,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:47:25,816 INFO L87 Difference]: Start difference. First operand 15428 states and 48880 transitions. Second operand 9 states. [2019-12-18 16:47:27,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:47:27,302 INFO L93 Difference]: Finished difference Result 62597 states and 191406 transitions. [2019-12-18 16:47:27,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 16:47:27,302 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 16:47:27,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:47:27,387 INFO L225 Difference]: With dead ends: 62597 [2019-12-18 16:47:27,387 INFO L226 Difference]: Without dead ends: 54167 [2019-12-18 16:47:27,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=347, Invalid=985, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 16:47:27,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54167 states. [2019-12-18 16:47:27,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54167 to 19382. [2019-12-18 16:47:27,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19382 states. [2019-12-18 16:47:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19382 states to 19382 states and 61433 transitions. [2019-12-18 16:47:27,995 INFO L78 Accepts]: Start accepts. Automaton has 19382 states and 61433 transitions. Word has length 57 [2019-12-18 16:47:27,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:47:27,996 INFO L462 AbstractCegarLoop]: Abstraction has 19382 states and 61433 transitions. [2019-12-18 16:47:27,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:47:27,996 INFO L276 IsEmpty]: Start isEmpty. Operand 19382 states and 61433 transitions. [2019-12-18 16:47:28,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 16:47:28,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:47:28,016 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] [2019-12-18 16:47:28,016 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:47:28,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:47:28,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1355321517, now seen corresponding path program 7 times [2019-12-18 16:47:28,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:47:28,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983584498] [2019-12-18 16:47:28,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:47:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:47:28,108 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 16:47:28,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983584498] [2019-12-18 16:47:28,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:47:28,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:47:28,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512115360] [2019-12-18 16:47:28,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:47:28,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:47:28,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:47:28,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:47:28,111 INFO L87 Difference]: Start difference. First operand 19382 states and 61433 transitions. Second operand 3 states. [2019-12-18 16:47:28,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:47:28,187 INFO L93 Difference]: Finished difference Result 16496 states and 51087 transitions. [2019-12-18 16:47:28,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:47:28,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 16:47:28,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:47:28,209 INFO L225 Difference]: With dead ends: 16496 [2019-12-18 16:47:28,210 INFO L226 Difference]: Without dead ends: 16496 [2019-12-18 16:47:28,210 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 16:47:28,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16496 states. [2019-12-18 16:47:28,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16496 to 15921. [2019-12-18 16:47:28,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15921 states. [2019-12-18 16:47:28,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15921 states to 15921 states and 49194 transitions. [2019-12-18 16:47:28,449 INFO L78 Accepts]: Start accepts. Automaton has 15921 states and 49194 transitions. Word has length 57 [2019-12-18 16:47:28,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:47:28,449 INFO L462 AbstractCegarLoop]: Abstraction has 15921 states and 49194 transitions. [2019-12-18 16:47:28,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:47:28,449 INFO L276 IsEmpty]: Start isEmpty. Operand 15921 states and 49194 transitions. [2019-12-18 16:47:28,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 16:47:28,465 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:47:28,465 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] [2019-12-18 16:47:28,465 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:47:28,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:47:28,465 INFO L82 PathProgramCache]: Analyzing trace with hash -454137528, now seen corresponding path program 1 times [2019-12-18 16:47:28,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:47:28,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862631072] [2019-12-18 16:47:28,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:47:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:47:28,584 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 16:47:28,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862631072] [2019-12-18 16:47:28,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:47:28,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:47:28,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426271835] [2019-12-18 16:47:28,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:47:28,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:47:28,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:47:28,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:47:28,586 INFO L87 Difference]: Start difference. First operand 15921 states and 49194 transitions. Second operand 8 states. [2019-12-18 16:47:30,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:47:30,740 INFO L93 Difference]: Finished difference Result 28147 states and 84036 transitions. [2019-12-18 16:47:30,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 16:47:30,740 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-12-18 16:47:30,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:47:30,779 INFO L225 Difference]: With dead ends: 28147 [2019-12-18 16:47:30,779 INFO L226 Difference]: Without dead ends: 27925 [2019-12-18 16:47:30,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2019-12-18 16:47:30,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27925 states. [2019-12-18 16:47:31,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27925 to 19756. [2019-12-18 16:47:31,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19756 states. [2019-12-18 16:47:31,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19756 states to 19756 states and 60682 transitions. [2019-12-18 16:47:31,173 INFO L78 Accepts]: Start accepts. Automaton has 19756 states and 60682 transitions. Word has length 58 [2019-12-18 16:47:31,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:47:31,173 INFO L462 AbstractCegarLoop]: Abstraction has 19756 states and 60682 transitions. [2019-12-18 16:47:31,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:47:31,173 INFO L276 IsEmpty]: Start isEmpty. Operand 19756 states and 60682 transitions. [2019-12-18 16:47:31,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 16:47:31,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:47:31,196 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] [2019-12-18 16:47:31,197 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:47:31,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:47:31,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1124271006, now seen corresponding path program 2 times [2019-12-18 16:47:31,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:47:31,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682832178] [2019-12-18 16:47:31,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:47:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:47:31,370 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 16:47:31,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682832178] [2019-12-18 16:47:31,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:47:31,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:47:31,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715994911] [2019-12-18 16:47:31,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 16:47:31,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:47:31,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 16:47:31,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:47:31,373 INFO L87 Difference]: Start difference. First operand 19756 states and 60682 transitions. Second operand 10 states. [2019-12-18 16:47:33,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:47:33,180 INFO L93 Difference]: Finished difference Result 35790 states and 109621 transitions. [2019-12-18 16:47:33,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 16:47:33,181 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-18 16:47:33,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:47:33,225 INFO L225 Difference]: With dead ends: 35790 [2019-12-18 16:47:33,225 INFO L226 Difference]: Without dead ends: 27423 [2019-12-18 16:47:33,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2019-12-18 16:47:33,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27423 states. [2019-12-18 16:47:33,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27423 to 20479. [2019-12-18 16:47:33,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20479 states. [2019-12-18 16:47:34,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20479 states to 20479 states and 62669 transitions. [2019-12-18 16:47:34,012 INFO L78 Accepts]: Start accepts. Automaton has 20479 states and 62669 transitions. Word has length 58 [2019-12-18 16:47:34,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:47:34,012 INFO L462 AbstractCegarLoop]: Abstraction has 20479 states and 62669 transitions. [2019-12-18 16:47:34,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 16:47:34,012 INFO L276 IsEmpty]: Start isEmpty. Operand 20479 states and 62669 transitions. [2019-12-18 16:47:34,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 16:47:34,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:47:34,032 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] [2019-12-18 16:47:34,033 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:47:34,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:47:34,033 INFO L82 PathProgramCache]: Analyzing trace with hash 755166698, now seen corresponding path program 3 times [2019-12-18 16:47:34,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:47:34,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187887973] [2019-12-18 16:47:34,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:47:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:47:34,213 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 16:47:34,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187887973] [2019-12-18 16:47:34,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:47:34,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:47:34,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652062871] [2019-12-18 16:47:34,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:47:34,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:47:34,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:47:34,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:47:34,215 INFO L87 Difference]: Start difference. First operand 20479 states and 62669 transitions. Second operand 11 states. [2019-12-18 16:47:36,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:47:36,048 INFO L93 Difference]: Finished difference Result 32153 states and 97485 transitions. [2019-12-18 16:47:36,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 16:47:36,049 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-18 16:47:36,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:47:36,090 INFO L225 Difference]: With dead ends: 32153 [2019-12-18 16:47:36,090 INFO L226 Difference]: Without dead ends: 27735 [2019-12-18 16:47:36,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2019-12-18 16:47:36,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27735 states. [2019-12-18 16:47:36,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27735 to 20513. [2019-12-18 16:47:36,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20513 states. [2019-12-18 16:47:36,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20513 states to 20513 states and 62504 transitions. [2019-12-18 16:47:36,453 INFO L78 Accepts]: Start accepts. Automaton has 20513 states and 62504 transitions. Word has length 58 [2019-12-18 16:47:36,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:47:36,454 INFO L462 AbstractCegarLoop]: Abstraction has 20513 states and 62504 transitions. [2019-12-18 16:47:36,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:47:36,454 INFO L276 IsEmpty]: Start isEmpty. Operand 20513 states and 62504 transitions. [2019-12-18 16:47:36,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 16:47:36,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:47:36,474 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] [2019-12-18 16:47:36,474 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:47:36,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:47:36,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1780291492, now seen corresponding path program 4 times [2019-12-18 16:47:36,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:47:36,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876043654] [2019-12-18 16:47:36,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:47:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:47:36,635 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 16:47:36,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876043654] [2019-12-18 16:47:36,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:47:36,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:47:36,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245057081] [2019-12-18 16:47:36,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:47:36,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:47:36,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:47:36,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:47:36,638 INFO L87 Difference]: Start difference. First operand 20513 states and 62504 transitions. Second operand 11 states. [2019-12-18 16:47:38,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:47:38,405 INFO L93 Difference]: Finished difference Result 29123 states and 88177 transitions. [2019-12-18 16:47:38,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 16:47:38,406 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-18 16:47:38,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:47:38,447 INFO L225 Difference]: With dead ends: 29123 [2019-12-18 16:47:38,447 INFO L226 Difference]: Without dead ends: 27635 [2019-12-18 16:47:38,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-18 16:47:38,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27635 states. [2019-12-18 16:47:38,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27635 to 20613. [2019-12-18 16:47:38,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20613 states. [2019-12-18 16:47:39,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20613 states to 20613 states and 62730 transitions. [2019-12-18 16:47:39,233 INFO L78 Accepts]: Start accepts. Automaton has 20613 states and 62730 transitions. Word has length 58 [2019-12-18 16:47:39,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:47:39,233 INFO L462 AbstractCegarLoop]: Abstraction has 20613 states and 62730 transitions. [2019-12-18 16:47:39,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:47:39,233 INFO L276 IsEmpty]: Start isEmpty. Operand 20613 states and 62730 transitions. [2019-12-18 16:47:39,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 16:47:39,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:47:39,254 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] [2019-12-18 16:47:39,255 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:47:39,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:47:39,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1512869174, now seen corresponding path program 5 times [2019-12-18 16:47:39,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:47:39,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272952943] [2019-12-18 16:47:39,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:47:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:47:39,457 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 16:47:39,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272952943] [2019-12-18 16:47:39,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:47:39,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:47:39,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364599103] [2019-12-18 16:47:39,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:47:39,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:47:39,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:47:39,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:47:39,462 INFO L87 Difference]: Start difference. First operand 20613 states and 62730 transitions. Second operand 11 states. [2019-12-18 16:47:41,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:47:41,848 INFO L93 Difference]: Finished difference Result 35353 states and 105821 transitions. [2019-12-18 16:47:41,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 16:47:41,849 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-18 16:47:41,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:47:41,893 INFO L225 Difference]: With dead ends: 35353 [2019-12-18 16:47:41,894 INFO L226 Difference]: Without dead ends: 29837 [2019-12-18 16:47:41,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2019-12-18 16:47:41,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29837 states. [2019-12-18 16:47:42,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29837 to 20901. [2019-12-18 16:47:42,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20901 states. [2019-12-18 16:47:42,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20901 states to 20901 states and 63326 transitions. [2019-12-18 16:47:42,289 INFO L78 Accepts]: Start accepts. Automaton has 20901 states and 63326 transitions. Word has length 58 [2019-12-18 16:47:42,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:47:42,289 INFO L462 AbstractCegarLoop]: Abstraction has 20901 states and 63326 transitions. [2019-12-18 16:47:42,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:47:42,289 INFO L276 IsEmpty]: Start isEmpty. Operand 20901 states and 63326 transitions. [2019-12-18 16:47:42,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 16:47:42,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:47:42,313 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] [2019-12-18 16:47:42,314 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:47:42,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:47:42,314 INFO L82 PathProgramCache]: Analyzing trace with hash 797101106, now seen corresponding path program 6 times [2019-12-18 16:47:42,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:47:42,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133419491] [2019-12-18 16:47:42,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:47:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:47:42,455 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 16:47:42,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133419491] [2019-12-18 16:47:42,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:47:42,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:47:42,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664547849] [2019-12-18 16:47:42,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:47:42,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:47:42,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:47:42,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:47:42,458 INFO L87 Difference]: Start difference. First operand 20901 states and 63326 transitions. Second operand 11 states. [2019-12-18 16:47:43,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:47:43,871 INFO L93 Difference]: Finished difference Result 28487 states and 85982 transitions. [2019-12-18 16:47:43,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 16:47:43,873 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-18 16:47:43,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:47:43,914 INFO L225 Difference]: With dead ends: 28487 [2019-12-18 16:47:43,914 INFO L226 Difference]: Without dead ends: 27866 [2019-12-18 16:47:43,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2019-12-18 16:47:43,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27866 states. [2019-12-18 16:47:44,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27866 to 20865. [2019-12-18 16:47:44,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20865 states. [2019-12-18 16:47:44,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20865 states to 20865 states and 63238 transitions. [2019-12-18 16:47:44,652 INFO L78 Accepts]: Start accepts. Automaton has 20865 states and 63238 transitions. Word has length 58 [2019-12-18 16:47:44,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:47:44,652 INFO L462 AbstractCegarLoop]: Abstraction has 20865 states and 63238 transitions. [2019-12-18 16:47:44,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:47:44,653 INFO L276 IsEmpty]: Start isEmpty. Operand 20865 states and 63238 transitions. [2019-12-18 16:47:44,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 16:47:44,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:47:44,680 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] [2019-12-18 16:47:44,680 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:47:44,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:47:44,681 INFO L82 PathProgramCache]: Analyzing trace with hash -199714182, now seen corresponding path program 7 times [2019-12-18 16:47:44,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:47:44,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599608871] [2019-12-18 16:47:44,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:47:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:47:44,835 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 16:47:44,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599608871] [2019-12-18 16:47:44,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:47:44,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:47:44,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542006632] [2019-12-18 16:47:44,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 16:47:44,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:47:44,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 16:47:44,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:47:44,838 INFO L87 Difference]: Start difference. First operand 20865 states and 63238 transitions. Second operand 12 states. [2019-12-18 16:47:46,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:47:46,786 INFO L93 Difference]: Finished difference Result 30585 states and 91967 transitions. [2019-12-18 16:47:46,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 16:47:46,786 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2019-12-18 16:47:46,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:47:46,829 INFO L225 Difference]: With dead ends: 30585 [2019-12-18 16:47:46,830 INFO L226 Difference]: Without dead ends: 29521 [2019-12-18 16:47:46,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2019-12-18 16:47:46,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29521 states. [2019-12-18 16:47:47,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29521 to 20677. [2019-12-18 16:47:47,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20677 states. [2019-12-18 16:47:47,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20677 states to 20677 states and 62762 transitions. [2019-12-18 16:47:47,221 INFO L78 Accepts]: Start accepts. Automaton has 20677 states and 62762 transitions. Word has length 58 [2019-12-18 16:47:47,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:47:47,221 INFO L462 AbstractCegarLoop]: Abstraction has 20677 states and 62762 transitions. [2019-12-18 16:47:47,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 16:47:47,221 INFO L276 IsEmpty]: Start isEmpty. Operand 20677 states and 62762 transitions. [2019-12-18 16:47:47,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 16:47:47,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:47:47,244 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] [2019-12-18 16:47:47,244 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:47:47,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:47:47,245 INFO L82 PathProgramCache]: Analyzing trace with hash -2078538356, now seen corresponding path program 8 times [2019-12-18 16:47:47,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:47:47,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402874184] [2019-12-18 16:47:47,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:47:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:47:47,306 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 16:47:47,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402874184] [2019-12-18 16:47:47,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:47:47,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:47:47,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106367009] [2019-12-18 16:47:47,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:47:47,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:47:47,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:47:47,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:47:47,308 INFO L87 Difference]: Start difference. First operand 20677 states and 62762 transitions. Second operand 3 states. [2019-12-18 16:47:47,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:47:47,388 INFO L93 Difference]: Finished difference Result 20677 states and 62760 transitions. [2019-12-18 16:47:47,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:47:47,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 16:47:47,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:47:47,417 INFO L225 Difference]: With dead ends: 20677 [2019-12-18 16:47:47,417 INFO L226 Difference]: Without dead ends: 20677 [2019-12-18 16:47:47,417 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 16:47:47,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20677 states. [2019-12-18 16:47:47,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20677 to 17662. [2019-12-18 16:47:47,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17662 states. [2019-12-18 16:47:47,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17662 states to 17662 states and 54496 transitions. [2019-12-18 16:47:47,712 INFO L78 Accepts]: Start accepts. Automaton has 17662 states and 54496 transitions. Word has length 58 [2019-12-18 16:47:47,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:47:47,712 INFO L462 AbstractCegarLoop]: Abstraction has 17662 states and 54496 transitions. [2019-12-18 16:47:47,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:47:47,712 INFO L276 IsEmpty]: Start isEmpty. Operand 17662 states and 54496 transitions. [2019-12-18 16:47:47,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 16:47:47,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:47:47,731 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] [2019-12-18 16:47:47,732 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:47:47,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:47:47,732 INFO L82 PathProgramCache]: Analyzing trace with hash 235346217, now seen corresponding path program 1 times [2019-12-18 16:47:47,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:47:47,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516149565] [2019-12-18 16:47:47,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:47:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:47:48,021 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 16:47:48,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516149565] [2019-12-18 16:47:48,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:47:48,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:47:48,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684184864] [2019-12-18 16:47:48,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 16:47:48,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:47:48,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 16:47:48,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:47:48,023 INFO L87 Difference]: Start difference. First operand 17662 states and 54496 transitions. Second operand 12 states. [2019-12-18 16:47:49,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:47:49,635 INFO L93 Difference]: Finished difference Result 32184 states and 99259 transitions. [2019-12-18 16:47:49,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 16:47:49,636 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-18 16:47:49,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:47:49,680 INFO L225 Difference]: With dead ends: 32184 [2019-12-18 16:47:49,680 INFO L226 Difference]: Without dead ends: 31618 [2019-12-18 16:47:49,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=859, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 16:47:49,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31618 states. [2019-12-18 16:47:50,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31618 to 20496. [2019-12-18 16:47:50,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20496 states. [2019-12-18 16:47:50,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20496 states to 20496 states and 63318 transitions. [2019-12-18 16:47:50,089 INFO L78 Accepts]: Start accepts. Automaton has 20496 states and 63318 transitions. Word has length 59 [2019-12-18 16:47:50,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:47:50,089 INFO L462 AbstractCegarLoop]: Abstraction has 20496 states and 63318 transitions. [2019-12-18 16:47:50,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 16:47:50,089 INFO L276 IsEmpty]: Start isEmpty. Operand 20496 states and 63318 transitions. [2019-12-18 16:47:50,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 16:47:50,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:47:50,113 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:47:50,113 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:47:50,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:47:50,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1674144661, now seen corresponding path program 2 times [2019-12-18 16:47:50,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:47:50,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729683342] [2019-12-18 16:47:50,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:47:50,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:47:50,778 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 16:47:50,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729683342] [2019-12-18 16:47:50,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:47:50,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 16:47:50,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228607690] [2019-12-18 16:47:50,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 16:47:50,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:47:50,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 16:47:50,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-18 16:47:50,779 INFO L87 Difference]: Start difference. First operand 20496 states and 63318 transitions. Second operand 16 states. [2019-12-18 16:47:55,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:47:55,634 INFO L93 Difference]: Finished difference Result 37966 states and 115034 transitions. [2019-12-18 16:47:55,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-18 16:47:55,634 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2019-12-18 16:47:55,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:47:55,683 INFO L225 Difference]: With dead ends: 37966 [2019-12-18 16:47:55,683 INFO L226 Difference]: Without dead ends: 32901 [2019-12-18 16:47:55,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 827 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=579, Invalid=2501, Unknown=0, NotChecked=0, Total=3080 [2019-12-18 16:47:55,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32901 states. [2019-12-18 16:47:56,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32901 to 19728. [2019-12-18 16:47:56,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19728 states. [2019-12-18 16:47:56,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19728 states to 19728 states and 60748 transitions. [2019-12-18 16:47:56,442 INFO L78 Accepts]: Start accepts. Automaton has 19728 states and 60748 transitions. Word has length 59 [2019-12-18 16:47:56,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:47:56,442 INFO L462 AbstractCegarLoop]: Abstraction has 19728 states and 60748 transitions. [2019-12-18 16:47:56,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 16:47:56,442 INFO L276 IsEmpty]: Start isEmpty. Operand 19728 states and 60748 transitions. [2019-12-18 16:47:56,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 16:47:56,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:47:56,464 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] [2019-12-18 16:47:56,464 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:47:56,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:47:56,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1304528589, now seen corresponding path program 3 times [2019-12-18 16:47:56,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:47:56,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331360560] [2019-12-18 16:47:56,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:47:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:47:56,861 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 16:47:56,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331360560] [2019-12-18 16:47:56,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:47:56,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 16:47:56,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460499264] [2019-12-18 16:47:56,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 16:47:56,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:47:56,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 16:47:56,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-12-18 16:47:56,862 INFO L87 Difference]: Start difference. First operand 19728 states and 60748 transitions. Second operand 18 states. [2019-12-18 16:47:59,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:47:59,810 INFO L93 Difference]: Finished difference Result 23540 states and 71203 transitions. [2019-12-18 16:47:59,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 16:47:59,811 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2019-12-18 16:47:59,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:47:59,844 INFO L225 Difference]: With dead ends: 23540 [2019-12-18 16:47:59,844 INFO L226 Difference]: Without dead ends: 22918 [2019-12-18 16:47:59,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=256, Invalid=1466, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 16:47:59,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22918 states. [2019-12-18 16:48:00,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22918 to 20091. [2019-12-18 16:48:00,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20091 states. [2019-12-18 16:48:00,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20091 states to 20091 states and 61789 transitions. [2019-12-18 16:48:00,153 INFO L78 Accepts]: Start accepts. Automaton has 20091 states and 61789 transitions. Word has length 59 [2019-12-18 16:48:00,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:48:00,153 INFO L462 AbstractCegarLoop]: Abstraction has 20091 states and 61789 transitions. [2019-12-18 16:48:00,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 16:48:00,153 INFO L276 IsEmpty]: Start isEmpty. Operand 20091 states and 61789 transitions. [2019-12-18 16:48:00,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 16:48:00,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:48:00,176 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] [2019-12-18 16:48:00,176 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:48:00,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:48:00,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1026660081, now seen corresponding path program 4 times [2019-12-18 16:48:00,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:48:00,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580166188] [2019-12-18 16:48:00,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:48:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:48:00,350 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 16:48:00,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580166188] [2019-12-18 16:48:00,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:48:00,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:48:00,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483740750] [2019-12-18 16:48:00,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 16:48:00,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:48:00,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 16:48:00,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:48:00,352 INFO L87 Difference]: Start difference. First operand 20091 states and 61789 transitions. Second operand 12 states. [2019-12-18 16:48:03,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:48:03,042 INFO L93 Difference]: Finished difference Result 29033 states and 88082 transitions. [2019-12-18 16:48:03,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 16:48:03,043 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-18 16:48:03,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:48:03,080 INFO L225 Difference]: With dead ends: 29033 [2019-12-18 16:48:03,080 INFO L226 Difference]: Without dead ends: 25214 [2019-12-18 16:48:03,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2019-12-18 16:48:03,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25214 states. [2019-12-18 16:48:03,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25214 to 18106. [2019-12-18 16:48:03,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18106 states. [2019-12-18 16:48:03,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18106 states to 18106 states and 55852 transitions. [2019-12-18 16:48:03,390 INFO L78 Accepts]: Start accepts. Automaton has 18106 states and 55852 transitions. Word has length 59 [2019-12-18 16:48:03,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:48:03,390 INFO L462 AbstractCegarLoop]: Abstraction has 18106 states and 55852 transitions. [2019-12-18 16:48:03,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 16:48:03,390 INFO L276 IsEmpty]: Start isEmpty. Operand 18106 states and 55852 transitions. [2019-12-18 16:48:03,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 16:48:03,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:48:03,410 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] [2019-12-18 16:48:03,410 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:48:03,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:48:03,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1129996185, now seen corresponding path program 5 times [2019-12-18 16:48:03,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:48:03,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254492711] [2019-12-18 16:48:03,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:48:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:48:03,701 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 16:48:03,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254492711] [2019-12-18 16:48:03,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:48:03,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:48:03,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858329556] [2019-12-18 16:48:03,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 16:48:03,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:48:03,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 16:48:03,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:48:03,703 INFO L87 Difference]: Start difference. First operand 18106 states and 55852 transitions. Second operand 12 states. [2019-12-18 16:48:04,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:48:04,793 INFO L93 Difference]: Finished difference Result 28922 states and 88836 transitions. [2019-12-18 16:48:04,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 16:48:04,794 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-18 16:48:04,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:48:04,832 INFO L225 Difference]: With dead ends: 28922 [2019-12-18 16:48:04,832 INFO L226 Difference]: Without dead ends: 26404 [2019-12-18 16:48:04,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2019-12-18 16:48:04,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26404 states. [2019-12-18 16:48:05,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26404 to 16678. [2019-12-18 16:48:05,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16678 states. [2019-12-18 16:48:05,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16678 states to 16678 states and 51651 transitions. [2019-12-18 16:48:05,154 INFO L78 Accepts]: Start accepts. Automaton has 16678 states and 51651 transitions. Word has length 59 [2019-12-18 16:48:05,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:48:05,154 INFO L462 AbstractCegarLoop]: Abstraction has 16678 states and 51651 transitions. [2019-12-18 16:48:05,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 16:48:05,154 INFO L276 IsEmpty]: Start isEmpty. Operand 16678 states and 51651 transitions. [2019-12-18 16:48:05,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 16:48:05,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:48:05,172 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] [2019-12-18 16:48:05,173 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:48:05,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:48:05,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1779176519, now seen corresponding path program 6 times [2019-12-18 16:48:05,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:48:05,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922921068] [2019-12-18 16:48:05,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:48:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:48:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:48:05,300 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:48:05,300 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:48:05,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] ULTIMATE.startENTRY-->L846: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_48 0) (= v_~x~0_72 0) (= v_~y$w_buff1_used~0_529 0) (= v_~main$tmp_guard0~0_30 0) (= v_~y$r_buff1_thd1~0_122 0) (= 0 v_~y$w_buff0~0_386) (= 0 v_~y$r_buff0_thd2~0_330) (= v_~__unbuffered_cnt~0_187 0) (= v_~main$tmp_guard1~0_42 0) (< 0 |v_#StackHeapBarrier_22|) (= v_~y~0_163 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd3~0_189) (= 0 v_~__unbuffered_p3_EBX~0_48) (= v_~y$w_buff1~0_278 0) (= 0 v_~y$flush_delayed~0_49) (= 0 v_~y$read_delayed_var~0.base_5) (= v_~y$r_buff0_thd1~0_36 0) (= v_~y$w_buff0_used~0_832 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t605~0.base_29|) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t605~0.base_29| 4) |v_#length_31|) (= (select .cse0 |v_ULTIMATE.start_main_~#t605~0.base_29|) 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= 0 v_~y$r_buff1_thd4~0_202) (= v_~a~0_49 0) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t605~0.base_29| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t605~0.base_29|) |v_ULTIMATE.start_main_~#t605~0.offset_21| 0)) |v_#memory_int_29|) (= 0 v_~y$r_buff1_thd2~0_315) (= v_~y$r_buff0_thd0~0_117 0) (= 0 |v_#NULL.base_4|) (= (store .cse0 |v_ULTIMATE.start_main_~#t605~0.base_29| 1) |v_#valid_72|) (= 0 v_~weak$$choice0~0_22) (= v_~y$mem_tmp~0_24 0) (= 0 v_~y$r_buff0_thd3~0_225) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~__unbuffered_p3_EAX~0_48) (= |v_#NULL.offset_4| 0) (= 0 v_~y$r_buff0_thd4~0_120) (= v_~weak$$choice2~0_186 0) (= v_~y$r_buff1_thd0~0_220 0) (= 0 |v_ULTIMATE.start_main_~#t605~0.offset_21|) (= v_~z~0_163 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_30|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t607~0.base=|v_ULTIMATE.start_main_~#t607~0.base_29|, ULTIMATE.start_main_~#t605~0.offset=|v_ULTIMATE.start_main_~#t605~0.offset_21|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_82|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_75|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_37|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_49, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_189, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_36, ~y$flush_delayed~0=v_~y$flush_delayed~0_49, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_48, #length=|v_#length_31|, ULTIMATE.start_main_~#t607~0.offset=|v_ULTIMATE.start_main_~#t607~0.offset_21|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_29|, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_202, ULTIMATE.start_main_~#t608~0.offset=|v_ULTIMATE.start_main_~#t608~0.offset_16|, ~y$w_buff1~0=v_~y$w_buff1~0_278, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_330, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_187, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_220, ~x~0=v_~x~0_72, ULTIMATE.start_main_~#t605~0.base=|v_ULTIMATE.start_main_~#t605~0.base_29|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_832, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_41|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_63|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ULTIMATE.start_main_~#t606~0.offset=|v_ULTIMATE.start_main_~#t606~0.offset_21|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_122, ~y$w_buff0~0=v_~y$w_buff0~0_386, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_225, ULTIMATE.start_main_~#t606~0.base=|v_ULTIMATE.start_main_~#t606~0.base_29|, ~y~0=v_~y~0_163, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_9|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_48, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_315, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_120, ULTIMATE.start_main_~#t608~0.base=|v_ULTIMATE.start_main_~#t608~0.base_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_117, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_163, ~weak$$choice2~0=v_~weak$$choice2~0_186, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_529} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t607~0.base, ULTIMATE.start_main_~#t605~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t607~0.offset, ULTIMATE.start_main_#t~nondet41, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ULTIMATE.start_main_~#t608~0.offset, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t605~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t606~0.offset, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t606~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t608~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 16:48:05,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L846-1-->L848: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t606~0.offset_10|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t606~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t606~0.base_12| 0)) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t606~0.base_12| 4) |v_#length_19|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t606~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t606~0.base_12|) |v_ULTIMATE.start_main_~#t606~0.offset_10| 1)) |v_#memory_int_17|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t606~0.base_12| 1)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t606~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t606~0.offset=|v_ULTIMATE.start_main_~#t606~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t606~0.base=|v_ULTIMATE.start_main_~#t606~0.base_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t606~0.offset, ULTIMATE.start_main_~#t606~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 16:48:05,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L848-1-->L850: Formula: (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t607~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t607~0.base_13|) |v_ULTIMATE.start_main_~#t607~0.offset_11| 2)) |v_#memory_int_21|) (not (= 0 |v_ULTIMATE.start_main_~#t607~0.base_13|)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t607~0.base_13|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t607~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t607~0.offset_11|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t607~0.base_13|)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t607~0.base_13| 4) |v_#length_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t607~0.base=|v_ULTIMATE.start_main_~#t607~0.base_13|, ULTIMATE.start_main_~#t607~0.offset=|v_ULTIMATE.start_main_~#t607~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t607~0.base, ULTIMATE.start_main_~#t607~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 16:48:05,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L4-->L800: Formula: (and (= v_~y$r_buff0_thd4~0_25 v_~y$r_buff1_thd4~0_25) (= v_~y$r_buff0_thd3~0_17 1) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_24 0)) (= v_~y$r_buff0_thd3~0_18 v_~y$r_buff1_thd3~0_11) (= v_~y$r_buff1_thd1~0_4 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd2~0_68 v_~y$r_buff1_thd2~0_32) (= v_~z~0_10 1) (= v_~y$r_buff0_thd0~0_19 v_~y$r_buff1_thd0~0_17)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_19, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_24} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_32, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_4, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_11, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_17, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_19, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_24, ~z~0=v_~z~0_10, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 16:48:05,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L850-1-->L852: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t608~0.base_10| 4) |v_#length_17|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t608~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t608~0.base_10|) |v_ULTIMATE.start_main_~#t608~0.offset_10| 3)) |v_#memory_int_15|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t608~0.base_10|)) (= |v_ULTIMATE.start_main_~#t608~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t608~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t608~0.base_10|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t608~0.base_10| 1) |v_#valid_38|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ULTIMATE.start_main_~#t608~0.offset=|v_ULTIMATE.start_main_~#t608~0.offset_10|, ULTIMATE.start_main_~#t608~0.base=|v_ULTIMATE.start_main_~#t608~0.base_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t608~0.offset, ULTIMATE.start_main_~#t608~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 16:48:05,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] P0ENTRY-->P0EXIT: Formula: (and (= v_~a~0_23 1) (= v_~x~0_36 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (= v_~__unbuffered_cnt~0_101 (+ v_~__unbuffered_cnt~0_102 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|} OutVars{~a~0=v_~a~0_23, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_36, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 16:48:05,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L823-2-->L823-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1479177383 256))) (.cse0 (= (mod ~y$r_buff1_thd4~0_In-1479177383 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite32_Out-1479177383| ~y~0_In-1479177383)) (and (= ~y$w_buff1~0_In-1479177383 |P3Thread1of1ForFork0_#t~ite32_Out-1479177383|) (not .cse1) (not .cse0)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1479177383, ~y$w_buff1~0=~y$w_buff1~0_In-1479177383, ~y~0=~y~0_In-1479177383, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1479177383} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1479177383, ~y$w_buff1~0=~y$w_buff1~0_In-1479177383, ~y~0=~y~0_In-1479177383, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-1479177383|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1479177383} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 16:48:05,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L823-4-->L824: Formula: (= v_~y~0_43 |v_P3Thread1of1ForFork0_#t~ite32_14|) InVars {P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_14|} OutVars{~y~0=v_~y~0_43, P3Thread1of1ForFork0_#t~ite33=|v_P3Thread1of1ForFork0_#t~ite33_15|, P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_13|} AuxVars[] AssignedVars[~y~0, P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 16:48:05,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-697101535 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd4~0_In-697101535 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite34_Out-697101535| ~y$w_buff0_used~0_In-697101535)) (and (not .cse1) (= |P3Thread1of1ForFork0_#t~ite34_Out-697101535| 0) (not .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-697101535, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-697101535} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-697101535, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-697101535, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out-697101535|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-18 16:48:05,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-1406132799 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1406132799 256)))) (or (and (= ~y$w_buff0_used~0_In-1406132799 |P2Thread1of1ForFork3_#t~ite28_Out-1406132799|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork3_#t~ite28_Out-1406132799|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1406132799, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1406132799} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1406132799, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1406132799, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-1406132799|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-18 16:48:05,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L802-->L802-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-321655683 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-321655683 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-321655683 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-321655683 256)))) (or (and (= |P2Thread1of1ForFork3_#t~ite29_Out-321655683| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite29_Out-321655683| ~y$w_buff1_used~0_In-321655683)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-321655683, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-321655683, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-321655683, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-321655683} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-321655683, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-321655683, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-321655683, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-321655683|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-321655683} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-18 16:48:05,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L803-->L804: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1037791142 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1037791142 256) 0))) (or (and (= ~y$r_buff0_thd3~0_Out1037791142 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd3~0_Out1037791142 ~y$r_buff0_thd3~0_In1037791142)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1037791142, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1037791142} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out1037791142|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1037791142, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1037791142} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 16:48:05,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L804-->L804-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1588037877 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-1588037877 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1588037877 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1588037877 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork3_#t~ite31_Out-1588037877| ~y$r_buff1_thd3~0_In-1588037877)) (and (= |P2Thread1of1ForFork3_#t~ite31_Out-1588037877| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1588037877, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1588037877, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1588037877, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1588037877} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1588037877, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1588037877, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1588037877, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-1588037877|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1588037877} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-18 16:48:05,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L804-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#t~ite31_40| v_~y$r_buff1_thd3~0_125) (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= v_~__unbuffered_cnt~0_126 (+ v_~__unbuffered_cnt~0_127 1))) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_125, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 16:48:05,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L825-->L825-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd4~0_In1708150275 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1708150275 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd4~0_In1708150275 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1708150275 256)))) (or (and (= 0 |P3Thread1of1ForFork0_#t~ite35_Out1708150275|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In1708150275 |P3Thread1of1ForFork0_#t~ite35_Out1708150275|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1708150275, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1708150275, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1708150275, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1708150275} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1708150275, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1708150275, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1708150275, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out1708150275|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1708150275} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-18 16:48:05,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In1966006030 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1966006030 256) 0))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork0_#t~ite36_Out1966006030| 0)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite36_Out1966006030| ~y$r_buff0_thd4~0_In1966006030)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1966006030, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1966006030} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1966006030, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1966006030, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out1966006030|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-18 16:48:05,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L827-->L827-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-24423748 256))) (.cse3 (= (mod ~y$r_buff1_thd4~0_In-24423748 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-24423748 256))) (.cse0 (= (mod ~y$r_buff0_thd4~0_In-24423748 256) 0))) (or (and (= ~y$r_buff1_thd4~0_In-24423748 |P3Thread1of1ForFork0_#t~ite37_Out-24423748|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork0_#t~ite37_Out-24423748| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-24423748, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-24423748, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-24423748, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-24423748} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-24423748, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-24423748, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-24423748, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out-24423748|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-24423748} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-18 16:48:05,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L827-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_96 1) v_~__unbuffered_cnt~0_95) (= |v_P3Thread1of1ForFork0_#t~ite37_48| v_~y$r_buff1_thd4~0_61) (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_48|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_61, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_47|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 16:48:05,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L764-->L764-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-57959045 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-57959045 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-57959045 256)) (and (= 0 (mod ~y$w_buff1_used~0_In-57959045 256)) .cse0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-57959045 256)) .cse0))) (= ~y$w_buff0~0_In-57959045 |P1Thread1of1ForFork2_#t~ite8_Out-57959045|) (= |P1Thread1of1ForFork2_#t~ite9_Out-57959045| |P1Thread1of1ForFork2_#t~ite8_Out-57959045|) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite8_In-57959045| |P1Thread1of1ForFork2_#t~ite8_Out-57959045|) (= ~y$w_buff0~0_In-57959045 |P1Thread1of1ForFork2_#t~ite9_Out-57959045|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-57959045, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-57959045, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In-57959045|, ~y$w_buff0~0=~y$w_buff0~0_In-57959045, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-57959045, ~weak$$choice2~0=~weak$$choice2~0_In-57959045, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-57959045} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-57959045, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-57959045|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-57959045, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-57959045|, ~y$w_buff0~0=~y$w_buff0~0_In-57959045, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-57959045, ~weak$$choice2~0=~weak$$choice2~0_In-57959045, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-57959045} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 16:48:05,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L766-->L766-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-576776579 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_In-576776579| |P1Thread1of1ForFork2_#t~ite14_Out-576776579|) (= |P1Thread1of1ForFork2_#t~ite15_Out-576776579| ~y$w_buff0_used~0_In-576776579) (not .cse0)) (and (= |P1Thread1of1ForFork2_#t~ite15_Out-576776579| |P1Thread1of1ForFork2_#t~ite14_Out-576776579|) (= ~y$w_buff0_used~0_In-576776579 |P1Thread1of1ForFork2_#t~ite14_Out-576776579|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-576776579 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-576776579 256) 0) .cse1) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-576776579 256))) (= (mod ~y$w_buff0_used~0_In-576776579 256) 0))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-576776579, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-576776579, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-576776579, ~weak$$choice2~0=~weak$$choice2~0_In-576776579, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In-576776579|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-576776579} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-576776579, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-576776579, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-576776579, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-576776579|, ~weak$$choice2~0=~weak$$choice2~0_In-576776579, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out-576776579|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-576776579} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 16:48:05,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L768-->L769: Formula: (and (= v_~y$r_buff0_thd2~0_109 v_~y$r_buff0_thd2~0_108) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_15|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_10|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 16:48:05,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L769-->L769-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In293090503 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite24_Out293090503| ~y$r_buff1_thd2~0_In293090503) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite23_In293090503| |P1Thread1of1ForFork2_#t~ite23_Out293090503|)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In293090503 256)))) (or (= (mod ~y$w_buff0_used~0_In293090503 256) 0) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In293090503 256))) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In293090503 256) 0)))) .cse0 (= |P1Thread1of1ForFork2_#t~ite23_Out293090503| ~y$r_buff1_thd2~0_In293090503) (= |P1Thread1of1ForFork2_#t~ite24_Out293090503| |P1Thread1of1ForFork2_#t~ite23_Out293090503|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In293090503, ~y$w_buff0_used~0=~y$w_buff0_used~0_In293090503, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In293090503, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In293090503|, ~weak$$choice2~0=~weak$$choice2~0_In293090503, ~y$w_buff1_used~0=~y$w_buff1_used~0_In293090503} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In293090503, ~y$w_buff0_used~0=~y$w_buff0_used~0_In293090503, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In293090503, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out293090503|, ~weak$$choice2~0=~weak$$choice2~0_In293090503, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out293090503|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In293090503} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 16:48:05,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L771-->L779: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= v_~y~0_19 v_~y$mem_tmp~0_4) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, ~y~0=v_~y~0_19, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_11|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 16:48:05,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L852-1-->L858: Formula: (and (= 4 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 16:48:05,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L858-2-->L858-5: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1867815364 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite43_Out-1867815364| |ULTIMATE.start_main_#t~ite42_Out-1867815364|)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1867815364 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= ~y~0_In-1867815364 |ULTIMATE.start_main_#t~ite42_Out-1867815364|)) (and (not .cse2) .cse0 (not .cse1) (= ~y$w_buff1~0_In-1867815364 |ULTIMATE.start_main_#t~ite42_Out-1867815364|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1867815364, ~y~0=~y~0_In-1867815364, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1867815364, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1867815364} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1867815364, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1867815364|, ~y~0=~y~0_In-1867815364, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1867815364|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1867815364, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1867815364} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 16:48:05,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L859-->L859-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-388182011 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-388182011 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-388182011| ~y$w_buff0_used~0_In-388182011)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-388182011| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-388182011, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-388182011} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-388182011, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-388182011, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-388182011|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 16:48:05,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L860-->L860-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-84696441 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-84696441 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-84696441 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-84696441 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-84696441| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-84696441| ~y$w_buff1_used~0_In-84696441) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-84696441, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-84696441, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-84696441, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-84696441} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-84696441, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-84696441, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-84696441, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-84696441|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-84696441} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 16:48:05,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L861-->L861-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-122877400 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-122877400 256)))) (or (and (= ~y$r_buff0_thd0~0_In-122877400 |ULTIMATE.start_main_#t~ite46_Out-122877400|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite46_Out-122877400| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-122877400, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-122877400} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-122877400, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-122877400, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-122877400|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 16:48:05,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L862-->L862-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1108939919 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1108939919 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-1108939919 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1108939919 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-1108939919 |ULTIMATE.start_main_#t~ite47_Out-1108939919|)) (and (= 0 |ULTIMATE.start_main_#t~ite47_Out-1108939919|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1108939919, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1108939919, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1108939919, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1108939919} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1108939919, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1108939919, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1108939919|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1108939919, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1108939919} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 16:48:05,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L862-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 2 v_~__unbuffered_p1_EAX~0_26) (= 2 v_~__unbuffered_p3_EAX~0_24) (= v_~__unbuffered_p1_EBX~0_25 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~y$r_buff1_thd0~0_153 |v_ULTIMATE.start_main_#t~ite47_41|) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~x~0_45 2) (= v_~main$tmp_guard1~0_19 0) (= v_~z~0_103 2)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_41|, ~z~0=v_~z~0_103, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_45} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_40|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~z~0=v_~z~0_103, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_45, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 16:48:05,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:48:05 BasicIcfg [2019-12-18 16:48:05,474 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:48:05,475 INFO L168 Benchmark]: Toolchain (without parser) took 150946.94 ms. Allocated memory was 135.3 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 98.5 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 16:48:05,476 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 135.3 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 16:48:05,476 INFO L168 Benchmark]: CACSL2BoogieTranslator took 835.28 ms. Allocated memory was 135.3 MB in the beginning and 197.7 MB in the end (delta: 62.4 MB). Free memory was 98.1 MB in the beginning and 149.0 MB in the end (delta: -50.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-18 16:48:05,477 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.94 ms. Allocated memory is still 197.7 MB. Free memory was 149.0 MB in the beginning and 146.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 16:48:05,477 INFO L168 Benchmark]: Boogie Preprocessor took 54.30 ms. Allocated memory is still 197.7 MB. Free memory was 146.1 MB in the beginning and 144.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 16:48:05,478 INFO L168 Benchmark]: RCFGBuilder took 842.66 ms. Allocated memory is still 197.7 MB. Free memory was 143.3 MB in the beginning and 94.3 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. [2019-12-18 16:48:05,478 INFO L168 Benchmark]: TraceAbstraction took 149139.83 ms. Allocated memory was 197.7 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 93.6 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 16:48:05,480 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50 ms. Allocated memory is still 135.3 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 835.28 ms. Allocated memory was 135.3 MB in the beginning and 197.7 MB in the end (delta: 62.4 MB). Free memory was 98.1 MB in the beginning and 149.0 MB in the end (delta: -50.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.94 ms. Allocated memory is still 197.7 MB. Free memory was 149.0 MB in the beginning and 146.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.30 ms. Allocated memory is still 197.7 MB. Free memory was 146.1 MB in the beginning and 144.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 842.66 ms. Allocated memory is still 197.7 MB. Free memory was 143.3 MB in the beginning and 94.3 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 149139.83 ms. Allocated memory was 197.7 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 93.6 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 181 ProgramPointsBefore, 88 ProgramPointsAfterwards, 209 TransitionsBefore, 95 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 26 ChoiceCompositions, 7917 VarBasedMoverChecksPositive, 267 VarBasedMoverChecksNegative, 87 SemBasedMoverChecksPositive, 235 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 66461 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L846] FCALL, FORK 0 pthread_create(&t605, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] FCALL, FORK 0 pthread_create(&t606, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] FCALL, FORK 0 pthread_create(&t607, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 3 y$w_buff1 = y$w_buff0 [L785] 3 y$w_buff0 = 1 [L786] 3 y$w_buff1_used = y$w_buff0_used [L787] 3 y$w_buff0_used = (_Bool)1 [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L852] FCALL, FORK 0 pthread_create(&t608, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 4 z = 2 [L817] 4 __unbuffered_p3_EAX = z [L820] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 2 x = 2 [L756] 2 __unbuffered_p1_EAX = x [L759] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 2 y$flush_delayed = weak$$choice2 [L762] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L800] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L763] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L801] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L825] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L826] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L764] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L765] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L765] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L766] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L767] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L767] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L858] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L859] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L861] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 148.7s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 44.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7415 SDtfs, 11016 SDslu, 32944 SDs, 0 SdLazy, 24476 SolverSat, 587 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 545 GetRequests, 52 SyntacticMatches, 15 SemanticMatches, 478 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2889 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160898occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 59.0s AutomataMinimizationTime, 30 MinimizatonAttempts, 249722 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1480 NumberOfCodeBlocks, 1480 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1391 ConstructedInterpolants, 0 QuantifiedInterpolants, 367283 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...