/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:14:19,372 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:14:19,374 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:14:19,386 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:14:19,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:14:19,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:14:19,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:14:19,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:14:19,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:14:19,393 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:14:19,394 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:14:19,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:14:19,396 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:14:19,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:14:19,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:14:19,399 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:14:19,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:14:19,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:14:19,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:14:19,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:14:19,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:14:19,407 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:14:19,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:14:19,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:14:19,412 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:14:19,412 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:14:19,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:14:19,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:14:19,414 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:14:19,415 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:14:19,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:14:19,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:14:19,416 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:14:19,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:14:19,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:14:19,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:14:19,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:14:19,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:14:19,419 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:14:19,420 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:14:19,421 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:14:19,422 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:14:19,436 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:14:19,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:14:19,437 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:14:19,438 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:14:19,438 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:14:19,438 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:14:19,438 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:14:19,438 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:14:19,439 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:14:19,439 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:14:19,439 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:14:19,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:14:19,439 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:14:19,440 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:14:19,440 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:14:19,440 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:14:19,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:14:19,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:14:19,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:14:19,441 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:14:19,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:14:19,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:14:19,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:14:19,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:14:19,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:14:19,442 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:14:19,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:14:19,442 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:14:19,443 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:14:19,443 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:14:19,704 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:14:19,716 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:14:19,723 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:14:19,724 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:14:19,725 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:14:19,725 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_rmo.oepc.i [2019-12-18 14:14:19,782 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28ba7afa5/1981edad45c24853abed6b3f9440167b/FLAG6aef73ca6 [2019-12-18 14:14:20,373 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:14:20,373 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_rmo.oepc.i [2019-12-18 14:14:20,392 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28ba7afa5/1981edad45c24853abed6b3f9440167b/FLAG6aef73ca6 [2019-12-18 14:14:20,606 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28ba7afa5/1981edad45c24853abed6b3f9440167b [2019-12-18 14:14:20,621 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:14:20,623 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:14:20,624 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:14:20,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:14:20,628 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:14:20,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:14:20" (1/1) ... [2019-12-18 14:14:20,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6968dd54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:14:20, skipping insertion in model container [2019-12-18 14:14:20,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:14:20" (1/1) ... [2019-12-18 14:14:20,640 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:14:20,695 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:14:21,248 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:14:21,273 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:14:21,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:14:21,436 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:14:21,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:14:21 WrapperNode [2019-12-18 14:14:21,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:14:21,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:14:21,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:14:21,438 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:14:21,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:14:21" (1/1) ... [2019-12-18 14:14:21,468 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:14:21" (1/1) ... [2019-12-18 14:14:21,497 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:14:21,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:14:21,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:14:21,498 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:14:21,508 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:14:21" (1/1) ... [2019-12-18 14:14:21,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:14:21" (1/1) ... [2019-12-18 14:14:21,513 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:14:21" (1/1) ... [2019-12-18 14:14:21,514 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:14:21" (1/1) ... [2019-12-18 14:14:21,526 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:14:21" (1/1) ... [2019-12-18 14:14:21,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:14:21" (1/1) ... [2019-12-18 14:14:21,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:14:21" (1/1) ... [2019-12-18 14:14:21,540 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:14:21,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:14:21,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:14:21,541 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:14:21,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:14:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:14:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:14:21,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:14:21,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:14:21,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:14:21,606 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:14:21,607 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:14:21,607 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:14:21,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:14:21,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:14:21,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:14:21,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:14:21,613 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 14:14:22,324 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:14:22,325 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:14:22,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:14:22 BoogieIcfgContainer [2019-12-18 14:14:22,326 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:14:22,328 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:14:22,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:14:22,333 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:14:22,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:14:20" (1/3) ... [2019-12-18 14:14:22,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3075fc10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:14:22, skipping insertion in model container [2019-12-18 14:14:22,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:14:21" (2/3) ... [2019-12-18 14:14:22,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3075fc10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:14:22, skipping insertion in model container [2019-12-18 14:14:22,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:14:22" (3/3) ... [2019-12-18 14:14:22,341 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_rmo.oepc.i [2019-12-18 14:14:22,351 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:14:22,351 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:14:22,359 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:14:22,360 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:14:22,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,399 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,399 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,400 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,400 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,401 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,411 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,411 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,445 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,445 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,446 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,452 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,472 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:22,492 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 14:14:22,516 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:14:22,517 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:14:22,517 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:14:22,517 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:14:22,517 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:14:22,517 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:14:22,517 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:14:22,518 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:14:22,540 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 14:14:22,543 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 14:14:22,628 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 14:14:22,628 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:14:22,643 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 14:14:22,663 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 14:14:22,702 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 14:14:22,702 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:14:22,708 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 14:14:22,723 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 14:14:22,724 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:14:27,745 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 14:14:27,881 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 14:14:28,279 INFO L206 etLargeBlockEncoding]: Checked pairs total: 76691 [2019-12-18 14:14:28,280 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-18 14:14:28,284 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-12-18 14:14:28,922 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9438 states. [2019-12-18 14:14:28,924 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states. [2019-12-18 14:14:28,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 14:14:28,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:14:28,932 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 14:14:28,933 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:14:28,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:14:28,940 INFO L82 PathProgramCache]: Analyzing trace with hash 790297, now seen corresponding path program 1 times [2019-12-18 14:14:28,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:14:28,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65659972] [2019-12-18 14:14:28,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:14:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:14:29,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:14:29,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65659972] [2019-12-18 14:14:29,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:14:29,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:14:29,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333299058] [2019-12-18 14:14:29,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:14:29,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:14:29,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:14:29,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:14:29,219 INFO L87 Difference]: Start difference. First operand 9438 states. Second operand 3 states. [2019-12-18 14:14:29,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:14:29,506 INFO L93 Difference]: Finished difference Result 9266 states and 29920 transitions. [2019-12-18 14:14:29,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:14:29,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 14:14:29,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:14:29,635 INFO L225 Difference]: With dead ends: 9266 [2019-12-18 14:14:29,635 INFO L226 Difference]: Without dead ends: 8258 [2019-12-18 14:14:29,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:14:29,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8258 states. [2019-12-18 14:14:30,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8258 to 8258. [2019-12-18 14:14:30,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8258 states. [2019-12-18 14:14:30,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 26572 transitions. [2019-12-18 14:14:30,079 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 26572 transitions. Word has length 3 [2019-12-18 14:14:30,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:14:30,079 INFO L462 AbstractCegarLoop]: Abstraction has 8258 states and 26572 transitions. [2019-12-18 14:14:30,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:14:30,080 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 26572 transitions. [2019-12-18 14:14:30,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:14:30,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:14:30,083 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:14:30,083 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:14:30,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:14:30,084 INFO L82 PathProgramCache]: Analyzing trace with hash 316025548, now seen corresponding path program 1 times [2019-12-18 14:14:30,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:14:30,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44452207] [2019-12-18 14:14:30,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:14:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:14:30,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:14:30,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44452207] [2019-12-18 14:14:30,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:14:30,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:14:30,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607147120] [2019-12-18 14:14:30,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:14:30,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:14:30,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:14:30,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:14:30,243 INFO L87 Difference]: Start difference. First operand 8258 states and 26572 transitions. Second operand 4 states. [2019-12-18 14:14:30,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:14:30,314 INFO L93 Difference]: Finished difference Result 1877 states and 4722 transitions. [2019-12-18 14:14:30,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:14:30,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:14:30,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:14:30,323 INFO L225 Difference]: With dead ends: 1877 [2019-12-18 14:14:30,323 INFO L226 Difference]: Without dead ends: 1373 [2019-12-18 14:14:30,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:14:30,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2019-12-18 14:14:30,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1373. [2019-12-18 14:14:30,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2019-12-18 14:14:30,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 3108 transitions. [2019-12-18 14:14:30,441 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 3108 transitions. Word has length 11 [2019-12-18 14:14:30,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:14:30,441 INFO L462 AbstractCegarLoop]: Abstraction has 1373 states and 3108 transitions. [2019-12-18 14:14:30,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:14:30,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 3108 transitions. [2019-12-18 14:14:30,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:14:30,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:14:30,444 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:14:30,444 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:14:30,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:14:30,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1209477957, now seen corresponding path program 1 times [2019-12-18 14:14:30,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:14:30,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882880562] [2019-12-18 14:14:30,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:14:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:14:30,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:14:30,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882880562] [2019-12-18 14:14:30,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:14:30,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:14:30,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215368114] [2019-12-18 14:14:30,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:14:30,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:14:30,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:14:30,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:14:30,594 INFO L87 Difference]: Start difference. First operand 1373 states and 3108 transitions. Second operand 4 states. [2019-12-18 14:14:30,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:14:30,790 INFO L93 Difference]: Finished difference Result 1700 states and 3783 transitions. [2019-12-18 14:14:30,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:14:30,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 14:14:30,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:14:30,800 INFO L225 Difference]: With dead ends: 1700 [2019-12-18 14:14:30,800 INFO L226 Difference]: Without dead ends: 1700 [2019-12-18 14:14:30,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:14:30,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2019-12-18 14:14:30,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1636. [2019-12-18 14:14:30,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1636 states. [2019-12-18 14:14:30,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 3659 transitions. [2019-12-18 14:14:30,849 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 3659 transitions. Word has length 14 [2019-12-18 14:14:30,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:14:30,852 INFO L462 AbstractCegarLoop]: Abstraction has 1636 states and 3659 transitions. [2019-12-18 14:14:30,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:14:30,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 3659 transitions. [2019-12-18 14:14:30,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:14:30,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:14:30,857 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:14:30,857 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:14:30,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:14:30,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1133745070, now seen corresponding path program 1 times [2019-12-18 14:14:30,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:14:30,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729577616] [2019-12-18 14:14:30,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:14:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:14:31,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:14:31,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729577616] [2019-12-18 14:14:31,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:14:31,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:14:31,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133587699] [2019-12-18 14:14:31,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:14:31,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:14:31,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:14:31,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:14:31,125 INFO L87 Difference]: Start difference. First operand 1636 states and 3659 transitions. Second operand 6 states. [2019-12-18 14:14:31,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:14:31,805 INFO L93 Difference]: Finished difference Result 4529 states and 10000 transitions. [2019-12-18 14:14:31,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:14:31,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 14:14:31,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:14:31,830 INFO L225 Difference]: With dead ends: 4529 [2019-12-18 14:14:31,830 INFO L226 Difference]: Without dead ends: 4494 [2019-12-18 14:14:31,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:14:31,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4494 states. [2019-12-18 14:14:31,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4494 to 2196. [2019-12-18 14:14:31,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2196 states. [2019-12-18 14:14:31,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 4963 transitions. [2019-12-18 14:14:31,905 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 4963 transitions. Word has length 25 [2019-12-18 14:14:31,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:14:31,906 INFO L462 AbstractCegarLoop]: Abstraction has 2196 states and 4963 transitions. [2019-12-18 14:14:31,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:14:31,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 4963 transitions. [2019-12-18 14:14:31,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 14:14:31,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:14:31,909 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:14:31,910 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:14:31,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:14:31,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1415860500, now seen corresponding path program 1 times [2019-12-18 14:14:31,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:14:31,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584989194] [2019-12-18 14:14:31,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:14:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:14:31,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:14:31,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584989194] [2019-12-18 14:14:31,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:14:31,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:14:31,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331958552] [2019-12-18 14:14:31,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:14:31,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:14:31,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:14:31,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:14:31,956 INFO L87 Difference]: Start difference. First operand 2196 states and 4963 transitions. Second operand 3 states. [2019-12-18 14:14:31,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:14:31,971 INFO L93 Difference]: Finished difference Result 2195 states and 4961 transitions. [2019-12-18 14:14:31,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:14:31,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 14:14:31,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:14:31,982 INFO L225 Difference]: With dead ends: 2195 [2019-12-18 14:14:31,982 INFO L226 Difference]: Without dead ends: 2195 [2019-12-18 14:14:31,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:14:31,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2195 states. [2019-12-18 14:14:32,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 2195. [2019-12-18 14:14:32,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2195 states. [2019-12-18 14:14:32,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 2195 states and 4961 transitions. [2019-12-18 14:14:32,033 INFO L78 Accepts]: Start accepts. Automaton has 2195 states and 4961 transitions. Word has length 26 [2019-12-18 14:14:32,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:14:32,034 INFO L462 AbstractCegarLoop]: Abstraction has 2195 states and 4961 transitions. [2019-12-18 14:14:32,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:14:32,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 4961 transitions. [2019-12-18 14:14:32,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 14:14:32,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:14:32,046 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:14:32,046 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:14:32,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:14:32,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1963896570, now seen corresponding path program 1 times [2019-12-18 14:14:32,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:14:32,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709093853] [2019-12-18 14:14:32,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:14:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:14:32,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:14:32,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709093853] [2019-12-18 14:14:32,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:14:32,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:14:32,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657891652] [2019-12-18 14:14:32,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:14:32,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:14:32,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:14:32,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:14:32,273 INFO L87 Difference]: Start difference. First operand 2195 states and 4961 transitions. Second operand 6 states. [2019-12-18 14:14:32,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:14:32,881 INFO L93 Difference]: Finished difference Result 4412 states and 9625 transitions. [2019-12-18 14:14:32,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:14:32,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-18 14:14:32,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:14:32,896 INFO L225 Difference]: With dead ends: 4412 [2019-12-18 14:14:32,896 INFO L226 Difference]: Without dead ends: 4383 [2019-12-18 14:14:32,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:14:32,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4383 states. [2019-12-18 14:14:32,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4383 to 2070. [2019-12-18 14:14:32,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2070 states. [2019-12-18 14:14:32,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 4705 transitions. [2019-12-18 14:14:32,965 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 4705 transitions. Word has length 26 [2019-12-18 14:14:32,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:14:32,966 INFO L462 AbstractCegarLoop]: Abstraction has 2070 states and 4705 transitions. [2019-12-18 14:14:32,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:14:32,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 4705 transitions. [2019-12-18 14:14:32,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 14:14:32,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:14:32,969 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:14:32,969 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:14:32,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:14:32,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1827812304, now seen corresponding path program 1 times [2019-12-18 14:14:32,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:14:32,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105973486] [2019-12-18 14:14:32,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:14:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:14:33,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:14:33,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105973486] [2019-12-18 14:14:33,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:14:33,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:14:33,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109692368] [2019-12-18 14:14:33,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:14:33,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:14:33,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:14:33,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:14:33,043 INFO L87 Difference]: Start difference. First operand 2070 states and 4705 transitions. Second operand 5 states. [2019-12-18 14:14:33,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:14:33,481 INFO L93 Difference]: Finished difference Result 3102 states and 6886 transitions. [2019-12-18 14:14:33,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:14:33,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 14:14:33,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:14:33,490 INFO L225 Difference]: With dead ends: 3102 [2019-12-18 14:14:33,490 INFO L226 Difference]: Without dead ends: 3102 [2019-12-18 14:14:33,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:14:33,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3102 states. [2019-12-18 14:14:33,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3102 to 2654. [2019-12-18 14:14:33,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2654 states. [2019-12-18 14:14:33,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 5970 transitions. [2019-12-18 14:14:33,550 INFO L78 Accepts]: Start accepts. Automaton has 2654 states and 5970 transitions. Word has length 27 [2019-12-18 14:14:33,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:14:33,550 INFO L462 AbstractCegarLoop]: Abstraction has 2654 states and 5970 transitions. [2019-12-18 14:14:33,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:14:33,550 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 5970 transitions. [2019-12-18 14:14:33,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 14:14:33,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:14:33,555 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 14:14:33,555 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:14:33,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:14:33,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1234551102, now seen corresponding path program 1 times [2019-12-18 14:14:33,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:14:33,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988494985] [2019-12-18 14:14:33,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:14:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:14:33,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:14:33,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988494985] [2019-12-18 14:14:33,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:14:33,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:14:33,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446789394] [2019-12-18 14:14:33,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:14:33,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:14:33,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:14:33,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:14:33,641 INFO L87 Difference]: Start difference. First operand 2654 states and 5970 transitions. Second operand 5 states. [2019-12-18 14:14:33,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:14:33,684 INFO L93 Difference]: Finished difference Result 1623 states and 3504 transitions. [2019-12-18 14:14:33,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:14:33,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 14:14:33,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:14:33,689 INFO L225 Difference]: With dead ends: 1623 [2019-12-18 14:14:33,690 INFO L226 Difference]: Without dead ends: 1475 [2019-12-18 14:14:33,690 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 14:14:33,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2019-12-18 14:14:33,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1374. [2019-12-18 14:14:33,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2019-12-18 14:14:33,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2999 transitions. [2019-12-18 14:14:33,722 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2999 transitions. Word has length 28 [2019-12-18 14:14:33,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:14:33,723 INFO L462 AbstractCegarLoop]: Abstraction has 1374 states and 2999 transitions. [2019-12-18 14:14:33,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:14:33,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2999 transitions. [2019-12-18 14:14:33,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 14:14:33,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:14:33,730 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] [2019-12-18 14:14:33,730 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:14:33,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:14:33,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1528690992, now seen corresponding path program 1 times [2019-12-18 14:14:33,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:14:33,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6935009] [2019-12-18 14:14:33,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:14:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:14:33,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:14:33,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6935009] [2019-12-18 14:14:33,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:14:33,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:14:33,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383621072] [2019-12-18 14:14:33,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:14:33,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:14:33,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:14:33,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:14:33,905 INFO L87 Difference]: Start difference. First operand 1374 states and 2999 transitions. Second operand 7 states. [2019-12-18 14:14:34,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:14:34,180 INFO L93 Difference]: Finished difference Result 4064 states and 8639 transitions. [2019-12-18 14:14:34,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:14:34,181 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 14:14:34,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:14:34,187 INFO L225 Difference]: With dead ends: 4064 [2019-12-18 14:14:34,187 INFO L226 Difference]: Without dead ends: 2676 [2019-12-18 14:14:34,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:14:34,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2019-12-18 14:14:34,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 1440. [2019-12-18 14:14:34,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1440 states. [2019-12-18 14:14:34,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 3133 transitions. [2019-12-18 14:14:34,227 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 3133 transitions. Word has length 51 [2019-12-18 14:14:34,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:14:34,228 INFO L462 AbstractCegarLoop]: Abstraction has 1440 states and 3133 transitions. [2019-12-18 14:14:34,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:14:34,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 3133 transitions. [2019-12-18 14:14:34,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 14:14:34,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:14:34,232 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] [2019-12-18 14:14:34,232 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:14:34,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:14:34,232 INFO L82 PathProgramCache]: Analyzing trace with hash 517037056, now seen corresponding path program 2 times [2019-12-18 14:14:34,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:14:34,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568182949] [2019-12-18 14:14:34,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:14:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:14:34,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:14:34,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568182949] [2019-12-18 14:14:34,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:14:34,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:14:34,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550490627] [2019-12-18 14:14:34,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:14:34,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:14:34,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:14:34,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:14:34,379 INFO L87 Difference]: Start difference. First operand 1440 states and 3133 transitions. Second operand 7 states. [2019-12-18 14:14:35,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:14:35,636 INFO L93 Difference]: Finished difference Result 3010 states and 6346 transitions. [2019-12-18 14:14:35,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 14:14:35,637 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 14:14:35,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:14:35,646 INFO L225 Difference]: With dead ends: 3010 [2019-12-18 14:14:35,646 INFO L226 Difference]: Without dead ends: 3010 [2019-12-18 14:14:35,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-12-18 14:14:35,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states. [2019-12-18 14:14:35,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 1524. [2019-12-18 14:14:35,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1524 states. [2019-12-18 14:14:35,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 3330 transitions. [2019-12-18 14:14:35,692 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 3330 transitions. Word has length 51 [2019-12-18 14:14:35,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:14:35,692 INFO L462 AbstractCegarLoop]: Abstraction has 1524 states and 3330 transitions. [2019-12-18 14:14:35,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:14:35,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 3330 transitions. [2019-12-18 14:14:35,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 14:14:35,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:14:35,697 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] [2019-12-18 14:14:35,698 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:14:35,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:14:35,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1191050856, now seen corresponding path program 3 times [2019-12-18 14:14:35,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:14:35,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80882502] [2019-12-18 14:14:35,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:14:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:14:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:14:35,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80882502] [2019-12-18 14:14:35,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:14:35,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:14:35,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740573708] [2019-12-18 14:14:35,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:14:35,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:14:35,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:14:35,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:14:35,799 INFO L87 Difference]: Start difference. First operand 1524 states and 3330 transitions. Second operand 5 states. [2019-12-18 14:14:36,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:14:36,077 INFO L93 Difference]: Finished difference Result 1662 states and 3580 transitions. [2019-12-18 14:14:36,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:14:36,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-18 14:14:36,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:14:36,083 INFO L225 Difference]: With dead ends: 1662 [2019-12-18 14:14:36,083 INFO L226 Difference]: Without dead ends: 1662 [2019-12-18 14:14:36,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:14:36,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2019-12-18 14:14:36,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1532. [2019-12-18 14:14:36,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1532 states. [2019-12-18 14:14:36,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 3346 transitions. [2019-12-18 14:14:36,112 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 3346 transitions. Word has length 51 [2019-12-18 14:14:36,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:14:36,113 INFO L462 AbstractCegarLoop]: Abstraction has 1532 states and 3346 transitions. [2019-12-18 14:14:36,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:14:36,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 3346 transitions. [2019-12-18 14:14:36,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 14:14:36,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:14:36,117 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] [2019-12-18 14:14:36,117 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:14:36,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:14:36,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1063747950, now seen corresponding path program 4 times [2019-12-18 14:14:36,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:14:36,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983626653] [2019-12-18 14:14:36,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:14:36,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:14:36,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:14:36,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983626653] [2019-12-18 14:14:36,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:14:36,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:14:36,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672420160] [2019-12-18 14:14:36,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:14:36,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:14:36,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:14:36,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:14:36,233 INFO L87 Difference]: Start difference. First operand 1532 states and 3346 transitions. Second operand 6 states. [2019-12-18 14:14:36,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:14:36,708 INFO L93 Difference]: Finished difference Result 1903 states and 4057 transitions. [2019-12-18 14:14:36,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:14:36,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-18 14:14:36,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:14:36,713 INFO L225 Difference]: With dead ends: 1903 [2019-12-18 14:14:36,713 INFO L226 Difference]: Without dead ends: 1903 [2019-12-18 14:14:36,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:14:36,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2019-12-18 14:14:36,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1556. [2019-12-18 14:14:36,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1556 states. [2019-12-18 14:14:36,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 3389 transitions. [2019-12-18 14:14:36,749 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 3389 transitions. Word has length 51 [2019-12-18 14:14:36,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:14:36,750 INFO L462 AbstractCegarLoop]: Abstraction has 1556 states and 3389 transitions. [2019-12-18 14:14:36,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:14:36,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 3389 transitions. [2019-12-18 14:14:36,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 14:14:36,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:14:36,754 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] [2019-12-18 14:14:36,755 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:14:36,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:14:36,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1938702676, now seen corresponding path program 5 times [2019-12-18 14:14:36,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:14:36,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799941715] [2019-12-18 14:14:36,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:14:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:14:36,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:14:36,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799941715] [2019-12-18 14:14:36,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:14:36,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:14:36,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866303062] [2019-12-18 14:14:36,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:14:36,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:14:36,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:14:36,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:14:36,869 INFO L87 Difference]: Start difference. First operand 1556 states and 3389 transitions. Second operand 6 states. [2019-12-18 14:14:37,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:14:37,354 INFO L93 Difference]: Finished difference Result 2810 states and 5967 transitions. [2019-12-18 14:14:37,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:14:37,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-18 14:14:37,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:14:37,362 INFO L225 Difference]: With dead ends: 2810 [2019-12-18 14:14:37,362 INFO L226 Difference]: Without dead ends: 2810 [2019-12-18 14:14:37,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:14:37,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2019-12-18 14:14:37,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 1717. [2019-12-18 14:14:37,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1717 states. [2019-12-18 14:14:37,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 3730 transitions. [2019-12-18 14:14:37,401 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 3730 transitions. Word has length 51 [2019-12-18 14:14:37,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:14:37,402 INFO L462 AbstractCegarLoop]: Abstraction has 1717 states and 3730 transitions. [2019-12-18 14:14:37,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:14:37,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 3730 transitions. [2019-12-18 14:14:37,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 14:14:37,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:14:37,406 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] [2019-12-18 14:14:37,406 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:14:37,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:14:37,407 INFO L82 PathProgramCache]: Analyzing trace with hash 331033730, now seen corresponding path program 6 times [2019-12-18 14:14:37,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:14:37,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342375889] [2019-12-18 14:14:37,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:14:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:14:37,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:14:37,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342375889] [2019-12-18 14:14:37,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:14:37,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:14:37,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971865612] [2019-12-18 14:14:37,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:14:37,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:14:37,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:14:37,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:14:37,535 INFO L87 Difference]: Start difference. First operand 1717 states and 3730 transitions. Second operand 7 states. [2019-12-18 14:14:38,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:14:38,132 INFO L93 Difference]: Finished difference Result 2807 states and 5961 transitions. [2019-12-18 14:14:38,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:14:38,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 14:14:38,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:14:38,139 INFO L225 Difference]: With dead ends: 2807 [2019-12-18 14:14:38,139 INFO L226 Difference]: Without dead ends: 2807 [2019-12-18 14:14:38,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:14:38,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2807 states. [2019-12-18 14:14:38,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2807 to 1649. [2019-12-18 14:14:38,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2019-12-18 14:14:38,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 3580 transitions. [2019-12-18 14:14:38,178 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 3580 transitions. Word has length 51 [2019-12-18 14:14:38,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:14:38,179 INFO L462 AbstractCegarLoop]: Abstraction has 1649 states and 3580 transitions. [2019-12-18 14:14:38,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:14:38,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 3580 transitions. [2019-12-18 14:14:38,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 14:14:38,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:14:38,184 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] [2019-12-18 14:14:38,185 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:14:38,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:14:38,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1700583886, now seen corresponding path program 7 times [2019-12-18 14:14:38,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:14:38,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876339948] [2019-12-18 14:14:38,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:14:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:14:38,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 14:14:38,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876339948] [2019-12-18 14:14:38,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:14:38,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:14:38,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191300771] [2019-12-18 14:14:38,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:14:38,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:14:38,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:14:38,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:14:38,308 INFO L87 Difference]: Start difference. First operand 1649 states and 3580 transitions. Second operand 6 states. [2019-12-18 14:14:38,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:14:38,759 INFO L93 Difference]: Finished difference Result 2926 states and 6181 transitions. [2019-12-18 14:14:38,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:14:38,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-18 14:14:38,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:14:38,764 INFO L225 Difference]: With dead ends: 2926 [2019-12-18 14:14:38,764 INFO L226 Difference]: Without dead ends: 2926 [2019-12-18 14:14:38,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:14:38,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2019-12-18 14:14:38,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1901. [2019-12-18 14:14:38,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1901 states. [2019-12-18 14:14:38,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 4143 transitions. [2019-12-18 14:14:38,805 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 4143 transitions. Word has length 51 [2019-12-18 14:14:38,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:14:38,805 INFO L462 AbstractCegarLoop]: Abstraction has 1901 states and 4143 transitions. [2019-12-18 14:14:38,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:14:38,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 4143 transitions. [2019-12-18 14:14:38,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 14:14:38,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:14:38,810 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] [2019-12-18 14:14:38,810 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:14:38,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:14:38,811 INFO L82 PathProgramCache]: Analyzing trace with hash 92914940, now seen corresponding path program 8 times [2019-12-18 14:14:38,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:14:38,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975487187] [2019-12-18 14:14:38,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:14:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:14:38,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:14:38,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975487187] [2019-12-18 14:14:38,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:14:38,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:14:38,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691456683] [2019-12-18 14:14:38,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:14:38,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:14:38,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:14:38,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:14:38,897 INFO L87 Difference]: Start difference. First operand 1901 states and 4143 transitions. Second operand 3 states. [2019-12-18 14:14:38,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:14:38,952 INFO L93 Difference]: Finished difference Result 2376 states and 5125 transitions. [2019-12-18 14:14:38,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:14:38,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 14:14:38,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:14:38,957 INFO L225 Difference]: With dead ends: 2376 [2019-12-18 14:14:38,957 INFO L226 Difference]: Without dead ends: 2376 [2019-12-18 14:14:38,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:14:38,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2019-12-18 14:14:38,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 1855. [2019-12-18 14:14:38,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1855 states. [2019-12-18 14:14:38,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1855 states to 1855 states and 4061 transitions. [2019-12-18 14:14:38,993 INFO L78 Accepts]: Start accepts. Automaton has 1855 states and 4061 transitions. Word has length 51 [2019-12-18 14:14:38,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:14:38,993 INFO L462 AbstractCegarLoop]: Abstraction has 1855 states and 4061 transitions. [2019-12-18 14:14:38,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:14:38,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1855 states and 4061 transitions. [2019-12-18 14:14:38,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 14:14:38,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:14:38,998 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] [2019-12-18 14:14:38,998 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:14:38,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:14:38,999 INFO L82 PathProgramCache]: Analyzing trace with hash -975275625, now seen corresponding path program 1 times [2019-12-18 14:14:38,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:14:38,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880539258] [2019-12-18 14:14:38,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:14:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:14:39,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:14:39,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880539258] [2019-12-18 14:14:39,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:14:39,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:14:39,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198488505] [2019-12-18 14:14:39,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 14:14:39,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:14:39,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 14:14:39,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:14:39,118 INFO L87 Difference]: Start difference. First operand 1855 states and 4061 transitions. Second operand 8 states. [2019-12-18 14:14:40,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:14:40,636 INFO L93 Difference]: Finished difference Result 3902 states and 8216 transitions. [2019-12-18 14:14:40,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 14:14:40,636 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-18 14:14:40,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:14:40,643 INFO L225 Difference]: With dead ends: 3902 [2019-12-18 14:14:40,643 INFO L226 Difference]: Without dead ends: 3902 [2019-12-18 14:14:40,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2019-12-18 14:14:40,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3902 states. [2019-12-18 14:14:40,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3902 to 1959. [2019-12-18 14:14:40,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1959 states. [2019-12-18 14:14:40,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 4260 transitions. [2019-12-18 14:14:40,747 INFO L78 Accepts]: Start accepts. Automaton has 1959 states and 4260 transitions. Word has length 52 [2019-12-18 14:14:40,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:14:40,748 INFO L462 AbstractCegarLoop]: Abstraction has 1959 states and 4260 transitions. [2019-12-18 14:14:40,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 14:14:40,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 4260 transitions. [2019-12-18 14:14:40,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 14:14:40,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:14:40,753 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] [2019-12-18 14:14:40,753 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:14:40,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:14:40,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1725495463, now seen corresponding path program 2 times [2019-12-18 14:14:40,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:14:40,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938243687] [2019-12-18 14:14:40,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:14:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:14:40,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:14:40,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938243687] [2019-12-18 14:14:40,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:14:40,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:14:40,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427486025] [2019-12-18 14:14:40,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:14:40,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:14:40,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:14:40,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:14:40,819 INFO L87 Difference]: Start difference. First operand 1959 states and 4260 transitions. Second operand 3 states. [2019-12-18 14:14:40,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:14:40,837 INFO L93 Difference]: Finished difference Result 1958 states and 4258 transitions. [2019-12-18 14:14:40,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:14:40,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 14:14:40,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:14:40,840 INFO L225 Difference]: With dead ends: 1958 [2019-12-18 14:14:40,841 INFO L226 Difference]: Without dead ends: 1958 [2019-12-18 14:14:40,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:14:40,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2019-12-18 14:14:40,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1297. [2019-12-18 14:14:40,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1297 states. [2019-12-18 14:14:40,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 2878 transitions. [2019-12-18 14:14:40,867 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 2878 transitions. Word has length 52 [2019-12-18 14:14:40,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:14:40,867 INFO L462 AbstractCegarLoop]: Abstraction has 1297 states and 2878 transitions. [2019-12-18 14:14:40,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:14:40,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 2878 transitions. [2019-12-18 14:14:40,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 14:14:40,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:14:40,871 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] [2019-12-18 14:14:40,871 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:14:40,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:14:40,871 INFO L82 PathProgramCache]: Analyzing trace with hash 238171223, now seen corresponding path program 1 times [2019-12-18 14:14:40,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:14:40,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342323920] [2019-12-18 14:14:40,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:14:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:14:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:14:40,975 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:14:40,975 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:14:40,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x~0_148) (= v_~x$r_buff0_thd0~0_133 0) (= v_~x$r_buff0_thd1~0_227 0) (= 0 |v_ULTIMATE.start_main_~#t1713~0.offset_18|) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1713~0.base_24| 1)) (= v_~weak$$choice2~0_120 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1713~0.base_24| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1713~0.base_24|) |v_ULTIMATE.start_main_~#t1713~0.offset_18| 0)) |v_#memory_int_13|) (= 0 v_~x$read_delayed_var~0.base_7) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1713~0.base_24|) (= 0 v_~__unbuffered_cnt~0_63) (= v_~main$tmp_guard1~0_41 0) (= v_~y~0_147 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1713~0.base_24| 4)) (= 0 |v_#NULL.base_6|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_24 0) (= 0 v_~x$w_buff1_used~0_507) (= 0 v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd0~0_183 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1713~0.base_24|)) (= 0 v_~x$w_buff1~0_317) (= 0 v_~x$w_buff0~0_542) (= 0 v_~x$r_buff0_thd2~0_359) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff0_used~0_792) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x$r_buff1_thd2~0_331) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_542, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ULTIMATE.start_main_~#t1714~0.offset=|v_ULTIMATE.start_main_~#t1714~0.offset_14|, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_~#t1714~0.base=|v_ULTIMATE.start_main_~#t1714~0.base_16|, #length=|v_#length_13|, ~y~0=v_~y~0_147, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ULTIMATE.start_main_~#t1713~0.base=|v_ULTIMATE.start_main_~#t1713~0.base_24|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_507, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_331, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_359, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_792, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t1713~0.offset=|v_ULTIMATE.start_main_~#t1713~0.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_148, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t1714~0.offset, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1714~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t1713~0.base, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1713~0.offset, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 14:14:40,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= 1 v_~x$r_buff0_thd1~0_40) (= v_~x$r_buff1_thd1~0_23 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd2~0_64 v_~x$r_buff0_thd2~0_110) (= v_~y~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74 0)) (= v_~x$r_buff1_thd0~0_37 v_~x$r_buff0_thd0~0_53)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~y~0=v_~y~0_18, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_37} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 14:14:40,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-1-->L799: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1714~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1714~0.offset_10|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1714~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1714~0.base_12|) |v_ULTIMATE.start_main_~#t1714~0.offset_10| 1)) |v_#memory_int_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1714~0.base_12|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1714~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1714~0.base_12| 0)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1714~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1714~0.offset=|v_ULTIMATE.start_main_~#t1714~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1714~0.base=|v_ULTIMATE.start_main_~#t1714~0.base_12|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1714~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1714~0.base, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 14:14:40,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In735093215 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In735093215 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out735093215| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out735093215| ~x$w_buff0_used~0_In735093215)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In735093215, ~x$w_buff0_used~0=~x$w_buff0_used~0_In735093215} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out735093215|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In735093215, ~x$w_buff0_used~0=~x$w_buff0_used~0_In735093215} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 14:14:40,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1327120107 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite15_Out-1327120107| |P1Thread1of1ForFork1_#t~ite14_Out-1327120107|) (= |P1Thread1of1ForFork1_#t~ite14_Out-1327120107| ~x$w_buff0~0_In-1327120107) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1327120107 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-1327120107 256)) (and (= 0 (mod ~x$w_buff1_used~0_In-1327120107 256)) .cse1) (and .cse1 (= (mod ~x$r_buff1_thd2~0_In-1327120107 256) 0))))) (and (= |P1Thread1of1ForFork1_#t~ite14_In-1327120107| |P1Thread1of1ForFork1_#t~ite14_Out-1327120107|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite15_Out-1327120107| ~x$w_buff0~0_In-1327120107)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1327120107, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1327120107, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1327120107, ~weak$$choice2~0=~weak$$choice2~0_In-1327120107, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1327120107, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-1327120107|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1327120107} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1327120107, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1327120107, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1327120107, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-1327120107|, ~weak$$choice2~0=~weak$$choice2~0_In-1327120107, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1327120107, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1327120107|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1327120107} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 14:14:40,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In1277622369 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1277622369 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1277622369 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd1~0_In1277622369 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out1277622369| ~x$w_buff1_used~0_In1277622369) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out1277622369| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1277622369, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1277622369, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1277622369, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1277622369} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1277622369|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1277622369, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1277622369, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1277622369, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1277622369} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 14:14:40,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In904453096 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In904453096 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd1~0_Out904453096 ~x$r_buff0_thd1~0_In904453096)) (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd1~0_Out904453096 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In904453096, ~x$w_buff0_used~0=~x$w_buff0_used~0_In904453096} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out904453096, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out904453096|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In904453096} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 14:14:40,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In1878965937 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In1878965937 256))) (.cse0 (= (mod ~x$r_buff1_thd1~0_In1878965937 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1878965937 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1878965937|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$r_buff1_thd1~0_In1878965937 |P0Thread1of1ForFork0_#t~ite8_Out1878965937|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1878965937, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1878965937, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1878965937, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1878965937} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1878965937, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1878965937|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1878965937, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1878965937, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1878965937} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 14:14:40,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_128 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_128} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 14:14:40,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2124821985 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_In2124821985| |P1Thread1of1ForFork1_#t~ite17_Out2124821985|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite18_Out2124821985| ~x$w_buff1~0_In2124821985)) (and (= ~x$w_buff1~0_In2124821985 |P1Thread1of1ForFork1_#t~ite17_Out2124821985|) .cse0 (= |P1Thread1of1ForFork1_#t~ite18_Out2124821985| |P1Thread1of1ForFork1_#t~ite17_Out2124821985|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In2124821985 256)))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In2124821985 256))) (and (= (mod ~x$r_buff1_thd2~0_In2124821985 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In2124821985 256) 0)))))) InVars {~x$w_buff1~0=~x$w_buff1~0_In2124821985, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2124821985, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2124821985, ~weak$$choice2~0=~weak$$choice2~0_In2124821985, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2124821985, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In2124821985|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2124821985} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out2124821985|, ~x$w_buff1~0=~x$w_buff1~0_In2124821985, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2124821985, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2124821985, ~weak$$choice2~0=~weak$$choice2~0_In2124821985, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2124821985, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out2124821985|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2124821985} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-18 14:14:40,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1664959203 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-1664959203| |P1Thread1of1ForFork1_#t~ite20_Out-1664959203|) (= ~x$w_buff0_used~0_In-1664959203 |P1Thread1of1ForFork1_#t~ite21_Out-1664959203|)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out-1664959203| ~x$w_buff0_used~0_In-1664959203) (= |P1Thread1of1ForFork1_#t~ite20_Out-1664959203| |P1Thread1of1ForFork1_#t~ite21_Out-1664959203|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1664959203 256) 0))) (or (and .cse1 (= (mod ~x$r_buff1_thd2~0_In-1664959203 256) 0)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1664959203 256))) (= (mod ~x$w_buff0_used~0_In-1664959203 256) 0)))))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1664959203|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1664959203, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1664959203, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1664959203, ~weak$$choice2~0=~weak$$choice2~0_In-1664959203, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1664959203} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1664959203|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1664959203, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1664959203, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1664959203|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1664959203, ~weak$$choice2~0=~weak$$choice2~0_In-1664959203, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1664959203} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 14:14:40,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd2~0_135 v_~x$r_buff0_thd2~0_134)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_27, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_14|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 14:14:40,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L768-->L768-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In221202062 256) 0))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In221202062 256) 0))) (or (and (= 0 (mod ~x$w_buff1_used~0_In221202062 256)) .cse0) (= (mod ~x$w_buff0_used~0_In221202062 256) 0) (and (= 0 (mod ~x$r_buff1_thd2~0_In221202062 256)) .cse0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite29_Out221202062| |P1Thread1of1ForFork1_#t~ite30_Out221202062|) (= |P1Thread1of1ForFork1_#t~ite29_Out221202062| ~x$r_buff1_thd2~0_In221202062)) (and (= |P1Thread1of1ForFork1_#t~ite29_In221202062| |P1Thread1of1ForFork1_#t~ite29_Out221202062|) (= |P1Thread1of1ForFork1_#t~ite30_Out221202062| ~x$r_buff1_thd2~0_In221202062) (not .cse1)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In221202062|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In221202062, ~x$w_buff1_used~0=~x$w_buff1_used~0_In221202062, ~weak$$choice2~0=~weak$$choice2~0_In221202062, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In221202062, ~x$w_buff0_used~0=~x$w_buff0_used~0_In221202062} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out221202062|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out221202062|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In221202062, ~x$w_buff1_used~0=~x$w_buff1_used~0_In221202062, ~weak$$choice2~0=~weak$$choice2~0_In221202062, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In221202062, ~x$w_buff0_used~0=~x$w_buff0_used~0_In221202062} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 14:14:40,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-18 14:14:40,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1626410468 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1626410468 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out1626410468| ~x$w_buff1~0_In1626410468) (not .cse0) (not .cse1)) (and (= ~x~0_In1626410468 |P1Thread1of1ForFork1_#t~ite32_Out1626410468|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1626410468, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1626410468, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1626410468, ~x~0=~x~0_In1626410468} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1626410468, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1626410468, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1626410468, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1626410468|, ~x~0=~x~0_In1626410468} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 14:14:40,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_29 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 14:14:40,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1220971812 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1220971812 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-1220971812| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-1220971812| ~x$w_buff0_used~0_In-1220971812)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1220971812, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1220971812} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1220971812|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1220971812, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1220971812} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 14:14:40,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1391191073 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1391191073 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1391191073 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In1391191073 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out1391191073| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In1391191073 |P1Thread1of1ForFork1_#t~ite35_Out1391191073|) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1391191073, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1391191073, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1391191073, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1391191073} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1391191073, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1391191073, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1391191073|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1391191073, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1391191073} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 14:14:40,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1860575950 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1860575950 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out1860575950| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out1860575950| ~x$r_buff0_thd2~0_In1860575950)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1860575950, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1860575950} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1860575950, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1860575950|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1860575950} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 14:14:40,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In591739048 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In591739048 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In591739048 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In591739048 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In591739048 |P1Thread1of1ForFork1_#t~ite37_Out591739048|)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out591739048| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In591739048, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In591739048, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In591739048, ~x$w_buff0_used~0=~x$w_buff0_used~0_In591739048} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In591739048, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In591739048, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In591739048, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out591739048|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In591739048} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 14:14:40,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_269 |v_P1Thread1of1ForFork1_#t~ite37_42|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_41|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 14:14:40,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_64 256)) (= (mod v_~x$w_buff0_used~0_301 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 14:14:40,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1828594052 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1828594052 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1828594052| ~x~0_In1828594052) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1828594052| ~x$w_buff1~0_In1828594052)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1828594052, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1828594052, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1828594052, ~x~0=~x~0_In1828594052} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1828594052|, ~x$w_buff1~0=~x$w_buff1~0_In1828594052, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1828594052, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1828594052, ~x~0=~x~0_In1828594052} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 14:14:40,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_46 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-18 14:14:40,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1246383888 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1246383888 256)))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-1246383888| ~x$w_buff0_used~0_In-1246383888) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite42_Out-1246383888| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1246383888, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1246383888} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1246383888, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1246383888|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1246383888} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 14:14:40,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd0~0_In-328562032 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-328562032 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-328562032 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-328562032 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-328562032| ~x$w_buff1_used~0_In-328562032)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-328562032|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-328562032, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-328562032, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-328562032, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-328562032} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-328562032, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-328562032, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-328562032|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-328562032, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-328562032} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 14:14:40,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1944397223 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1944397223 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out1944397223| ~x$r_buff0_thd0~0_In1944397223) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out1944397223| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1944397223, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1944397223} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1944397223, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1944397223|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1944397223} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 14:14:40,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In846735983 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In846735983 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In846735983 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In846735983 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out846735983|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In846735983 |ULTIMATE.start_main_#t~ite45_Out846735983|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In846735983, ~x$w_buff1_used~0=~x$w_buff1_used~0_In846735983, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In846735983, ~x$w_buff0_used~0=~x$w_buff0_used~0_In846735983} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In846735983, ~x$w_buff1_used~0=~x$w_buff1_used~0_In846735983, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In846735983, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out846735983|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In846735983} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 14:14:40,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~main$tmp_guard1~0_20 0) (= v_~y~0_126 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 2 v_~__unbuffered_p1_EAX~0_27) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite45_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y~0=v_~y~0_126, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:14:41,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:14:41 BasicIcfg [2019-12-18 14:14:41,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:14:41,076 INFO L168 Benchmark]: Toolchain (without parser) took 20453.46 ms. Allocated memory was 138.4 MB in the beginning and 528.5 MB in the end (delta: 390.1 MB). Free memory was 101.3 MB in the beginning and 351.2 MB in the end (delta: -249.8 MB). Peak memory consumption was 140.2 MB. Max. memory is 7.1 GB. [2019-12-18 14:14:41,078 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 14:14:41,078 INFO L168 Benchmark]: CACSL2BoogieTranslator took 813.13 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 100.9 MB in the beginning and 158.1 MB in the end (delta: -57.2 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. [2019-12-18 14:14:41,081 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.57 ms. Allocated memory is still 202.4 MB. Free memory was 158.1 MB in the beginning and 155.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:14:41,082 INFO L168 Benchmark]: Boogie Preprocessor took 42.22 ms. Allocated memory is still 202.4 MB. Free memory was 155.3 MB in the beginning and 153.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:14:41,082 INFO L168 Benchmark]: RCFGBuilder took 785.88 ms. Allocated memory is still 202.4 MB. Free memory was 153.3 MB in the beginning and 109.0 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-18 14:14:41,083 INFO L168 Benchmark]: TraceAbstraction took 18746.15 ms. Allocated memory was 202.4 MB in the beginning and 528.5 MB in the end (delta: 326.1 MB). Free memory was 108.3 MB in the beginning and 351.2 MB in the end (delta: -242.9 MB). Peak memory consumption was 83.3 MB. Max. memory is 7.1 GB. [2019-12-18 14:14:41,092 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.18 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 813.13 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 100.9 MB in the beginning and 158.1 MB in the end (delta: -57.2 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.57 ms. Allocated memory is still 202.4 MB. Free memory was 158.1 MB in the beginning and 155.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.22 ms. Allocated memory is still 202.4 MB. Free memory was 155.3 MB in the beginning and 153.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 785.88 ms. Allocated memory is still 202.4 MB. Free memory was 153.3 MB in the beginning and 109.0 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18746.15 ms. Allocated memory was 202.4 MB in the beginning and 528.5 MB in the end (delta: 326.1 MB). Free memory was 108.3 MB in the beginning and 351.2 MB in the end (delta: -242.9 MB). Peak memory consumption was 83.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 147 ProgramPointsBefore, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 29 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 26 ChoiceCompositions, 4894 VarBasedMoverChecksPositive, 354 VarBasedMoverChecksNegative, 269 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 76691 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1713, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] FCALL, FORK 0 pthread_create(&t1714, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 18.4s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3056 SDtfs, 3165 SDslu, 6895 SDs, 0 SdLazy, 5104 SolverSat, 244 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 37 SyntacticMatches, 25 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9438occurred 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: 1.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 14824 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 725 NumberOfCodeBlocks, 725 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 654 ConstructedInterpolants, 0 QuantifiedInterpolants, 120058 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...